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

Parameterized Algorithms for Boxicity., , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 366-377. Springer, (2010)Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Multivariate Complexity Analysis of Geometric Red Blue Set Cover., , and . Algorithmica, 79 (3): 667-697 (2017)Well-Structured Committees., , and . IJCAI, page 189-195. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..A characterization of König-Egerváry graphs with extendable vertex covers., , and . Inf. Process. Lett., (2020)Faster algorithms for feedback vertex set., , and . Electron. Notes Discret. Math., (2005)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , and . Algorithmica, 83 (2): 753-774 (2021)A Polynomial Kernel for Bipartite Permutation Vertex Deletion., , , , , and . Algorithmica, 84 (11): 3246-3275 (2022)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)