Author of the publication

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.

, , and . STACS, volume 96 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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 Pre-coloring Extension and List Coloring Problems., , , and . CoRR, (2019)On Structural Parameterizations of the Edge Disjoint Paths Problem., , and . CoRR, (2017)Tree-depth and vertex-minors., , , and . Eur. J. Comb., (2016)Backdoors into heterogeneous classes of SAT and CSP., , , , and . J. Comput. Syst. Sci., (2017)Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics., , and . J. Artif. Intell. Res., (2021)The Power of Cut-Based Parameters for Computing Edge Disjoint Paths., and . CoRR, (2018)Parameterized Complexity and Kernel Bounds for Hard Planning Problems., , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 13-24. Springer, (2013)Integer Programming and Incidence Treedepth., , , , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 194-204. Springer, (2019)Towards a Polynomial Kernel for Directed Feedback Vertex Set., , , , and . MFCS, volume 83 of LIPIcs, page 36:1-36:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors., , and . CP, volume 210 of LIPIcs, page 32:1-32:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)