The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Mathieu Liedloff" ( http://dblp.L3S.de/Authors/Mathieu_Liedloff )

URL (Homepage):  http://www.univ-orleans.fr/lifo/Members/Mathieu.Liedloff/  Author page on DBLP  Author page in RDF  Community of Mathieu Liedloff in ASPL-2

Publication years (Num. hits)
2005-2009 (17) 2010-2012 (19) 2013-2015 (22) 2016-2019 (15)
Publication types (Num. hits)
article(42) book(1) inproceedings(29) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 74 publication records. Showing 73 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Mathieu Liedloff, Pedro Montealegre, Ioan Todinca Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi Enumeration and maximum number of minimal dominating sets for chordal graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi Enumeration and maximum number of maximal irredundant sets for chordal graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cristina 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. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski Fixing improper colorings of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier 0001, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez 0001 Exact algorithms for weak Roman domination. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lei Shang 0001, Christophe Lenté, Mathieu Liedloff, Vincent T'Kindt Exact exponential algorithms for 3-machine flowshop scheduling problems. Search on Bibsonomy J. Scheduling The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff Exact exponential algorithms to find tropical connected sets of minimum size. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger Treewidth and Pathwidth parameterized by the vertex cover number. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi Enumerating Minimal Tropical Connected Sets. Search on Bibsonomy SOFSEM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski Fixing improper colorings of graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Cristina 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. Search on Bibsonomy IWOCA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Cristina 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. Search on Bibsonomy AAIM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier 0001, Romain Letourneur, Mathieu Liedloff On the number of minimal dominating sets on some graph classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider On finding optimal polytrees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Cristina 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. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan Complexity of splits reconstruction for low-degree trees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement. Search on Bibsonomy 2015   RDF
1Mathieu Liedloff, Pedro Montealegre, Ioan Todinca Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Mathieu Liedloff, Daniel Meister 0001 End-Vertices of Graph Search Algorithms. Search on Bibsonomy CIAC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski Fixing Improper Colorings of Graphs. Search on Bibsonomy SOFSEM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca (Circular) backbone colouring: Forest backbones in planar graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff, Ioan Todinca, Yngve Villanger Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. Search on Bibsonomy SWAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff Exact and Parameterized Algorithms for Max Internal Spanning Tree. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski Fast exact algorithm for L(2, 1)-labeling of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'Kindt On an extension of the Sort & Search method with application to scheduling theory. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger TREEWIDTH and PATHWIDTH parameterized by vertex cover Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski Determining the L(2, 1)L(2, 1)-span in polynomial space. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier 0001, Mathieu Liedloff A tight bound on the number of minimal dominating sets in split graph. Search on Bibsonomy CTW The full citation details ... 2013 DBLP  BibTeX  RDF
1Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger Treewidth and Pathwidth Parameterized by the Vertex Cover Number. Search on Bibsonomy WADS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier 0001, Dieter Kratsch, Mathieu Liedloff, Anthony Perez 0001 Exact Algorithms for Weak Roman Domination. Search on Bibsonomy IWOCA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2012 DBLP  BibTeX  RDF
1Serge Gaspers, Dieter Kratsch, Mathieu Liedloff On Independent Sets and Bicliques in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider On Finding Optimal Polytrees Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski Determining the L(2, 1)-Span in Polynomial Space. Search on Bibsonomy WG The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider On Finding Optimal Polytrees. Search on Bibsonomy AAAI The full citation details ... 2012 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff Branch and Recharge: Exact Algorithms for Generalized Domination. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff Exact Algorithms for L(2, 1)-Labeling of Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible 0001, Peter Rossmanith An exact algorithm for the Maximum Leaf Spanning Tree problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff An exact algorithm for connected red-blue dominating set. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel 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 2n-barrier for Irredundance: Two lines of attack. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan Complexity of Splits Reconstruction for Low-Degree Trees. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff Exact exponential-time algorithms for finding bicliques. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh 0001 Iterative compression and exact algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan Complexity of Splits Reconstruction for Low-Degree Trees Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Mathieu Liedloff, Ioan Todinca, Yngve Villanger Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. Search on Bibsonomy WG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. Search on Bibsonomy CIAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff An Exact Algorithm for Connected Red-Blue Dominating Set. Search on Bibsonomy CIAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff Sort and Search: Exact algorithms for generalized domination. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca Exponential time algorithms for the minimum dominating set problem on some graph classes. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible 0001, Peter Rossmanith Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible 0001 Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
1Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible 0001, Peter Rossmanith An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff Finding a dominating set on bipartite graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng Efficient algorithms for Roman domination on some classes of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh 0001 Iterative Compression and Exact Algorithms. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Dieter Kratsch, Mathieu Liedloff On Independent Sets and Bicliques in Graphs. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Mathieu Liedloff An exact algorithm for the minimum dominating clique problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff Exact Algorithms for L (2, 1)-Labeling of Graphs. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff Branch and Recharge: Exact Algorithms for Generalized Domination. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff 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). Search on Bibsonomy 2007   RDF
1Serge Gaspers, Mathieu Liedloff A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Dieter Kratsch, Mathieu Liedloff Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Mathieu Liedloff An Exact Algorithm for the Minimum Dominating Clique Problem. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng Roman Domination over Some Graph Classes. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #73 of 73 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license