Author of the publication

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.

, , , and . Algorithmica, 85 (7): 2065-2086 (July 2023)

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

Reducing Rank of the Adjacency Matrix by Graph Modification., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 361-373. Springer, (2015)Parameterized Algorithms for Survivable Network Design with Uniform Demands., , , , , , and . SODA, page 2838-2850. SIAM, (2018)FPT-approximation for FPT Problems., , , , and . SODA, page 199-218. SIAM, (2021)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . SODA, page 1010-1018. SIAM, (2020)Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems., , , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 25-36. Springer, (2017)On the Complexity of Recovering Incidence Matrices., , , and . ESA, volume 173 of LIPIcs, page 50:1-50:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank., , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 420-432. Springer, (2017)Faster Parameterized Algorithms for Deletion to Split Graphs., , , , , , and . Algorithmica, 71 (4): 989-1006 (2015)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . ACM Trans. Algorithms, 17 (2): 11:1-11:14 (2021)