( en | de | ru )

 

Disambiguation of "Kratsch, Dieter"

Author of the publication

copydeleteadd this publication to your clipboard
A linear kernel for finding square roots of almost planar graphs.

, , , and . Theor. Comput. Sci., (2017)

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

Approximating Bandwidth by Mixing Layouts of Interval Graphs., and . Electron. Notes Discret. Math., (1999)Solving Connected Dominating Set Faster than 2 n ., , and . Algorithmica, 52 (2): 153-166 (2008)Refined notions of parameterized enumeration kernels with applications to matching cut enumeration., , , and . J. Comput. Syst. Sci., (2022)Fully decomposable split graphs., , and . Eur. J. Comb., 34 (3): 567-575 (2013)Book reviews., , , and . Math. Methods Oper. Res., 40 (1): 120-125 (1994)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 . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 235-247. Springer, (2015)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)Convex Recoloring Revisited: Complexity and Exact Algorithms., and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 388-397. Springer, (2009)