Author of the publication

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.

, , , and . MFCS, volume 170 of LIPIcs, page 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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 Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs., , , , and . SIAM J. Discret. Math., 36 (2): 911-921 (2022)Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent., , , , , , and . SODA, page 1976-2004. SIAM, (2022)On Structural Parameterizations of the Edge Disjoint Paths Problem., , and . Algorithmica, 83 (6): 1605-1637 (2021)On the Approximate Compressibility of Connected Vertex Cover., , and . Algorithmica, 82 (10): 2902-2926 (2020)On the Complexity of Majority Illusion in Social Networks., , , and . CoRR, (2022)Partially Polynomial Kernels for Set Cover and Test Cover., , , and . SIAM J. Discret. Math., 30 (3): 1401-1423 (2016)Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts., and . ACM Trans. Algorithms, 13 (4): 46:1-46:25 (2017)Faster Parameterized Algorithms using Linear Programming, , , , and . CoRR, (2012)A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set., , and . CoRR, (2016)Faster Exact Algorithms for Some Terminal Set Problems., , , , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 150-162. Springer, (2013)