Search    Browse

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 (16) 2010-2012 (16)
Publication types (Num. hits)
article(17) inproceedings(15)
Venues (Conferences, Journals, ...)
WG(5) Algorithmica(3) CoRR(3) Inf. Process. Lett.(3) Theor. Comput. Sci.(3) CIAC(2) IWPEC(2) J. Discrete Algorithms(2) MFCS(2) ACM Transactions on Algorithms(1) CTW(1) Discrete Applied Mathematics(1) Discrete Mathematics & Theoret...(1) SWAT(1) TAMC(1) WADS(1)
Authors
Mathieu Liedloff(32) Dieter Kratsch(19) Serge Gaspers(13) Henning Fernau(7) Jan Kratochvíl(6) Peter Rossmanith(6) Alexander Langer(5) Fedor V. Fomin(5) Joachim Kneis(5) Daniel Raible(4) Daniel Binkele-Raible(3) Ljiljana Brankovic(3) Petr A. Golovach(3) Amer E. Mouawad(2) Faisal N. Abu-Khzam(2) Ioan Todinca(2) More (+10 of total 30)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 32 publication records. Showing 32 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
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
1Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, 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
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
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
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
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
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 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 Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ljiljana 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 Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, 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
1Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  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
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
1Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh Iterative Compression and Exact Algorithms. Search on Bibsonomy MFCS 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
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
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
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
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 - #32 of 32 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.