( en | de | ru )

 

Disambiguation of "Kratsch, Dieter"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.

, , , , and . Algorithmica, 81 (7): 2795-2828 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dieter Kratsch

Dieter Kratsch

Dieter Kratsch

Christina Kratsch

Dietrich Kratsch

 

Other publications of authors with the same name

Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph., and . Inf. Process. Lett., 55 (1): 11-16 (1995)Total Domination and Transformation., and . Inf. Process. Lett., 63 (3): 167-170 (1997)Approximating Bandwidth by Mixing Layouts of Interval Graphs., and . Electron. Notes Discret. Math., (1999)Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2., , , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 275-288. Springer, (2017)Exact (Exponential) Algorithms for the Dominating Set Problem., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 245-256. Springer, (2004)Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs., , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 235-247. Springer, (2015)Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width., , , , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 248-258. Springer, (2015)Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs., , and . CoRR, (2016)Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay, , , and . CoRR, (2012)An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets., , , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 485-496. Springer, (2013)