Author of the publication

FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.

, and . TOCT, 6 (4): 16:1-16:26 (2014)

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

Computing the Chromatic Number Using Graph Decompositions via Matrix Rank., and . ESA, volume 112 of LIPIcs, page 47:1-47:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations., and . ESA, volume 112 of LIPIcs, page 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor., , and . Algorithmica, 81 (10): 3936-3967 (2019)Uniform Kernelization Complexity of Hitting Forbidden Minors., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 629-641. Springer, (2015)Fine-grained Complexity Analysis of Two Classic TSP Variants., , , and . ACM Trans. Algorithms, 17 (1): 5:1-5:29 (2021)Approximation and Kernelization for Chordal Vertex Deletion., and . SIAM J. Discret. Math., 32 (3): 2258-2301 (2018)A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs., , and . SIAM J. Discret. Math., 35 (4): 2387-2429 (2021)Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size., , and . Algorithmica, 84 (11): 3407-3458 (2022)Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation., and . Algorithmica, 83 (8): 2469-2470 (2021)Finding k-secluded trees faster., , and . J. Comput. Syst. Sci., (December 2023)