default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDieter Kratsch
Person information
- affiliation: Université de Lorraine, LITA, Metz, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j117]Petr A. Golovach
, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123: 76-102 (2022)- 2021
- [c83]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS 2021: 37:1-37:18 - [i17]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR abs/2101.03800 (2021) - 2020
- [j116]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
Enumeration of minimal connected dominating sets for chordal graphs. Discret. Appl. Math. 278: 3-11 (2020) - [j115]Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. Discret. Appl. Math. 283: 44-58 (2020)
2010 – 2019
- 2019
- [j114]Frank Kammer, Dieter Kratsch, Moritz Laudahn:
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica 81(3): 1180-1204 (2019) - [j113]Petr 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. Algorithmica 81(7): 2795-2828 (2019) - [j112]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and maximum number of maximal irredundant sets for chordal graphs. Discret. Appl. Math. 265: 69-85 (2019) - [j111]Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi:
Enumeration of maximal irredundant sets for claw-free graphs. Theor. Comput. Sci. 754: 3-15 (2019) - [j110]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and maximum number of minimal dominating sets for chordal graphs. Theor. Comput. Sci. 783: 41-52 (2019) - 2018
- [j109]Petr 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. Algorithmica 80(2): 714-741 (2018) - [j108]Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez:
Exact algorithms for weak Roman domination. Discret. Appl. Math. 248: 79-92 (2018) - [j107]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Computing square roots of graphs with low maximum degree. Discret. Appl. Math. 248: 93-101 (2018) - [j106]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. 68: 132-147 (2018) - [j105]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. Theory Comput. Syst. 62(6): 1409-1426 (2018) - [c82]Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. IPEC 2018: 19:1-19:13 - 2017
- [j104]Feodor 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. Discret. Appl. Math. 216: 1 (2017) - [j103]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216: 162-170 (2017) - [j102]Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff:
Exact exponential algorithms to find tropical connected sets of minimum size. Theor. Comput. Sci. 676: 33-41 (2017) - [j101]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A linear kernel for finding square roots of almost planar graphs. Theor. Comput. Sci. 689: 36-47 (2017) - [c81]Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi:
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. CIAC 2017: 297-309 - [c80]Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumerating Minimal Tropical Connected Sets. SOFSEM 2017: 217-228 - [c79]Petr 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. WG 2017: 275-288 - [c78]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. WG 2017: 289-302 - [i16]Petr 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. CoRR abs/1703.05102 (2017) - 2016
- [j100]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. Algorithmica 74(2): 602-629 (2016) - [j99]Dieter Kratsch, Ioan Todinca:
Guest Editorial: Selected Papers from WG 2014. Algorithmica 75(1): 186 (2016) - [j98]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Finding Shortest Paths Between Graph Colourings. Algorithmica 75(2): 295-321 (2016) - [j97]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199: 30-36 (2016) - [j96]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Squares of Low Clique Number. Electron. Notes Discret. Math. 55: 195-198 (2016) - [j95]Dieter Kratsch, Van Bang Le:
Algorithms solving the Matching Cut problem. Theor. Comput. Sci. 609: 328-335 (2016) - [j94]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating minimal connected dominating sets in graphs of bounded chordality. Theor. Comput. Sci. 630: 63-75 (2016) - [c77]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. IWOCA 2016: 361-372 - [c76]Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch:
Faster Algorithms to Enumerate Hypergraph Transversals. LATIN 2016: 306-318 - [c75]Frank Kammer, Dieter Kratsch, Moritz Laudahn:
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. MFCS 2016: 56:1-56:14 - [c74]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A Linear Kernel for Finding Square Roots of Almost Planar Graphs. SWAT 2016: 4:1-4:14 - [r2]Dieter Kratsch:
Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2016: 667-670 - [i15]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. CoRR abs/1602.07504 (2016) - [i14]Frank Kammer, Dieter Kratsch, Moritz Laudahn:
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. CoRR abs/1606.04679 (2016) - [i13]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A Linear Kernel for Finding Square Roots of Almost Planar Graphs. CoRR abs/1608.06136 (2016) - [i12]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Squares of Low Maximum Degree. CoRR abs/1608.06142 (2016) - 2015
- [j93]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. Algorithmica 71(1): 21-35 (2015) - [j92]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica 72(3): 836-859 (2015) - [j91]Hans L. Bodlaender, Dieter Kratsch, Sjoerd T. Timmer:
Exact algorithms for Kayles. Theor. Comput. Sci. 562: 165-176 (2015) - [c73]Dieter Kratsch, Van Bang Le:
Algorithms Solving the Matching Cut Problem. CIAC 2015: 288-299 - [c72]Dieter Kratsch, Mathieu Liedloff, Daniel Meister:
End-Vertices of Graph Search Algorithms. CIAC 2015: 300-312 - [c71]Petr 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. ISAAC 2015: 248-258 - [c70]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA 2015: 235-247 - [c69]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC 2015: 307-318 - [i11]Petr 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. CoRR abs/1509.03753 (2015) - [i10]Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch:
Faster algorithms to enumerate hypergraph transversals. CoRR abs/1510.05093 (2015) - 2014
- [j90]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69(1): 216-231 (2014) - [j89]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Finding clubs in graph classes. Discret. Appl. Math. 174: 57-65 (2014) - [j88]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms 26: 7-15 (2014) - [c68]Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff:
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. IPEC 2014: 147-158 - [c67]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Finding Shortest Paths Between Graph Colourings. IPEC 2014: 221-233 - [c66]Manfred Cochefert, Dieter Kratsch:
Exact Algorithms to Clique-Colour Graphs. SOFSEM 2014: 187-198 - [e6]Dieter Kratsch, Ioan Todinca:
Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8747, Springer 2014, ISBN 978-3-319-12339-4 [contents] - [i9]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR abs/1403.6347 (2014) - 2013
- [j87]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh:
Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3): 584-604 (2013) - [j86]Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully decomposable split graphs. Eur. J. Comb. 34(3): 567-575 (2013) - [j85]Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. 231: 109-116 (2013) - [j84]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin:
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4): 645-667 (2013) - [j83]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Detecting induced minors in AT-free graphs. Theor. Comput. Sci. 482: 20-32 (2013) - [j82]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. 487: 82-94 (2013) - [c65]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Cliques and Clubs. CIAC 2013: 276-287 - [c64]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) 2013: 485-496 - [c63]Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez:
Exact Algorithms for Weak Roman Domination. IWOCA 2013: 81-93 - [c62]Dieter Kratsch, Stefan Kratsch:
The Jump Number Problem: Exact and Parameterized. IPEC 2013: 230-242 - [c61]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Sparse Square Roots. WG 2013: 177-188 - [i8]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. CoRR abs/1310.5469 (2013) - 2012
- [j81]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (2012) - [j80]Jean-François Couturier, Dieter Kratsch:
Bicolored independent sets and bicliques. Inf. Process. Lett. 112(8-9): 329-334 (2012) - [j79]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012) - [j78]Hans 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. Theory Comput. Syst. 50(3): 420-432 (2012) - [j77]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On exact algorithms for treewidth. ACM Trans. Algorithms 9(1): 12:1-12:23 (2012) - [c60]Dieter Kratsch, Haiko Müller:
Colouring AT-Free Graphs. ESA 2012: 707-718 - [c59]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Detecting Induced Minors in AT-Free Graphs. ISAAC 2012: 495-505 - [c58]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC 2012: 85-96 - [c57]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213 - [i7]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay. CoRR abs/1208.5345 (2012) - 2011
- [j76]Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011) - [j75]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011) - [j74]Daniel 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. J. Discrete Algorithms 9(3): 214-230 (2011) - [j73]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412(45): 6290-6302 (2011) - [j72]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011) - [c56]Jean-François Couturier, Dieter Kratsch:
Bicolored independent sets and bicliques. CTW 2011: 130-133 - [c55]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410 - [c54]Hans L. Bodlaender, Dieter Kratsch:
Exact Algorithms for Kayles. WG 2011: 59-70 - [c53]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. WG 2011: 119-130 - 2010
- [b1]Fedor V. Fomin, Dieter Kratsch:
Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series, Springer 2010, ISBN 978-3-642-16532-0, pp. 1-203 - [j71]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh:
Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16): 702-706 (2010) - [j70]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh:
Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7-9): 1045-1053 (2010) - [c52]Daniel 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. CIAC 2010: 311-322 - [c51]Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT 2010: 334-345 - [c50]Petr A. Golovach, Dieter Kratsch, Jean-François Couturier:
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. WG 2010: 39-50 - [e5]Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Dagstuhl Seminar Proceedings 10441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i6]Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems 2010
2000 – 2009
- 2009
- [j69]Dieter Kratsch, Haiko Müller:
On a property of minimal triangulations. Discret. Math. 309(6): 1724-1729 (2009) - [j68]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009) - [j67]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5): 25:1-25:32 (2009) - [j66]Pinar Heggernes, Dieter Kratsch, Daniel Meister:
Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms 7(4): 533-544 (2009) - [j65]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca:
Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms 6(1): 9:1-9:21 (2009) - [c49]Iyad A. Kanj, Dieter Kratsch:
Convex Recoloring Revisited: Complexity and Exact Algorithms. COCOON 2009: 388-397 - [c48]Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible:
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209 - [c47]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582 - [c46]Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully Decomposable Split Graphs. IWOCA 2009: 105-112 - [c45]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172 - [i5]Ljiljana 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. CoRR abs/0909.4224 (2009) - 2008
- [j64]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008) - [j63]Dieter Kratsch, Haiko Müller, Ioan Todinca:
Feedback vertex set on AT-free graphs. Discret. Appl. Math. 156(10): 1936-1947 (2008) - [j62]Dieter Kratsch, Jeremy P. Spinrad, R. Sritharan:
A new characterization of HH-free graphs. Discret. Math. 308(20): 4833-4835 (2008) - [j61]Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger:
Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008) - [c44]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441 - [c43]