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 (SOFSEM, 2013)

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

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

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

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

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

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

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

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

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

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 001; Luc Libralesso; Benjamin Momège; Jack Spalding-Jamieson; Brandon Zhang; Da Wei Zheng (ACM J. Exp. Algorithmics, 2023)