Constructing Brambles. - Mathieu Chapelle; Frédéric Mazoit; Ioan Todinca (MFCS, 2009)

Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs - Mathieu Chapelle (CoRR, 2010)

Décompositions de graphes : quelques limites et obstructions. (Graphs decompositions: some limites and obstructions). - Mathieu Chapelle (2011)

Exact Algorithms for Weak Roman Domination. - Mathieu Chapelle; Manfred Cochefert; Jean-François Couturier 001; Dieter Kratsch; Mathieu Liedloff; Anthony Perez 001 (IWOCA, 2013)

Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality. - Florent Becker; Mathieu Chapelle; Jérôme Durand-Lose; Vincent Levorato; Maxime Senot (CoRR, 2013)

TREEWIDTH and PATHWIDTH parameterized by vertex cover - Mathieu Chapelle; Mathieu Liedloff; Ioan Todinca; Yngve Villanger (CoRR, 2013)

Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. - Mathieu Chapelle; Manfred Cochefert; Dieter Kratsch; Romain Letourneur; Mathieu Liedloff (IPEC, 2014)

Injective Colorings with Arithmetic Constraints. - Natacha Astromujoff; Mathieu Chapelle; Martín Matamala; Ioan Todinca; José Zamora (Graphs Comb., 2015)

Treewidth and Pathwidth parameterized by the vertex cover number. - Mathieu Chapelle; Mathieu Liedloff; Ioan Todinca; Yngve Villanger (Discret. Appl. Math., 2017)

Exact exponential algorithms to find tropical connected sets of minimum size. - Mathieu Chapelle; Manfred Cochefert; Dieter Kratsch; Romain Letourneur; Mathieu Liedloff (Theor. Comput. Sci., 2017)

Exact algorithms for weak Roman domination. - Mathieu Chapelle; Manfred Cochefert; Jean-François Couturier 001; Dieter Kratsch; Romain Letourneur; Mathieu Liedloff; Anthony Perez 001 (Discret. Appl. Math., 2018)

Abstract geometrical computation 8: Small machines, accumulations & rationality. - Florent Becker; Mathieu Chapelle; Jérôme Durand-Lose; Vincent Levorato; Maxime Senot (J. Comput. Syst. Sci., 2018)