Author of the publication

Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover.

, , , and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 271-280. Springer, (2004)

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

Statistics of the Field.. Computer Science, The Hardware, Software and Heart of It, Springer, (2011)Max Leaf Spanning Tree.. Encyclopedia of Algorithms, (2016)Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable., , , , and . Theor. Comput. Sci., (2013)Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . Algorithmica, 61 (2): 362-388 (2011)Proving NP-hardness for clique-width II: non-approximability of clique-width, , , and . Electronic Colloquium on Computational Complexity (ECCC), (2005)An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem., , , , and . Theory Comput. Syst., 41 (3): 479-492 (2007)Parameterized Complexity of Stabbing Rectangles and Squares in the Plane., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 298-309. Springer, (2009)Finding k Disjoint Triangles in an Arbitrary Graph., , , , and . WG, volume 3353 of Lecture Notes in Computer Science, page 235-244. Springer, (2004)Connected Coloring Completion for General Graphs: Algorithms and Complexity., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 75-85. Springer, (2007)Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 86-96. Springer, (2007)