Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. - Crombez, Loïc; Fonseca, Guilherme Dias da; Fontan, Florian; Gerard, Yan; Gonzalez-Lorenzo, Aldo; Lafourcade, Pascal; Libralesso, Luc; Momège, Benjamin; Spalding-Jamieson, Jack; Zhang, Brandon; Zheng, Da Wei (ACM J. Exp. Algorithmics, 2023)

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. - Crombez, Loïc; Fonseca, Guilherme Dias da; Fontan, Florian; Gerard, Yan; Gonzalez-Lorenzo, Aldo; Lafourcade, Pascal; Libralesso, Luc; Momège, Benjamin; Spalding-Jamieson, Jack; Zhang, Brandon; Zheng, Da Wei (CoRR, 2023)

Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge). - Fontan, Florian; Lafourcade, Pascal; Libralesso, Luc; Momège, Benjamin (2022)

Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path. - Momège, Benjamin (Discret. Appl. Math., 2018)

Simple Paths and Cycles Avoiding Forbidden Paths. - Momège, Benjamin (2018)

Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path. - Momège, Benjamin (2017)

Autour de la connexité dans les graphes avec conflits. (On the Connectivity of Graphs with Conflicts). - Momège, Benjamin (2015)

Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs. - Laforest, Christian; Momège, Benjamin (2015)

Finding Paths in Grids with Forbidden Transitions. - Kanté, Mamadou Moustapha; Moataz, Fatima Zahra; Momège, Benjamin; Nisse, Nicolas (2015)

Some Hamiltonian Properties of One-Conflict Graphs. - Laforest, Christian; Momège, Benjamin (2014)

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. - Kanté, Mamadou Moustapha; Laforest, Christian; Momège, Benjamin (2013)

Trees in Graphs with Conflict Edges or Forbidden Transitions. - Kanté, Mamadou Moustapha; Laforest, Christian; Momège, Benjamin (2013)