( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Enumerating Minimal Subset Feedback Vertex Sets.

, , , , и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 399-410. Springer, (2011)

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.

Dieter Kratsch

Dieter Kratsch

Dieter Kratsch

Christina Kratsch

Dietrich Kratsch

 

Другие публикации лиц с тем же именем

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2., , , , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 275-288. Springer, (2017)Exact (Exponential) Algorithms for the Dominating Set Problem., , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 245-256. Springer, (2004)Approximating Bandwidth by Mixing Layouts of Interval Graphs., и . STACS, том 1563 из Lecture Notes in Computer Science, стр. 248-258. Springer, (1999)Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In., , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 568-580. Springer, (2004)An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets., , , и . ICALP (1), том 7965 из Lecture Notes in Computer Science, стр. 485-496. Springer, (2013)1-Tough cocomparability graphs are hamiltonian., , и . Discret. Math., 170 (1-3): 99-106 (1997)Minimal dominating sets in interval graphs and trees., , , , и . Discret. Appl. Math., (2017)Enumerating minimal dominating sets in chordal bipartite graphs., , , , и . Discret. Appl. Math., (2016)Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph., и . Inf. Process. Lett., 55 (1): 11-16 (1995)Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration., , , и . STACS, том 187 из LIPIcs, стр. 37:1-37:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)