Author of the publication

Parameterized Complexity of the Arc-Preserving Subsequence Problem.

, and . WG, volume 6410 of Lecture Notes in Computer Science, page 244-255. (2010)

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

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)Constraint solving via fractional edge covers., and . SODA, page 289-298. ACM Press, (2006)Tractable Structures for Constraint Satisfaction with Truth Tables.. STACS, volume 3 of LIPIcs, page 649-660. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Cleaning Interval Graphs, and . CoRR, (2010)Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal., , and . ACM Trans. Algorithms, 14 (2): 13:1-13:30 (2018)Parameterized Graph Cleaning Problems., and . WG, volume 5344 of Lecture Notes in Computer Science, page 287-299. (2008)A parameterized view on matroid optimization problems.. Theor. Comput. Sci., 410 (44): 4471-4479 (2009)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . Electron. Colloquium Comput. Complex., (2019)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , and . SODA, page 1782-1801. SIAM, (2014)Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations., , , , and . SODA, page 314-345. SIAM, (2024)