Author of the publication

07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.

, , , and . Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, volume 07281 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)

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

09511 Open Problems - Parameterized complexity and approximation algorithms., , and . Parameterized complexity and approximation algorithms, volume 09511 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)09511 Abstracts Collection - Parameterized complexity and approximation algorithms., , and . Parameterized complexity and approximation algorithms, volume 09511 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)09511 Executive Summary - Parameterized complexity and approximation algorithms., , and . Parameterized complexity and approximation algorithms, volume 09511 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . Electron. Colloquium Comput. Complex., (2019)A parameterized view on matroid optimization problems.. Theor. Comput. Sci., 410 (44): 4471-4479 (2009)Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations., , , , and . SODA, page 314-345. SIAM, (2024)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , and . SODA, page 1782-1801. SIAM, (2014)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)Minimum Sum Multicoloring on the Edges of Trees: (Extended Abstract).. WAOA, volume 2909 of Lecture Notes in Computer Science, page 214-226. Springer, (2003)