Author of the publication

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.

, , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (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

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound., , , and . FSTTCS, volume 18 of LIPIcs, page 412-423. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Solving Multicut Faster Than 2 n., , and . ESA, volume 8737 of Lecture Notes in Computer Science, page 666-676. Springer, (2014)Waypoint Routing on Bounded Treewidth Graphs., and . CoRR, (2020)Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation., , , and . SIAM J. Discret. Math., 30 (3): 1371-1384 (2016)Parameterized Problems Related to Seidel's Switching., , , and . Discret. Math. Theor. Comput. Sci., 13 (2): 19-44 (2011)On Kernels for d-Path Vertex Cover., , and . CoRR, (2021)Treewidth Is NP-Complete on Cubic Graphs., , , , , , , , and . IPEC, volume 285 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Parameterized Complexity View on Collapsing k-Cores., , and . IPEC, volume 115 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters., and . Algorithmica, 85 (3): 762-782 (March 2023)Constant factor approximation for tracking paths and fault tolerant feedback vertex set., , , , , and . Discret. Optim., (February 2023)