The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Dieter Kratsch" ( http://dblp.L3S.de/Authors/Dieter_Kratsch )

URL (Homepage):  http://www.lita.univ-lorraine.fr/~kratsch/  Author page on DBLP  Author page in RDF  Community of Dieter Kratsch in ASPL-2

Publication years (Num. hits)
1985-1994 (22) 1995-1997 (17) 1998-1999 (15) 2000-2002 (16) 2003-2005 (16) 2006-2007 (18) 2008-2009 (24) 2010-2011 (17) 2012-2013 (22) 2014-2015 (18) 2016 (16) 2017-2018 (15) 2019 (5)
Publication types (Num. hits)
article(125) book(1) incollection(2) inproceedings(87) proceedings(6)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 13 keywords

Results
Found 222 publication records. Showing 221 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Frank Kammer, Dieter Kratsch, Moritz Laudahn Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi Enumeration of maximal irredundant sets for claw-free 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 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
1Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch Enumeration and maximum number of minimal connected vertex covers in graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Finding Cactus Roots in Polynomial Time. Search on Bibsonomy Theory Comput. Syst. 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
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Computing square roots of graphs with low maximum degree. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Dieter Kratsch, Van Bang Le Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. Search on Bibsonomy IPEC 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
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart A linear kernel for finding square roots of almost planar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger Minimal dominating sets in interval graphs and trees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Dieter Kratsch, Van Bang Le Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Search on Bibsonomy WG 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
1Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. Search on Bibsonomy CIAC 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
1Dieter Kratsch Exact Algorithms for Dominating Set. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Squares of Low Clique Number. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Ioan Todinca Guest Editorial: Selected Papers from WG 2014. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma Parameterized Algorithms for Finding Square Roots. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma Finding Shortest Paths Between Graph Colourings. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch Enumerating minimal connected dominating sets in graphs of bounded chordality. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Van Bang Le Algorithms solving the Matching Cut problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Frank Kammer, Dieter Kratsch, Moritz Laudahn Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart A Linear Kernel for Finding Square Roots of Almost Planar Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Squares of Low Maximum Degree. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger Enumerating minimal dominating sets in chordal bipartite graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Frank Kammer, Dieter Kratsch, Moritz Laudahn Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart Finding Cactus Roots in Polynomial Time. Search on Bibsonomy IWOCA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart A Linear Kernel for Finding Square Roots of Almost Planar Graphs. Search on Bibsonomy SWAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Serge Gaspers, Dieter Kratsch Faster Algorithms to Enumerate Hypergraph Transversals. Search on Bibsonomy LATIN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma List Coloring in the Absence of a Linear Forest. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Dieter Kratsch, Sjoerd T. Timmer Exact algorithms for Kayles. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Serge Gaspers, Dieter Kratsch Faster algorithms to enumerate hypergraph transversals. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Search on Bibsonomy ISAAC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Van Bang Le Algorithms Solving the Matching Cut Problem. Search on Bibsonomy CIAC 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
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. Search on Bibsonomy IWOCA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger Enumerating Minimal Subset Feedback Vertex Sets. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei Subset feedback vertex sets in chordal graphs. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma Colouring Reconfiguration Is Fixed-Parameter Tractable. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey Finding clubs in graph classes. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Ioan Todinca (eds.) Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Manfred Cochefert, Dieter Kratsch Exact Algorithms to Clique-Colour Graphs. Search on Bibsonomy SOFSEM 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
1Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma Finding Shortest Paths Between Graph Colourings. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh 0001 Computing Optimal Steiner Trees in Polynomial Space. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger Fully decomposable split graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma Detecting induced minors in AT-free graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier 0001, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. 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
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma Parameterized Algorithms for Finding Square Roots. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001 Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Search on Bibsonomy Inf. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Search on Bibsonomy ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma Sparse Square Roots. Search on Bibsonomy WG The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey Cliques and Clubs. Search on Bibsonomy CIAC 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
1Dieter Kratsch, Stefan Kratsch The Jump Number Problem: Exact and Parameterized. Search on Bibsonomy IPEC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier 0001, Dieter Kratsch Bicolored independent sets and bicliques. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos On exact algorithms for treewidth. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2012 DBLP  DOI  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
1Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma On the parameterized complexity of coloring graphs in the absence of a linear forest. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Daniël Paulusma Detecting Induced Minors in AT-Free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dieter Kratsch, Haiko Müller Colouring AT-Free Graphs. Search on Bibsonomy ESA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jean-François Couturier 0001, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. Search on Bibsonomy SOFSEM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. Search on Bibsonomy IPEC The full citation details ... 2012 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
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
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister 0001, Saket Saurabh 0001 Bandwidth on AT-free graphs. Search on Bibsonomy Theor. Comput. Sci. 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
1Jean-François Couturier 0001, Dieter Kratsch Bicolored independent sets and bicliques. Search on Bibsonomy CTW The full citation details ... 2011 DBLP  BibTeX  RDF
1Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma List Coloring in the Absence of a Linear Forest. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Dieter Kratsch Exact Algorithms for Kayles. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger Enumerating Minimal Subset Feedback Vertex Sets. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh 0001 Parameterized algorithm for eternal vertex cover. 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
1Fedor V. Fomin, Dieter Kratsch Exact Exponential Algorithms Search on Bibsonomy 2010   DOI  RDF
1Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin (eds.) Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010 Search on Bibsonomy Exact Complexity of NP-hard Problems The full citation details ... 2010 DBLP  BibTeX  RDF
1Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin 10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Search on Bibsonomy Exact Complexity of NP-hard Problems The full citation details ... 2010 DBLP  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Jean-François Couturier 0001 Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. 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
1Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001 Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Search on Bibsonomy SWAT 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
1Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch A measure & conquer approach for the analysis of exact algorithms. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Dominating set, exact algorithm, independent set
1Pinar Heggernes, Dieter Kratsch, Daniel Meister 0001 Bandwidth of bipartite permutation graphs in polynomial time. Search on Bibsonomy J. Discrete 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
1Dieter Kratsch, Haiko Müller On a property of minimal triangulations. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister 0001, Saket Saurabh 0001 Bandwidth on AT-Free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 221 (100 per page; Change: )
Pages: [1][2][3][>>]
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