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]Pinar Heggernes, Dieter Kratsch, Daniel Meister:
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN 2008: 216-227 - [c42]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh:
Iterative Compression and Exact Algorithms. MFCS 2008: 335-346 - [c41]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs. WG 2008: 171-182 - [e4]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
Moderately Exponential Time Algorithms, 19.10. - 24.10.2008. Dagstuhl Seminar Proceedings 08431, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r1]Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni:
Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2008 - [i4]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
08431 Abstracts Collection - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i3]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
08431 Executive Summary - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i2]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams:
08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - 2007
- [j60]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007) - [j59]Pinar Heggernes, Dieter Kratsch:
Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1-2): 87-108 (2007) - [j58]Dieter Kratsch, Mathieu Liedloff:
An exact algorithm for the minimum dominating clique problem. Theor. Comput. Sci. 385(1-3): 226-240 (2007) - [c40]Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L (2, 1)-Labeling of Graphs. MFCS 2007: 513-524 - [c39]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518 - [e3]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007. Dagstuhl Seminar Proceedings 07211, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [e2]Andreas Brandstädt, Dieter Kratsch, Haiko Müller:
Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Lecture Notes in Computer Science 4769, Springer 2007, ISBN 978-3-540-74838-0 [contents] - [i1]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007 - 2006
- [j57]Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu:
Improved bottleneck domination algorithms. Discret. Appl. Math. 154(11): 1578-1592 (2006) - [j56]Dieter Kratsch, Jeremy P. Spinrad:
Minimal fill in O(n2.69) time. Discret. Math. 306(3): 366-371 (2006) - [j55]Dieter Kratsch, Jeremy P. Spinrad:
Between O(nm) and O(nalpha). SIAM J. Comput. 36(2): 310-325 (2006) - [j54]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006) - [c38]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On Exact Algorithms for Treewidth. ESA 2006: 672-683 - [c37]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163 - [c36]Dieter Kratsch, Mathieu Liedloff:
An Exact Algorithm for the Minimum Dominating Clique Problem. IWPEC 2006: 130-141 - [c35]Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov:
Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279 - [c34]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25 - [c33]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT 2006: 148-159 - 2005
- [j53]Andreas Brandstädt, Dieter Kratsch:
On the structure of (P5, gem)-free graphs. Discret. Appl. Math. 145(2): 155-166 (2005) - [j52]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bull. EATCS 87: 47-77 (2005) - [j51]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005) - [c32]Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng:
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. COCOON 2005: 808-817 - [c31]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171 - [c30]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203 - [e1]Dieter Kratsch:
Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3787, Springer 2005, ISBN 3-540-31000-2 [contents] - 2004
- [j50]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
Algorithms for graphs with small octopus. Discret. Appl. Math. 134(1-3): 105-128 (2004) - [j49]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Discret. Appl. Math. 136(2-3): 183-196 (2004) - [c29]Fedor V. Fomin, Dieter Kratsch, Ioan Todinca:
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580 - [c28]Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger:
Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256 - 2003
- [j48]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
On the Domination Search Number. Discret. Appl. Math. 127(3): 565-580 (2003) - [c27]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. FCT 2003: 61-72 - [c26]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167 - [c25]Dieter Kratsch, Jeremy P. Spinrad:
Between O(nm) and O(n alpha). SODA 2003: 709-716 - [c24]Dieter Kratsch, Haiko Müller, Ioan Todinca:
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG 2003: 309-321 - 2002
- [j47]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica 32(4): 594-610 (2002) - [j46]Harald Hempel, Dieter Kratsch:
On claw-free asteroidal triple-free graphs. Discret. Appl. Math. 121(1-3): 155-180 (2002) - [j45]Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating minimum cocolorings. Inf. Process. Lett. 84(5): 285-290 (2002) - [j44]Hans L. Bodlaender, Dieter Kratsch:
Kayles and Nimbers. J. Algorithms 43(1): 106-119 (2002) - [j43]Jitender S. Deogun, Dieter Kratsch:
Dominating Pair Graphs. SIAM J. Discret. Math. 15(3): 353-366 (2002) - [j42]Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discret. Math. 15(4): 435-449 (2002) - 2001
- [j41]Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu:
Efficient algorithms for graphs with few P4's. Discret. Math. 235(1-3): 29-51 (2001) - [j40]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Electron. Notes Discret. Math. 8: 98-101 (2001) - [j39]Ton Kloks, Dieter Kratsch, Haiko Müller:
On the Structure of Graphs with Bounded Asteroidal Number. Graphs Comb. 17(2): 295-306 (2001) - [c23]Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating Minimum Cocolourings. FCT 2001: 118-125 - 2000
- [j38]Dieter Kratsch:
Domination and Total Domination on Asteroidal Triple-free Graphs. Discret. Appl. Math. 99(1-3): 111-123 (2000) - [j37]Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman:
Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. 99(1-3): 323-329 (2000) - [j36]Ton Kloks, Dieter Kratsch, Haiko Müller:
Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3-4): 115-121 (2000) - [j35]Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller:
Degree-preserving trees. Networks 35(1): 26-39 (2000) - [c22]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
On the Domination Search Number. WG 2000: 161-171 - [c21]Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller:
Bandwidth of Split and Circular Permutation Graphs. WG 2000: 243-254
1990 – 1999
- 1999
- [j34]Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller:
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. Discret. Appl. Math. 98(1-2): 39-63 (1999) - [j33]Ton Kloks, Dieter Kratsch, Haiko Müller:
On the structure of graphs with bounded asteroidal number. Electron. Notes Discret. Math. 3: 94 (1999) - [j32]Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electron. Notes Discret. Math. 3: 106-109 (1999) - [j31]Ton Kloks, Dieter Kratsch, Haiko Müller:
Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32(1): 41-57 (1999) - [j30]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. 12(2): 276-287 (1999) - [c20]Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. STACS 1999: 248-258 - [c19]Harald Hempel, Dieter Kratsch:
On Claw-Free Asteroidal Triple-Free Graphs. WG 1999: 377-390 - 1998
- [j29]Dieter Kratsch, Jean-Xavier Rampon:
Tree-visibility orders. Discret. Math. 190(1-3): 163-175 (1998) - [j28]Ton Kloks, Dieter Kratsch, Haiko Müller:
Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6): 313-315 (1998) - [j27]Ton Kloks, Dieter Kratsch, C. K. Wong:
Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms 28(2): 272-289 (1998) - [j26]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller:
Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. 2(5): 1-23 (1998) - [j25]Ton Kloks, Dieter Kratsch:
Listing All Minimal Separators of a Graph. SIAM J. Comput. 27(3): 605-613 (1998) - [j24]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Rankings of Graphs. SIAM J. Discret. Math. 11(1): 168-181 (1998) - [c18]Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra:
Degree-Preserving Forests. MFCS 1998: 713-721 - [c17]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. WG 1998: 88-99 - 1997
- [j23]Dieter Kratsch, Ton Kloks, Haiko Müller:
Measuring the Vulnerability for Classes of Intersection Graphs. Discret. Appl. Math. 77(3): 259-270 (1997) - [j22]Jitender S. Deogun, Dieter Kratsch, George Steiner:
1-Tough cocomparability graphs are hamiltonian. Discret. Math. 170(1-3): 99-106 (1997) - [j21]Jitender S. Deogun, Dieter Kratsch, George Steiner:
An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. Inf. Process. Lett. 61(3): 121-127 (1997) - [j20]Dieter Kratsch, Lorna Stewart:
Total Domination and Transformation. Inf. Process. Lett. 63(3): 167-170 (1997) - [j19]Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad:
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. Theor. Comput. Sci. 175(2): 309-335 (1997) - [c16]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770 - [c15]Ton Kloks, Dieter Kratsch, Haiko Müller:
Asteroidal Sets in Graphs. WG 1997: 229-241 - 1996
- [j18]Dieter Kratsch, Jenö Lehel, Haiko Müller:
Toughness, hamiltonicity and split graphs. Discret. Math. 150(1-3): 231-245 (1996) - [j17]Dieter Kratsch, Jean-Xavier Rampon:
Width two posets are reconstructible. Discret. Math. 162(1-3): 305-310 (1996) - [j16]András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray:
Minimal non-neighborhood-perfect graphs. J. Graph Theory 21(1): 55-66 (1996) - [c14]Ton Kloks, Dieter Kratsch, C. K. Wong:
Minimum Fill-In on Circle and Circular-Arc Graphs. ICALP 1996: 256-267 - 1995
- [j15]Ton Kloks, Dieter Kratsch:
Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. Inf. Process. Lett. 55(1): 11-16 (1995) - [j14]Ton Kloks, Dieter Kratsch:
Treewidth of Chordal Bipartite Graphs. J. Algorithms 19(2): 266-281 (1995) - [j13]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch:
Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discret. Math. 8(4): 606-616 (1995) - [c13]Ton Kloks, Dieter Kratsch, Haiko Müller:
Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA 1995: 434-447 - [c12]Ton Kloks, Dieter Kratsch, Haiko Müller:
Finding and Counting Small Induced Subgraphs Efficiently. WG 1995: 14-23 - [c11]Jitender S. Deogun, Dieter Kratsch:
Diametral Path Graphs. WG 1995: 344-357 - 1994
- [j12]John G. Gimbel, Dieter Kratsch, Lorna Stewart:
On Cocolourings and Cochromatic Numbers of Graphs. Discret. Appl. Math. 48(2): 111-127 (1994) - [j11]Dieter Kratsch, Peter Damaschke, Anna Lubiw:
Dominating cliques in chordal graphs. Discret. Math. 128(1-3): 269-275 (1994) - [j10]Dieter Kratsch, E. Godehardt, S. Voß, O. Gascuel:
Book reviews. Math. Methods Oper. Res. 40(1): 120-125 (1994) - [j9]Dieter Kratsch, Lane A. Hemaspaandra:
On the Complexity of Graph Reconstruction. Math. Syst. Theory 27(3): 257-273 (1994) - [c10]Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch:
Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1994: 508 - [c9]Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller:
On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758 - [c8]Ton Kloks, Dieter Kratsch:
Finding All Minimal Separators of a Graph. STACS 1994: 759-768 - [c7]Ton Kloks, Dieter Kratsch, Haiko Müller:
Dominoes. WG 1994: 106-120 - [c6]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Ranking of Graphs. WG 1994: 292-304 - 1993
- [j8]Dieter Kratsch, Lorna Stewart:
Domination on Cocomparability Graphs. SIAM J. Discret. Math. 6(3): 400-417 (1993) - [c5]Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch:
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1993: 260-271 - [c4]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch:
Treewidth and Pathwidth of Permutation Graphs. ICALP 1993: 114-125 - [c3]Ton Kloks, Dieter Kratsch:
Treewidth of Bipartite Graphs. STACS 1993: 80-89 - 1992
- [j7]Hans L. Bodlaender, Dieter Kratsch:
The Complexity of Coloring Games on Perfect Graphs. Theor. Comput. Sci. 106(2): 309-326 (1992) - 1991
- [j6]Paul Erdös, John G. Gimbel, Dieter Kratsch:
Some extremal results in cochromatic and dichromatic theory. J. Graph Theory 15(6): 579-585 (1991) - [c2]Dieter Kratsch, Lane A. Hemachandra:
On the Complexity of Graph Reconstruction. FCT 1991: 318-328 - 1990
- [j5]Dieter Kratsch:
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs. Discret. Math. 86(1-3): 225-238 (1990) - [j4]Peter Damaschke, Haiko Müller, Dieter Kratsch:
Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. 36(5): 231-236 (1990)
1980 – 1989
- 1987
- [j3]Dieter Kratsch:
Finding the Minimum Bandwidth of an Interval Graphs. Inf. Comput. 74(2): 140-158 (1987) - [j2]Andreas Brandstädt, Dieter Kratsch:
On Domination Problems for Permutation and Other Graphs. Theor. Comput. Sci. 54: 181-198 (1987) - 1986
- [j1]Andreas Brandstädt, Dieter Kratsch:
On Partitions of Permutations into Increasing and Decreasing Subsequences. J. Inf. Process. Cybern. 22(5/6): 263-273 (1986) - 1985
- [c1]Andreas Brandstädt, Dieter Kratsch:
On the restriction of some NP-complete graph problems to permutation graphs. FCT 1985: 53-62
Coauthor Index
[j117] [c83] [i17] [j116] [j113] [j112] [j111] [j110] [j109] [j107] [j106] [j105] [j103] [j101] [c81] [c79] [c78] [i16] [j100] [j97] [j96] [j94] [c77] [c74] [i15] [i13] [i12] [j93] [j92] [c71] [c70] [c69] [i11] [j89] [j88] [j84] [j83] [c65] [c64] [c61] [i8] [j79] [c59] [c58] [i7] [j75] [j72] [c53] [j71] [c50] [j68] [c47] [c39]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
