Mathieu Liedloff

ORCID

Publication Activity (10 Years)

Years Active: 2005-2022
Publications (10 Years): 25

Top Venues

University of Metz, France (PHD)

Education History

University of Metz, France

PHD

Publications

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

Mathieu Liedloff.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mathieu Liedloff