papers
Publications (7)
cs.DS2011
Complexity of Splits Reconstruction for Low-Degree Trees
Serge Gaspers, Mathieu Liedloff, Maya Stein +1
cs.DS2010
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
Serge Gaspers, Mathieu Liedloff
cs.DS2013
TREEWIDTH and PATHWIDTH parameterized by vertex cover
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca +1
cs.CC2015
Algorithmic Aspects of Upper Domination
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel +6
cs.DM2017
Fixing improper colorings of graphs
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff +2
cs.DS2014
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre +1
cs.DS2012
On Finding Optimal Polytrees
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff +2