Author of the publication

On the Parameterized Complexity of Simultaneous Deletion Problems.

, , , , and . FSTTCS, volume 93 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum fuer 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

Optimal broadcast domination in polynomial time., and . Discrete Mathematics, 306 (24): 3267-3280 (2006)Intractability of Clique-Width Parameterizations., , , and . SIAM J. Comput., 39 (5): 1941-1956 (2010)Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , and . SODA, page 493-502. SIAM, (2010)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Sharp Separation and Applications to Exact and Parameterized Algorithms., , , and . Algorithmica, 63 (3): 692-706 (2012)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs, , , and . CoRR, (2012)A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments., , , , , and . CoRR, (2018)Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes., , and . J. ACM, 65 (2): 10:1-10:44 (2018)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs, , , , and . CoRR, (2012)