Dieter Kratsch

226 papers A* 8A 11B 47C 11Misc 2Journal 129Unranked 12

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021	A	`conf`	Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021	J	`jnl`	Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2020	J	`jnl`	Enumeration of minimal connected dominating sets for chordal graphs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2020	J	`jnl`	Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. Discret. Appl. Math. Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2019	J	`jnl`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2019	J	`jnl`	Enumeration and maximum number of maximal irredundant sets for chordal graphs. Discret. Appl. Math. Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2019	J	`jnl`	Enumeration and maximum number of minimal dominating sets for chordal graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2019	J	`jnl`	Enumeration of maximal irredundant sets for claw-free graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi
2019	J	`jnl`	Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica Frank Kammer, Dieter Kratsch, Moritz Laudahn
2018	J	`jnl`	Computing square roots of graphs with low maximum degree. Discret. Appl. Math. Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2018	J	`jnl`	Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2018	J	`jnl`	Exact algorithms for weak Roman domination. Discret. Appl. Math. Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez
2018	J	`jnl`	Finding Cactus Roots in Polynomial Time. Theory Comput. Syst. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2018	B	`conf`	Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. IPEC Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2018	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2017	J	`jnl`	A linear kernel for finding square roots of almost planar graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2017	B	`conf`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	J	`jnl`	Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	B	`conf`	Enumerating Minimal Tropical Connected Sets. SOFSEM Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2017	B	`conf`	Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. WG Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2017	C	`conf`	Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. CIAC Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi
2017	J	`jnl`	Exact exponential algorithms to find tropical connected sets of minimum size. Theor. Comput. Sci. Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff
2017	J	`jnl`	Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2017	J	`jnl`	Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. Discret. Appl. Math. Feodor F. Dragan, Dieter Kratsch, Van Bang Le
2016	—	`conf`	A Linear Kernel for Finding Square Roots of Almost Planar Graphs. SWAT Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	A Linear Kernel for Finding Square Roots of Almost Planar Graphs. CoRR Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	Algorithms solving the Matching Cut problem. Theor. Comput. Sci. Dieter Kratsch, Van Bang Le
2016	J	`jnl`	Enumerating minimal connected dominating sets in graphs of bounded chordality. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2016	J	`jnl`	Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2016	J	`jnl`	Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2016	—	`ch.`	Exact Algorithms for Dominating Set. Encyclopedia of Algorithms Dieter Kratsch
2016	B	`conf`	Faster Algorithms to Enumerate Hypergraph Transversals. LATIN Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
2016	C	`conf`	Finding Cactus Roots in Polynomial Time. IWOCA Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	Finding Shortest Paths Between Graph Colourings. Algorithmica Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2016	J	`jnl`	Guest Editorial: Selected Papers from WG 2014. Algorithmica Dieter Kratsch, Ioan Todinca
2016	J	`jnl`	Parameterized Algorithms for Finding Square Roots. Algorithmica Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2016	B	`conf`	Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. MFCS Frank Kammer, Dieter Kratsch, Moritz Laudahn
2016	J	`jnl`	Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. CoRR Frank Kammer, Dieter Kratsch, Moritz Laudahn
2016	J	`jnl`	Squares of Low Clique Number. Electron. Notes Discret. Math. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	Squares of Low Maximum Degree. CoRR Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2015	C	`conf`	Algorithms Solving the Matching Cut Problem. CIAC Dieter Kratsch, Van Bang Le
2015	J	`jnl`	An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2015	C	`conf`	End-Vertices of Graph Search Algorithms. CIAC Dieter Kratsch, Mathieu Liedloff, Daniel Meister
2015	B	`conf`	Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2015	C	`conf`	Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2015	J	`jnl`	Exact algorithms for Kayles. Theor. Comput. Sci. Hans L. Bodlaender, Dieter Kratsch, Sjoerd T. Timmer
2015	J	`jnl`	Faster algorithms to enumerate hypergraph transversals. CoRR Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
2015	J	`jnl`	List Coloring in the Absence of a Linear Forest. Algorithmica Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2015	B	`conf`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2014	J	`jnl`	Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	J	`jnl`	Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2014	B	`conf`	Exact Algorithms to Clique-Colour Graphs. SOFSEM Manfred Cochefert, Dieter Kratsch
2014	B	`conf`	Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. IPEC Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff
2014	B	`conf`	Finding Shortest Paths Between Graph Colourings. IPEC Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	J	`jnl`	Finding clubs in graph classes. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2014	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers WG Dieter Kratsch, Ioan Todinca
2014	J	`jnl`	Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2013	—	`conf`	An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2013	C	`conf`	Cliques and Clubs. CIAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2013	J	`jnl`	Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin
2013	J	`jnl`	Computing Optimal Steiner Trees in Polynomial Space. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh
2013	J	`jnl`	Detecting induced minors in AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	C	`conf`	Exact Algorithms for Weak Roman Domination. IWOCA Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez
2013	J	`jnl`	Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Fully decomposable split graphs. Eur. J. Comb. Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
2013	J	`jnl`	Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2013	J	`jnl`	Parameterized Algorithms for Finding Square Roots. CoRR Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	B	`conf`	Sparse Square Roots. WG Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	B	`conf`	The Jump Number Problem: Exact and Parameterized. IPEC Dieter Kratsch, Stefan Kratsch
2012	J	`jnl`	A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	B	`conf`	An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2012	J	`jnl`	Bicolored independent sets and bicliques. Inf. Process. Lett. Jean-François Couturier, Dieter Kratsch
2012	A	`conf`	Colouring AT-Free Graphs. ESA Dieter Kratsch, Haiko Müller
2012	B	`conf`	Detecting Induced Minors in AT-Free Graphs. ISAAC Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2012	J	`jnl`	Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2012	B	`conf`	Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2012	J	`jnl`	On Independent Sets and Bicliques in Graphs. Algorithmica Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2012	J	`jnl`	On exact algorithms for treewidth. ACM Trans. Algorithms Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	J	`jnl`	On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2011	J	`jnl`	An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2011	J	`jnl`	Bandwidth on AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2011	C	`conf`	Bicolored independent sets and bicliques. CTW Jean-François Couturier, Dieter Kratsch
2011	J	`jnl`	Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011	J	`jnl`	Breaking the 2 J. Discrete Algorithms Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
2011	B	`conf`	Enumerating Minimal Subset Feedback Vertex Sets. WADS Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2011	J	`jnl`	Exact Algorithms for Algorithmica Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011	B	`conf`	Exact Algorithms for Kayles. WG Hans L. Bodlaender, Dieter Kratsch
2011	B	`conf`	List Coloring in the Absence of a Linear Forest. WG Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2010	—	`conf`	10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin
2010	C	`conf`	A Parameterized Route to Exact Puzzles: Breaking the 2 CIAC Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
2010	B	`conf`	Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. WG Petr A. Golovach, Dieter Kratsch, Jean-François Couturier
2010	—	`ed.`	Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010 Exact Complexity of NP-hard Problems Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin
2010	—	`book`	Exact Exponential Algorithms Fedor V. Fomin, Dieter Kratsch
2010	—	`conf`	Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	J	`jnl`	Iterative compression and exact algorithms. Theor. Comput. Sci. Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2010	J	`jnl`	Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh
2009	J	`jnl`	A measure & conquer approach for the analysis of exact algorithms. J. ACM Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2009	—	`conf`	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	J	`jnl`	Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms Pinar Heggernes, Dieter Kratsch, Daniel Meister
2009	B	`conf`	Bandwidth on AT-Free Graphs. ISAAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2009	J	`jnl`	Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	Misc	`conf`	Convex Recoloring Revisited: Complexity and Exact Algorithms. COCOON Iyad A. Kanj, Dieter Kratsch
2009	C	`conf`	Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible
2009	J	`jnl`	Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca
2009	C	`conf`	Fully Decomposable Split Graphs. IWOCA Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
2009	J	`jnl`	On a property of minimal triangulations. Discret. Math. Dieter Kratsch, Haiko Müller
2009	J	`jnl`	Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2008	—	`conf`	08431 Abstracts Collection - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008	—	`conf`	08431 Executive Summary - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008	—	`conf`	08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams
2008	J	`jnl`	A new characterization of HH-free graphs. Discret. Math. Dieter Kratsch, Jeremy P. Spinrad, R. Sritharan
2008	B	`conf`	Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN Pinar Heggernes, Dieter Kratsch, Daniel Meister
2008	—	`ch.`	Exact Algorithms for Dominating Set. Encyclopedia of Algorithms Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni
2008	J	`jnl`	Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger
2008	A	`conf`	Faster Steiner Tree Computation in Polynomial-Space. ESA Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2008	J	`jnl`	Feedback vertex set on AT-free graphs. Discret. Appl. Math. Dieter Kratsch, Haiko Müller, Ioan Todinca
2008	B	`conf`	Iterative Compression and Exact Algorithms. MFCS Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2008	—	`ed.`	Moderately Exponential Time Algorithms, 19.10. - 24.10.2008 Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008	B	`conf`	On Independent Sets and Bicliques in Graphs. WG Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2008	J	`jnl`	Solving Connected Dominating Set Faster than 2 Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2007	—	`conf`	07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
2007	J	`jnl`	An exact algorithm for the minimum dominating clique problem. Theor. Comput. Sci. Dieter Kratsch, Mathieu Liedloff
2007	B	`conf`	Branch and Recharge: Exact Algorithms for Generalized Domination. WADS Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2007	B	`conf`	Exact Algorithms for MFCS Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2007	J	`jnl`	Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
2007	—	`ed.`	Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
2007	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers WG Andreas Brandstädt, Dieter Kratsch, Haiko Müller
2007	J	`jnl`	Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. Pinar Heggernes, Dieter Kratsch
2006	—	`conf`	An Exact Algorithm for the Minimum Dominating Clique Problem. IWPEC Dieter Kratsch, Mathieu Liedloff
2006	J	`jnl`	Between O(nm) and O(n SIAM J. Comput. Dieter Kratsch, Jeremy P. Spinrad
2006	J	`jnl`	Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
2006	—	`conf`	Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2006	J	`jnl`	Improved bottleneck domination algorithms. Discret. Appl. Math. Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu
2006	A*	`conf`	Measure and conquer: a simple O(2 SODA Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2006	J	`jnl`	Minimal fill in O( Discret. Math. Dieter Kratsch, Jeremy P. Spinrad
2006	A	`conf`	On Exact Algorithms for Treewidth. ESA Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2006	B	`conf`	Optimal Linear Arrangement of Interval Graphs. MFCS Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
2006	—	`conf`	Solving Connected Dominating Set Faster Than 2 FSTTCS Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2005	B	`conf`	Exact Algorithms for Graph Homomorphisms. FCT Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
2005	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers WG Dieter Kratsch
2005	A*	`conf`	Measure and Conquer: Domination - A Case Study. ICALP Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2005	J	`jnl`	On algorithms for ( Theor. Comput. Sci. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
2005	Misc	`conf`	On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. COCOON Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng
2005	J	`jnl`	On the structure of ( Discret. Appl. Math. Andreas Brandstädt, Dieter Kratsch
2005	J	`jnl`	Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bull. EATCS Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2004	J	`jnl`	Algorithms for graphs with small octopus. Discret. Appl. Math. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
2004	A*	`conf`	Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP Fedor V. Fomin, Dieter Kratsch, Ioan Todinca
2004	B	`conf`	Exact (Exponential) Algorithms for the Dominating Set Problem. WG Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
2004	J	`jnl`	On treewidth approximations. Discret. Appl. Math. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
2003	A*	`conf`	Between O(nm) and O(n alpha). SODA Dieter Kratsch, Jeremy P. Spinrad
2003	A*	`conf`	Certifying algorithms for recognizing interval graphs and permutation graphs. SODA Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
2003	B	`conf`	Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG Dieter Kratsch, Haiko Müller, Ioan Todinca
2003	B	`conf`	Linear Time Algorithms for Some NP-Complete Problems on (P FCT Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
2003	J	`jnl`	On the Domination Search Number. Discret. Appl. Math. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
2002	J	`jnl`	A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
2002	J	`jnl`	Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discret. Math. Dieter Kratsch, Lorna Stewart
2002	J	`jnl`	Approximating minimum cocolorings. Inf. Process. Lett. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
2002	J	`jnl`	Dominating Pair Graphs. SIAM J. Discret. Math. Jitender S. Deogun, Dieter Kratsch
2002	J	`jnl`	Kayles and Nimbers. J. Algorithms Hans L. Bodlaender, Dieter Kratsch
2002	J	`jnl`	On claw-free asteroidal triple-free graphs. Discret. Appl. Math. Harald Hempel, Dieter Kratsch
2001	B	`conf`	Approximating Minimum Cocolourings. FCT Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
2001	J	`jnl`	Efficient algorithms for graphs with few Discret. Math. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
2001	J	`jnl`	On the Structure of Graphs with Bounded Asteroidal Number. Graphs Comb. Ton Kloks, Dieter Kratsch, Haiko Müller
2001	J	`jnl`	On treewidth approximations. Electron. Notes Discret. Math. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
2000	B	`conf`	Bandwidth of Split and Circular Permutation Graphs. WG Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
2000	J	`jnl`	Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
2000	J	`jnl`	Degree-preserving trees. Networks Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
2000	J	`jnl`	Domination and Total Domination on Asteroidal Triple-free Graphs. Discret. Appl. Math. Dieter Kratsch
2000	J	`jnl`	Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. Ton Kloks, Dieter Kratsch, Haiko Müller
2000	B	`conf`	On the Domination Search Number. WG Fedor V. Fomin, Dieter Kratsch, Haiko Müller
1999	A	`conf`	Approximating Bandwidth by Mixing Layouts of Interval Graphs. STACS Dieter Kratsch, Lorna Stewart
1999	J	`jnl`	Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electron. Notes Discret. Math. Dieter Kratsch, Lorna Stewart
1999	J	`jnl`	Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms Ton Kloks, Dieter Kratsch, Haiko Müller
1999	J	`jnl`	Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1999	B	`conf`	On Claw-Free Asteroidal Triple-Free Graphs. WG Harald Hempel, Dieter Kratsch
1999	J	`jnl`	On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. Discret. Appl. Math. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
1999	J	`jnl`	On the structure of graphs with bounded asteroidal number. Electron. Notes Discret. Math. Ton Kloks, Dieter Kratsch, Haiko Müller
1998	B	`conf`	A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. WG Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1998	J	`jnl`	Bandwidth of Chain Graphs. Inf. Process. Lett. Ton Kloks, Dieter Kratsch, Haiko Müller
1998	B	`conf`	Degree-Preserving Forests. MFCS Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
1998	J	`jnl`	Listing All Minimal Separators of a Graph. SIAM J. Comput. Ton Kloks, Dieter Kratsch
1998	J	`jnl`	Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms Ton Kloks, Dieter Kratsch, C. K. Wong
1998	J	`jnl`	Rankings of Graphs. SIAM J. Discret. Math. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1998	J	`jnl`	Tree-visibility orders. Discret. Math. Dieter Kratsch, Jean-Xavier Rampon
1998	J	`jnl`	Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
1997	J	`jnl`	1-Tough cocomparability graphs are hamiltonian. Discret. Math. Jitender S. Deogun, Dieter Kratsch, George Steiner
1997	J	`jnl`	An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. Inf. Process. Lett. Jitender S. Deogun, Dieter Kratsch, George Steiner
1997	B	`conf`	Asteroidal Sets in Graphs. WG Ton Kloks, Dieter Kratsch, Haiko Müller
1997	A*	`conf`	Independent Sets in Asteroidal Triple-Free Graphs. ICALP Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1997	J	`jnl`	Measuring the Vulnerability for Classes of Intersection Graphs. Discret. Appl. Math. Dieter Kratsch, Ton Kloks, Haiko Müller
1997	J	`jnl`	On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. Theor. Comput. Sci. Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad
1997	J	`jnl`	Total Domination and Transformation. Inf. Process. Lett. Dieter Kratsch, Lorna Stewart
1996	J	`jnl`	Minimal non-neighborhood-perfect graphs. J. Graph Theory András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray
1996	A*	`conf`	Minimum Fill-In on Circle and Circular-Arc Graphs. ICALP Ton Kloks, Dieter Kratsch, C. K. Wong
1996	J	`jnl`	Toughness, hamiltonicity and split graphs. Discret. Math. Dieter Kratsch, Jenö Lehel, Haiko Müller
1996	J	`jnl`	Width two posets are reconstructible. Discret. Math. Dieter Kratsch, Jean-Xavier Rampon
1995	A	`conf`	Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA Ton Kloks, Dieter Kratsch, Haiko Müller
1995	J	`jnl`	Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. Inf. Process. Lett. Ton Kloks, Dieter Kratsch
1995	B	`conf`	Diametral Path Graphs. WG Jitender S. Deogun, Dieter Kratsch
1995	B	`conf`	Finding and Counting Small Induced Subgraphs Efficiently. WG Ton Kloks, Dieter Kratsch, Haiko Müller
1995	J	`jnl`	Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discret. Math. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
1995	J	`jnl`	Treewidth of Chordal Bipartite Graphs. J. Algorithms Ton Kloks, Dieter Kratsch
1994	J	`jnl`	Book reviews. Math. Methods Oper. Res. Dieter Kratsch, E. Godehardt, S. Voß, O. Gascuel
1994	J	`jnl`	Dominating cliques in chordal graphs. Discret. Math. Dieter Kratsch, Peter Damaschke, Anna Lubiw
1994	B	`conf`	Dominoes. WG Ton Kloks, Dieter Kratsch, Haiko Müller
1994	A	`conf`	Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1994	A	`conf`	Finding All Minimal Separators of a Graph. STACS Ton Kloks, Dieter Kratsch
1994	J	`jnl`	On Cocolourings and Cochromatic Numbers of Graphs. Discret. Appl. Math. John G. Gimbel, Dieter Kratsch, Lorna Stewart
1994	A	`conf`	On Vertex Ranking for Permutations and Other Graphs. STACS Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
1994	J	`jnl`	On the Complexity of Graph Reconstruction. Math. Syst. Theory Dieter Kratsch, Lane A. Hemaspaandra
1994	B	`conf`	Ranking of Graphs. WG Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1993	A	`conf`	Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1993	J	`jnl`	Domination on Cocomparability Graphs. SIAM J. Discret. Math. Dieter Kratsch, Lorna Stewart
1993	A*	`conf`	Treewidth and Pathwidth of Permutation Graphs. ICALP Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
1993	A	`conf`	Treewidth of Bipartite Graphs. STACS Ton Kloks, Dieter Kratsch
1992	J	`jnl`	The Complexity of Coloring Games on Perfect Graphs. Theor. Comput. Sci. Hans L. Bodlaender, Dieter Kratsch
1991	B	`conf`	On the Complexity of Graph Reconstruction. FCT Dieter Kratsch, Lane A. Hemachandra
1991	J	`jnl`	Some extremal results in cochromatic and dichromatic theory. J. Graph Theory Paul Erdös, John G. Gimbel, Dieter Kratsch
1990	J	`jnl`	Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. Peter Damaschke, Haiko Müller, Dieter Kratsch
1990	J	`jnl`	Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs. Discret. Math. Dieter Kratsch
1987	J	`jnl`	Finding the Minimum Bandwidth of an Interval Graphs Inf. Comput. Dieter Kratsch
1987	J	`jnl`	On Domination Problems for Permutation and Other Graphs. Theor. Comput. Sci. Andreas Brandstädt, Dieter Kratsch
1986	J	`jnl`	On Partitions of Permutations into Increasing and Decreasing Subsequences. J. Inf. Process. Cybern. Andreas Brandstädt, Dieter Kratsch
1985	B	`conf`	On the restriction of some NP-complete graph problems to permutation graphs. FCT Andreas Brandstädt, Dieter Kratsch