Benjamin Momège

According to our database, Benjamin Momège authored at least 11 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.

Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng

ACM J. Exp. Algorithmics, December, 2023

2022

Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge).

Florian Fontan, Pascal Lafourcade, Luc Libralesso, Benjamin Momège

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2018

Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path.

Benjamin Momège

Discret. Appl. Math., 2018

Simple Paths and Cycles Avoiding Forbidden Paths.

Benjamin Momège

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017

Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path.

Benjamin Momège

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2015

Autour de la connexité dans les graphes avec conflits. (On the Connectivity of Graphs with Conflicts).

Benjamin Momège

PhD thesis, 2015

Finding Paths in Grids with Forbidden Transitions.

Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs.

Christian Laforest, Benjamin Momège

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

Some Hamiltonian Properties of One-Conflict Graphs.

Christian Laforest, Benjamin Momège

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Trees in Graphs with Conflict Edges or Forbidden Transitions.

Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège

Proceedings of the Theory and Applications of Models of Computation, 2013

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions.

Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013