Mathieu Liedloff

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (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): 645-667 (2013)

Jean-François Couturier, Mathieu Liedloff: A tight bound on the number of minimal dominating sets in split graph. CTW 2013: 67-70

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (2012)

Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42 (2012)

Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees. AAAI 2012

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski: Determining the L(2, 1)-Span in Polynomial Space. WG 2012: 126-137

Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees. CoRR abs/1208.1692 (2012)

Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (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): 252-273 (2011)

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)

Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff: An exact algorithm for connected red-blue dominating set. J. Discrete Algorithms 9(3): 252-262 (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): 6290-6302 (2011)

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski: Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93

Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: 167-178

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010)

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7-9): 1045-1053 (2010)

Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff: An Exact Algorithm for Connected Red-Blue Dominating Set. CIAC 2010: 25-36

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith: A Parameterized Route to Exact Puzzles: Breaking the 2ⁿ-Barrier for Irredundance. CIAC 2010: 311-322

Mathieu Liedloff, Ioan Todinca, Yngve Villanger: Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. WG 2010: 88-99

Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan: Complexity of Splits Reconstruction for Low-Degree Trees. CoRR abs/1007.1733 (2010)

Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. CoRR abs/1009.1381 (2010)

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): 795-798 (2009)

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca: Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms 6(1) (2009)

Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209

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: 161-172

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 abs/0909.4224 (2009)

Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Efficient algorithms for Roman domination on some classes of graphs. Discrete Applied Mathematics 156(18): 3400-3415 (2008)

Mathieu Liedloff: Finding a dominating set on bipartite graphs. Inf. Process. Lett. 107(5): 154-157 (2008)

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. WG 2008: 171-182

Dieter Kratsch, Mathieu Liedloff: An exact algorithm for the minimum dominating clique problem. Theor. Comput. Sci. 385(1-3): 226-240 (2007)

Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Exact Algorithms for L (2, 1)-Labeling of Graphs. MFCS 2007: 513-524

Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518

Dieter Kratsch, Mathieu Liedloff: An Exact Algorithm for the Minimum Dominating Clique Problem. IWPEC 2006: 130-141

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff: Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT 2006: 148-159

Serge Gaspers, Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. WG 2006: 78-89

Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Roman Domination over Some Graph Classes. WG 2005: 103-114