Author of the publication

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).

, , , and . SIAM J. Comput., 49 (2): 318-364 (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

Finding and Counting Permutations via CSPs., , and . IPEC, volume 148 of LIPIcs, page 1:1-1:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , , and . CoRR, (2019)The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk).. SWAT, volume 53 of LIPIcs, page 32:1-32:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The complexity of chromatic strength and chromatic edge strength.. Comput. Complex., 14 (4): 308-340 (2006)A Parameterized View on Matroid Optimization Problems.. ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 655-666. Springer, (2006)Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).. WAOA, volume 2909 of Lecture Notes in Computer Science, page 214-226. Springer, (2003)Parameterized Graph Cleaning Problems., and . WG, volume 5344 of Lecture Notes in Computer Science, page 287-299. (2008)The Complexity of Tree Multicolorings.. MFCS, volume 2420 of Lecture Notes in Computer Science, page 532-542. Springer, (2002)Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set., , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 249-261. Springer, (2019)Slightly Superexponential Parameterized Problems., , and . CoRR, (2019)