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

A Colored Path Problem and Its Applications., and . ACM Trans. Algorithms, 16 (4): 47:1-47:48 (2020)EPTAS for k-means Clustering of Affine Subspaces., , , , , and . SODA, page 2649-2659. SIAM, (2021)Integer Programming and Incidence Treedepth., , , , , and . CoRR, (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)Complexity of the Steiner Network Problem with Respect to the Number of Terminals., , , and . STACS, volume 126 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lossy Kernels for Connected Dominating Set on Sparse Graphs., , , , and . STACS, volume 96 of LIPIcs, page 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , and . IJCAI, page 5333-5340. ijcai.org, (2023)Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth., , , and . MFCS, volume 138 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Bi-objective Optimization in Role Mining., , , , and . CoRR, (2024)