Benjamin Momège

Available identifiers

Publication	Date of Publication	Type
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring	2024-07-26	Paper
Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)	2024-05-14	Paper
Simple Paths and Cycles Avoiding Forbidden Paths	2020-10-21	Paper
Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path	2018-09-06	Paper
Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path	2017-04-04	Paper
Finding Paths in Grids with Forbidden Transitions	2016-10-21	Paper
Some Hamiltonian Properties of One-Conflict Graphs	2015-09-15	Paper
Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs	2015-02-20	Paper
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions	2014-11-04	Paper
Trees in Graphs with Conflict Edges or Forbidden Transitions	2013-05-28	Paper

This page was built for person: Benjamin Momège