Dieter Kratsch
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
69
Venues
14
Active years
1985–2021
Best venue rank
A*
Where they publish
Papers
69 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2021 | STACS | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. | Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
| 2017 | CIAC | Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. | Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi |
| 2017 | SOFSEM | Enumerating Minimal Tropical Connected Sets. | Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi |
| 2017 | WG | Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Danil Paulusma |
| 2017 | WG | Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. | Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi |
| 2016 | IWOCA | Finding Cactus Roots in Polynomial Time. | Petr A. Golovach, Dieter Kratsch, Danil Paulusma, Anthony Stewart |
| 2016 | LATIN | Faster Algorithms to Enumerate Hypergraph Transversals. | Manfred Cochefert, Jean-Franois Couturier, Serge Gaspers, Dieter Kratsch |
| 2016 | MFCS | Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. | Frank Kammer, Dieter Kratsch, Moritz Laudahn |
| 2015 | CIAC | Algorithms Solving the Matching Cut Problem. | Dieter Kratsch, Van Bang Le |
| 2015 | CIAC | End-Vertices of Graph Search Algorithms. | Dieter Kratsch, Mathieu Liedloff, Daniel Meister |
| 2015 | ISAAC | Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. | Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kant, Dieter Kratsch, Sigve Hortemo Sther, Yngve Villanger |
| 2015 | IWOCA | Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch |
| 2014 | SOFSEM | Exact Algorithms to Clique-Colour Graphs. | Manfred Cochefert, Dieter Kratsch |
| 2013 | CIAC | Cliques and Clubs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey |
| 2013 | ICALP | An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger |
| 2013 | IWOCA | Exact Algorithms for Weak Roman Domination. | Mathieu Chapelle, Manfred Cochefert, Jean-Franois Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez |
| 2013 | WG | Sparse Square Roots. | Manfred Cochefert, Jean-Franois Couturier, Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2012 | ESA | Colouring AT-Free Graphs. | Dieter Kratsch, Haiko Mller |
| 2012 | ISAAC | Detecting Induced Minors in AT-Free Graphs. | Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2012 | SOFSEM | Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. | Jean-Franois Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch |
| 2011 | WADS | Enumerating Minimal Subset Feedback Vertex Sets. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
| 2011 | WG | Exact Algorithms for Kayles. | Hans L. Bodlaender, Dieter Kratsch |
| 2011 | WG | List Coloring in the Absence of a Linear Forest. | Jean-Franois Couturier, Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 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 | Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. | Petr A. Golovach, Dieter Kratsch, Jean-Franois Couturier |
| 2009 | COCOON | Convex Recoloring Revisited: Complexity and Exact Algorithms. | Iyad A. Kanj, Dieter Kratsch |
| 2009 | ISAAC | Bandwidth on AT-Free Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
| 2009 | IWOCA | Fully Decomposable Split Graphs. | Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger |
| 2008 | ESA | Faster Steiner Tree Computation in Polynomial-Space. | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2008 | LATIN | Bandwidth of Bipartite Permutation Graphs in Polynomial Time. | Pinar Heggernes, Dieter Kratsch, Daniel Meister |
| 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 | ESA | On Exact Algorithms for Treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
| 2006 | MFCS | Optimal Linear Arrangement of Interval Graphs. | Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov |
| 2006 | SODA | Measure and conquer: a simple O(2 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2005 | COCOON | On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. | Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng |
| 2005 | FCT | Exact Algorithms for Graph Homomorphisms. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
| 2005 | ICALP | Measure and Conquer: Domination - A Case Study. | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2004 | ICALP | Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. | Fedor V. Fomin, Dieter Kratsch, Ioan Todinca |
| 2004 | WG | Exact (Exponential) Algorithms for the Dominating Set Problem. | Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger |
| 2003 | FCT | Linear Time Algorithms for Some NP-Complete Problems on (P | Hans L. Bodlaender, Andreas Brandstdt, Dieter Kratsch, Michal Rao, Jeremy P. Spinrad |
| 2003 | SODA | Certifying algorithms for recognizing interval graphs and permutation graphs. | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad |
| 2003 | SODA | Between O(nm) and O(n alpha). | Dieter Kratsch, Jeremy P. Spinrad |
| 2003 | WG | Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. | Dieter Kratsch, Haiko Mller, Ioan Todinca |
| 2001 | FCT | Approximating Minimum Cocolourings. | Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli |
| 2000 | WG | On the Domination Search Number. | Fedor V. Fomin, Dieter Kratsch, Haiko Mller |
| 2000 | WG | Bandwidth of Split and Circular Permutation Graphs. | Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Mller |
| 1999 | STACS | Approximating Bandwidth by Mixing Layouts of Interval Graphs. | Dieter Kratsch, Lorna Stewart |
| 1999 | WG | On Claw-Free Asteroidal Triple-Free Graphs. | Harald Hempel, Dieter Kratsch |
| 1998 | MFCS | Degree-Preserving Forests. | Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Mller, Hilde Tuinstra |
| 1998 | WG | A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | ICALP | Independent Sets in Asteroidal Triple-Free Graphs. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | WG | Asteroidal Sets in Graphs. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1996 | ICALP | Minimum Fill-In on Circle and Circular-Arc Graphs. | Ton Kloks, Dieter Kratsch, C. K. Wong |
| 1995 | ESA | Approximating the Bandwidth for Asteroidal Triple-Free Graphs. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1995 | WG | Diametral Path Graphs. | Jitender S. Deogun, Dieter Kratsch |
| 1995 | WG | Finding and Counting Small Induced Subgraphs Efficiently. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1994 | ESA | Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1994 | STACS | On Vertex Ranking for Permutations and Other Graphs. | Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1994 | STACS | Finding All Minimal Separators of a Graph. | Ton Kloks, Dieter Kratsch |
| 1994 | WG | Ranking of Graphs. | Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Mller, Zsolt Tuza |
| 1994 | WG | Dominoes. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1993 | ESA | Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1993 | ICALP | Treewidth and Pathwidth of Permutation Graphs. | Hans L. Bodlaender, Ton Kloks, Dieter Kratsch |
| 1993 | STACS | Treewidth of Bipartite Graphs. | Ton Kloks, Dieter Kratsch |
| 1991 | FCT | On the Complexity of Graph Reconstruction. | Dieter Kratsch, Lane A. Hemachandra |
| 1985 | FCT | On the restriction of some NP-complete graph problems to permutation graphs. | Andreas Brandstdt, Dieter Kratsch |