Mathieu Liedloff

79 papers A* 1A 1B 16C 9Journal 46Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Enumerating Minimal Connected Dominating Sets.
SIAM J. Discret. Math.
Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
2025 B conf
On Maximum 2-Clubs.
IPEC
Joanne Dumont, Michael Lampis, Mathieu Liedloff, Anthony Perez, Ioan Todinca
2024 J jnl
Moderate exponential-time algorithms for scheduling problems.
Ann. Oper. Res.
Vincent T'kindt, Federico Della Croce, Mathieu Liedloff
2022 J jnl
Enumerating Connected Dominating Sets.
CoRR
Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
2022 A conf
Enumerating Minimal Connected Dominating Sets.
ESA
Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
2022 J jnl
Moderate exponential-time algorithms for scheduling problems.
4OR
Vincent T'kindt, Federico Della Croce, Mathieu Liedloff
2019 J jnl
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.
Algorithmica
Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
2019 J jnl
Enumeration and maximum number of maximal irredundant sets for chordal graphs.
Discret. Appl. Math.
Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2019 J jnl
Enumeration and maximum number of minimal dominating sets for chordal graphs.
Theor. Comput. Sci.
Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2018 J jnl
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques.
Algorithmica
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
2018 J jnl
Exact algorithms for weak Roman domination.
Discret. Appl. Math.
Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez
2018 J jnl
Exact exponential algorithms for 3-machine flowshop scheduling problems.
J. Sched.
Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt
2018 J jnl
Fixing improper colorings of graphs.
Theor. Comput. Sci.
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski
2018 J jnl
The many facets of upper domination.
Theor. Comput. Sci.
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2017 B conf
Enumerating Minimal Tropical Connected Sets.
SOFSEM
Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2017 B conf
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs.
WG
Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2017 J jnl
Exact exponential algorithms to find tropical connected sets of minimum size.
Theor. Comput. Sci.
Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff
2017 J jnl
Treewidth and Pathwidth parameterized by the vertex cover number.
Discret. Appl. Math.
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
2016 C conf
Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
AAIM
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016 J jnl
Fixing improper colorings of graphs.
CoRR
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski
2016 C conf
Upper Domination: Complexity and Approximation.
IWOCA
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015 — book
Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement.
Mathieu Liedloff
2015 J jnl
Algorithmic Aspects of Upper Domination.
CoRR
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015 B conf
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.
WG
Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
2015 J jnl
Complexity of splits reconstruction for low-degree trees.
Discret. Appl. Math.
Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan
2015 C conf
End-Vertices of Graph Search Algorithms.
CIAC
Dieter Kratsch, Mathieu Liedloff, Daniel Meister
2015 B conf
Fixing Improper Colorings of Graphs.
SOFSEM
Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski
2015 J jnl
On finding optimal polytrees.
Theor. Comput. Sci.
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2015 J jnl
On the number of minimal dominating sets on some graph classes.
Theor. Comput. Sci.
Jean-François Couturier, Romain Letourneur, Mathieu Liedloff
2014 J jnl
(Circular) backbone colouring: Forest backbones in planar graphs.
Discret. Appl. Math.
Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca
2014 — conf
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques.
SWAT
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca
2014 J jnl
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques.
CoRR
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca
2014 B conf
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size.
IPEC
Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff
2014 J jnl
Solving Capacitated Dominating Set by using covering by subsets and maximum matching.
Discret. Appl. Math.
Mathieu Liedloff, Ioan Todinca, Yngve Villanger
2013 C conf
A tight bound on the number of minimal dominating sets in split graph.
CTW
Jean-François Couturier, Mathieu Liedloff
2013 J jnl
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.
Theory Comput. Syst.
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin
2013 J jnl
Determining the
Discret. Appl. Math.
Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski
2013 C conf
Exact Algorithms for Weak Roman Domination.
IWOCA
Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez
2013 J jnl
Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Algorithmica
Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff
2013 J jnl
Fast exact algorithm for L(2, 1)-labeling of graphs.
Theor. Comput. Sci.
Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2013 J jnl
On an extension of the Sort & Search method with application to scheduling theory.
Theor. Comput. Sci.
Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'kindt
2013 J jnl
TREEWIDTH and PATHWIDTH parameterized by vertex cover
CoRR
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
2013 B conf
Treewidth and Pathwidth Parameterized by the Vertex Cover Number.
WADS
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
2012 J jnl
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set.
Discret. Math. Theor. Comput. Sci.
Serge Gaspers, Mathieu Liedloff
2012 B conf
Determining the L(2, 1)-Span in Polynomial Space.
WG
Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski
2012 J jnl
On Finding Optimal Polytrees
CoRR
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012 A* conf
On Finding Optimal Polytrees.
AAAI
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012 J jnl
On Independent Sets and Bicliques in Graphs.
Algorithmica
Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2011 J jnl
An exact algorithm for connected red-blue dominating set.
J. Discrete Algorithms
Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff
2011 J jnl
An exact algorithm for the Maximum Leaf Spanning Tree problem.
Theor. Comput. Sci.
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2011 J jnl
Branch and Recharge: Exact Algorithms for Generalized Domination.
Algorithmica
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011 J jnl
Breaking the 2
J. Discrete Algorithms
Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
2011 B conf
Complexity of Splits Reconstruction for Low-Degree Trees.
WG
Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
2011 J jnl
Exact Algorithms for
Algorithmica
Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011 C conf
Fast Exact Algorithm for
TAMC
Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2010 J jnl
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
CoRR
Serge Gaspers, Mathieu Liedloff
2010 C conf
A Parameterized Route to Exact Puzzles: Breaking the 2
CIAC
Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
2010 C conf
An Exact Algorithm for Connected Red-Blue Dominating Set.
CIAC
Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff
2010 J jnl
Complexity of Splits Reconstruction for Low-Degree Trees
CoRR
Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
2010 J jnl
Exact exponential-time algorithms for finding bicliques.
Inf. Process. Lett.
Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff
2010 J jnl
Iterative compression and exact algorithms.
Theor. Comput. Sci.
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2010 B conf
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching.
WG
Mathieu Liedloff, Ioan Todinca, Yngve Villanger
2009 — conf
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.
IWPEC
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009 J jnl
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR
Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009 C conf
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
CTW
Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible
2009 J jnl
Exponential time algorithms for the minimum dominating set problem on some graph classes.
ACM Trans. Algorithms
Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca
2009 J jnl
Sort and Search: Exact algorithms for generalized domination.
Inf. Process. Lett.
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2008 J jnl
Efficient algorithms for Roman domination on some classes of graphs.
Discret. Appl. Math.
Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2008 J jnl
Finding a dominating set on bipartite graphs.
Inf. Process. Lett.
Mathieu Liedloff
2008 B conf
Iterative Compression and Exact Algorithms.
MFCS
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2008 B conf
On Independent Sets and Bicliques in Graphs.
WG
Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
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
2007 J jnl
An exact algorithm for the minimum dominating clique problem.
Theor. Comput. Sci.
Dieter Kratsch, Mathieu Liedloff
2007 B conf
Branch and Recharge: Exact Algorithms for Generalized Domination.
WADS
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2007 B conf
Exact Algorithms for
MFCS
Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2006 B conf
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.
WG
Serge Gaspers, Mathieu Liedloff
2006 — conf
An Exact Algorithm for the Minimum Dominating Clique Problem.
IWPEC
Dieter Kratsch, Mathieu Liedloff
2006 — conf
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.
SWAT
Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2005 B conf
Roman Domination over Some Graph Classes.
WG
Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng