Benjamin Momège

dblp:125/2362 · DBLP profile ↗

← Back

9ranked-venue papers

3as first author

1since 2021 · last 2022

0000-0001-8359-1210ORCID · corroborated

Theory of computation · 5 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 2 first-author

Year	Publication	Venue	Position
2022	Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge) abstract International audience Florian Fontan, Pascal Lafourcade 0001, Luc Libralesso, Benjamin Momège	SoCG	4
2018	Simple Paths and Cycles Avoiding Forbidden Paths Benjamin Momège	SOFSEM	1
2018	Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path Benjamin Momège	Discret. Appl. Math.	1
2017	Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path Benjamin Momège	SOFSEM	1
2015	Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs Christian Laforest, Benjamin Momège	SOFSEM	2
2015	Finding Paths in Grids with Forbidden Transitions Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse	WG	3
2014	Some Hamiltonian Properties of One-Conflict Graphs Christian Laforest, Benjamin Momège	IWOCA	2
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	SOFSEM	3
2013	Trees in Graphs with Conflict Edges or Forbidden Transitions Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège	TAMC	3