Benjamin Momège

Post-Doctoral Researcher at Inria-Lille in the Project-Team Bonsai

Areas of Interest: Algorithms and data structures, Automata theory, Bioinformatics, Combinatorics, Complexity theory, Database theory, Discrete Mathematics, Formal language, Game Theory, Graph Theory, Logic, Optimization


List of Papers :

-An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions

* With Mamadou Moustapha Kanté and Christian Laforest
* SOFSEM, 2013, Lecture Notes in Computer Science, vol. 7741, pp. 268-279.

-Trees in Graphs with Conflict Edges or Forbidden Transitions

* With Mamadou Moustapha Kanté and Christian Laforest
* TAMC, 2013, Lecture Notes in Computer Science, vol. 7876, pp. 343-354.

-Some Hamiltonian Properties of One-Conflict Graphs

* With Christian Laforest
* IWOCA, 2014, Lecture Notes in Computer Science
, vol. 8986, pp. 262-273.

-
An Upper Bound on the Number of Accesses for Datalog α Last Queries
* With John Samuel
* BDA, 2014.

-Nash-Williams and Chvátal Conditions in One-Conflict Graphs

* With Christian Laforest
* SOFSEM, 2015, Lecture Notes in Computer Science, vol. 8939, pp. 327-338.

-Finding Paths in Grids with Forbidden Transitions

* With Mamadou Moustapha Kanté, Fatima Zahra Moataz and Nicolas Nisse
* WG, 2015,
Lecture Notes in Computer Science, vol. 9224, pp. 154-168. (Short version in AlgoTel 2015.)

-Sufficient Conditions for a Connected Graph to have a Hamiltonian Path
* SOFSEM, 2017, 
Lecture Notes in Computer Science, vol. 10139, pp. 205-216.

Popularization (in french):


Arbres dans les graphes avec conflits
Euler, Hamilton et Transitions Interdites


Talks:

-JGA (14èmes Journées Graphes et Algorithmes, November 16, 2012, France). Un algorithme exact en temps O*2n vérifiant l'existence d'un chemin entre deux sommets donnés d'un graphe avec transitions interdites. 

-SOFSEM (39th International Conference on Current Trends in Theory and Practice of Computer Science, January 29, 2013, Czech Republic). An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalization of the Cut Problem in Graphs with Forbidden Transitions. 

-IWOCA (25th International Workshop on Combinatorial Algorithms, October 16, 2014, Duluth, USA). Some Hamiltonian Properties of One-Conflict Graphs. 

-SOFSEM (41st International Conference on Current Trends in Theory and Practice of Computer Science, January 26, 2015, Czech Republic). Nash-Williams and Chvátal Conditions in One-Conflict Graphs.

-Verification Seminar (Université Libre de Bruxelles, May 22, 2015, Belgium). Connectivity in graphs with conflicts.

-Project-Team COATI Seminar (INRIA Sophia Antipolis, June 24, 2015, France). Connectivity in graphs with conflicts.

-Distributed Algorithms and Graphs Seminar (Institut de Recherche en Informatique Fondamentale (IRIF), March 29, 2016, Paris, France). Connectivity in graphs with conflicts.

-CANA Seminar (CAlcul NAturel - Laboratoire d'Informatique Fondamentale (LIF), April 05, 2016, Marseille, France). Connectivity in graphs with conflicts.

-MALOTEC Seminar (MAthématique et LOgique pour l'exTraction et le traitEment de Connaissances - Laboratoire lOrrain de Recherche en Informatique et ses Applications (LORIA), April 15, 2016, Nancy, France). Connectivity in graphs with conflits.

-SOFSEM (43rd International Conference on Current Trends in Theory and Practice of Computer Science, January 18, 2017, Ireland). Sufficient Conditions for a Connected Graph to have a Hamiltonian Path.