Author of the publication

Algorithm design techniques for parameterized graph modification problems.

. Ausgezeichnete Informatikdissertationen, volume D-7 of LNI, GI, (2006)

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.

 

Other publications of authors with the same name

Editing Graphs into Disjoint Unions of Dense Clusters., , , and . Algorithmica, 61 (4): 949-970 (2011)Parameterized computational complexity of Dodgson and Young elections., , and . Inf. Comput., 208 (2): 165-177 (2010)Data Reduction and Problem Kernels (Dagstuhl Seminar 12241)., , , and . Dagstuhl Reports, 2 (6): 26-50 (2012)The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions., , , , and . Int. J. Found. Comput. Sci., 17 (6): 1467-1484 (2006)Exact algorithms and applications for Tree-like Weighted Set Cover., and . J. Discrete Algorithms, 4 (4): 608-622 (2006)Red-blue covering problems and the consecutive ones property., , , and . J. Discrete Algorithms, 6 (3): 393-407 (2008)Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation., , , and . Theory Comput. Syst., 38 (4): 373-392 (2005)Parameterized Complexity of Vertex Cover Variants., , and . Theory Comput. Syst., 41 (3): 501-520 (2007)Fixed-parameter tractability results for full-degree spanning tree and its dual., , and . Networks, 56 (2): 116-130 (2010)On the parameterized complexity of consensus clustering., , , and . Theor. Comput. Sci., (2014)