Benjamin Momège

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring ACM Journal of Experimental Algorithmics	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 SOFSEM 2018: Theory and Practice of Computer Science	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 Discrete Applied Mathematics	2018-09-06	Paper
Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path SOFSEM 2017: Theory and Practice of Computer Science	2017-04-04	Paper
Finding paths in grids with forbidden transitions Graph-Theoretic Concepts in Computer Science	2016-10-21	Paper
Some Hamiltonian properties of one-conflict graphs Lecture Notes in Computer Science	2015-09-15	Paper
Nash-Williams-type and Chvátal-type conditions in one-conflict graphs Lecture Notes in Computer Science	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 Lecture Notes in Computer Science	2014-11-04	Paper
Trees in graphs with conflict edges or forbidden transitions Lecture Notes in Computer Science	2013-05-28	Paper

Research outcomes over time

This page was built for person: Benjamin Momège