Author of the publication

Induced Packing of Odd Cycles in a Planar Graph.

, , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 514-523. Springer, (2009)

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

Graphs with Branchwidth at Most Three., and . J. Algorithms, 32 (2): 167-194 (1999)(Meta) Kernelization., , , , , and . J. ACM, 63 (5): 44:1-44:69 (2016)Fast Minor Testing in Planar Graphs., , , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 97-109. Springer, (2010)Smaller Kernels for Hitting Set Problems of Constant Arity., , and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 121-126. Springer, (2004)Preface to special issue on Theory and Applications of Graph Searching., , and . Theor. Comput. Sci., (2019)(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 304-315. Springer, (2001)Partial Complementation of Graphs., , , and . SWAT, volume 101 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)FPT Algorithms for Plane Completion Problems., , , , , and . MFCS, volume 58 of LIPIcs, page 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Modification to Planarity is Fixed Parameter Tractable., , and . STACS, volume 126 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , and . Theory Comput. Syst., 64 (2): 251-271 (2020)