Author of the publication

Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation.

, , , and . SIAM J. Discret. Math., 30 (3): 1371-1384 (2016)

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

Lean Tree-Cut Decompositions: Obstructions and Algorithms., , , and . STACS, volume 126 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Neighborhood complexity and kernelization for nowhere dense classes of graphs., , , , , , and . CoRR, (2016)Excluding Single-Crossing Matching Minors in Bipartite Graphs., , and . SODA, page 2111-2121. SIAM, (2023)Packing and Covering Immersion Models of Planar Subcubic Graphs., , , and . WG, volume 9941 of Lecture Notes in Computer Science, page 74-84. (2016)Forbidding Kuratowski Graphs as Immersions., , and . J. Graph Theory, 78 (1): 43-60 (2015)Excluding a Planar Matching Minor in Bipartite Graphs., , and . CoRR, (2021)Block Elimination Distance., , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 28-38. Springer, (2021)Uniform Kernelization Complexity of Hitting Forbidden Minors., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 629-641. Springer, (2015)Excluding Graphs as Immersions in Surface Embedded Graphs., , and . WG, volume 8165 of Lecture Notes in Computer Science, page 274-285. Springer, (2013)New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs., and . STACS, volume 30 of LIPIcs, page 354-366. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)