Mathieu Liedloff

According to our database, Mathieu Liedloff authored at least 58 papers between 2005 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Enumerating Connected Dominating Sets.

Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann

CoRR, 2022

Moderate exponential-time algorithms for scheduling problems.

Vincent T'kindt, Federico Della Croce, Mathieu Liedloff

4OR, 2022

Enumerating Minimal Connected Dominating Sets.

Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2019

Enumeration and maximum number of minimal dominating sets for chordal graphs.

Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi

Theor. Comput. Sci., 2019

Enumeration and maximum number of maximal irredundant sets for chordal graphs.

Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi

Discret. Appl. Math., 2019

Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.

Mathieu Liedloff, Pedro Montealegre, Ioan Todinca

Algorithmica, 2019

2018

Fixing improper colorings of graphs.

Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski

Theor. Comput. Sci., 2018

The many facets of upper domination.

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos

Theor. Comput. Sci., 2018

Exact exponential algorithms for 3-machine flowshop scheduling problems.

Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt

J. Sched., 2018

Exact algorithms for weak Roman domination.

Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez

Discret. Appl. Math., 2018

Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques.

Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca

Algorithmica, 2018

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

Treewidth and Pathwidth parameterized by the vertex cover number.

Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger

Discret. Appl. Math., 2017

Enumerating Minimal Tropical Connected Sets.

Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016

Upper Domination: Complexity and Approximation.

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

On finding optimal polytrees.

Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider

Theor. Comput. Sci., 2015

On the number of minimal dominating sets on some graph classes.

Jean-François Couturier, Romain Letourneur, Mathieu Liedloff

Theor. Comput. Sci., 2015

Complexity of splits reconstruction for low-degree trees.

Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan

Discret. Appl. Math., 2015

Algorithmic Aspects of Upper Domination.

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos

CoRR, 2015

Fixing Improper Colorings of Graphs.

Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

End-Vertices of Graph Search Algorithms.

Dieter Kratsch, Mathieu Liedloff, Daniel Meister

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement.

Mathieu Liedloff

, 2015

2014

Solving Capacitated Dominating Set by using covering by subsets and maximum matching.

Mathieu Liedloff, Ioan Todinca, Yngve Villanger

Discret. Appl. Math., 2014

(Circular) backbone colouring: Forest backbones in planar graphs.

Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca

Discret. Appl. Math., 2014

Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size.

Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

On an extension of the Sort & Search method with application to scheduling theory.

Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'kindt

Theor. Comput. Sci., 2013

Fast exact algorithm for L(2, 1)-labeling of graphs.

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski

Theor. Comput. Sci., 2013

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin

Theory Comput. Syst., 2013

Determining the <i>L</i>(2, 1)L(2, 1)-span in polynomial space.

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski

Discret. Appl. Math., 2013

TREEWIDTH and PATHWIDTH parameterized by vertex cover

Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger

CoRR, 2013

Exact and Parameterized Algorithms for Max Internal Spanning Tree.

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff

Algorithmica, 2013

Exact Algorithms for Weak Roman Domination.

Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

A tight bound on the number of minimal dominating sets in split graph.

Jean-François Couturier, Mathieu Liedloff

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set.

Serge Gaspers, Mathieu Liedloff

Discret. Math. Theor. Comput. Sci., 2012

On Independent Sets and Bicliques in Graphs.

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff

Algorithmica, 2012

Determining the L(2, 1)-Span in Polynomial Space.

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

An exact algorithm for the Maximum Leaf Spanning Tree problem.

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith

Theor. Comput. Sci., 2011

Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack.

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk

J. Discrete Algorithms, 2011

An exact algorithm for connected red-blue dominating set.

Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff

J. Discrete Algorithms, 2011

Exact Algorithms for <i>L</i>(2, 1)-Labeling of Graphs.

Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff

Algorithmica, 2011

Branch and Recharge: Exact Algorithms for Generalized Domination.

Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff

Algorithmica, 2011

Fast Exact Algorithm for <i>L</i>(2, 1)-Labeling of Graphs.

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

Iterative compression and exact algorithms.

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh

Theor. Comput. Sci., 2010

Exact exponential-time algorithms for finding bicliques.

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff

Inf. Process. Lett., 2010

A Parameterized Route to Exact Puzzles: Breaking the 2^<i>n</i>-Barrier for Irredundance.

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Exponential time algorithms for the minimum dominating set problem on some graph classes.

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca

ACM Trans. Algorithms, 2009

Sort and Search: Exact algorithms for generalized domination.

Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff

Inf. Process. Lett., 2009

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles

Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith

CoRR, 2009

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.

Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Finding a dominating set on bipartite graphs.

Mathieu Liedloff

Inf. Process. Lett., 2008

Efficient algorithms for Roman domination on some classes of graphs.

Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Discret. Appl. Math., 2008

2007

Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisations. (Excat exponential time algorithms for NP-hard problems : domination, variants and generalizations).

Mathieu Liedloff

PhD thesis, 2007

An exact algorithm for the minimum dominating clique problem.

Dieter Kratsch, Mathieu Liedloff

Theor. Comput. Sci., 2007

Exact Algorithms for <i>L</i> (2, 1)-Labeling of Graphs.

Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.

Serge Gaspers, Mathieu Liedloff

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff

Proceedings of the Algorithm Theory, 2006

2005

Roman Domination over Some Graph Classes.

Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005