5 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.OH2013★ 5 cited
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality
Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose +2
In the context of abstract geometrical computation, computing with colored line segments, we study the possibility of having an accumulation with small signal machines, ie, signal…
cs.DS2013★ 1 cited
TREEWIDTH and PATHWIDTH parameterized by vertex cover
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca +1
After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized prob…
cs.CC2010
W[1]-hardness of some domination-like problems parameterized by tree-width
Mathieu Chapelle
The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A genera…