Author of the publication

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)

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 Complexity of Asynchronous Border Minimization., , , and . Algorithmica, 81 (1): 201-223 (2019)Integer Programming and Incidence Treedepth., , , , , and . CoRR, (2020)Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey., and . Algorithms, 12 (12): 248 (2019)Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting., , and . CoRR, (2015)On Existential MSO and its Relation to ETH., , , and . MFCS, volume 58 of LIPIcs, page 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank., , , and . AAAI, page 3906-3913. AAAI Press, (2020)Parameterized Complexity of Envy-Free Resource Allocation in Social Networks., , , and . AAAI, page 7135-7142. AAAI Press, (2020)A Structural Complexity Analysis of Synchronous Dynamical Systems., , , and . AAAI, page 6313-6321. AAAI Press, (2023)Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable., , , , and . SoCG, volume 258 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Crossing-Optimal Extension of Simple Drawings., , , , and . ICALP, volume 198 of LIPIcs, page 72:1-72:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)