Mathieu Liedloff
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
23
Venues
10
Active years
2005–2022
Best venue rank
A*
Where they publish
Papers
23 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | ESA | Enumerating Minimal Connected Dominating Sets. | Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann |
| 2017 | SOFSEM | Enumerating Minimal Tropical Connected Sets. | Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi |
| 2017 | WG | Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. | Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi |
| 2016 | AAIM | 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, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | IWOCA | Upper Domination: Complexity and Approximation. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2015 | CIAC | End-Vertices of Graph Search Algorithms. | Dieter Kratsch, Mathieu Liedloff, Daniel Meister |
| 2015 | SOFSEM | Fixing Improper Colorings of Graphs. | Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski |
| 2015 | WG | Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. | Mathieu Liedloff, Pedro Montealegre, Ioan Todinca |
| 2013 | IWOCA | Exact Algorithms for Weak Roman Domination. | Mathieu Chapelle, Manfred Cochefert, Jean-Franois Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez |
| 2013 | WADS | Treewidth and Pathwidth Parameterized by the Vertex Cover Number. | Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2012 | AAAI | On Finding Optimal Polytrees. | Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider |
| 2012 | WG | Determining the L(2, 1)-Span in Polynomial Space. | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Pawel Rzazewski |
| 2011 | TAMC | Fast Exact Algorithm for | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
| 2011 | WG | Complexity of Splits Reconstruction for Low-Degree Trees. | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
| 2010 | CIAC | An Exact Algorithm for Connected Red-Blue Dominating Set. | Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff |
| 2010 | CIAC | A Parameterized Route to Exact Puzzles: Breaking the 2 | Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith |
| 2010 | WG | Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2008 | MFCS | Iterative Compression and Exact Algorithms. | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
| 2008 | WG | On Independent Sets and Bicliques in Graphs. | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
| 2007 | MFCS | Exact Algorithms for | Jan Kratochvl, Dieter Kratsch, Mathieu Liedloff |
| 2007 | WADS | Branch and Recharge: Exact Algorithms for Generalized Domination. | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvl, Dieter Kratsch, Mathieu Liedloff |
| 2006 | WG | A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. | Serge Gaspers, Mathieu Liedloff |
| 2005 | WG | Roman Domination over Some Graph Classes. | Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng |