Author of the publication

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041).

, , , and . Dagstuhl Reports, 7 (1): 103-128 (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

Fast Approximation in Subspaces by Doubling Metric Decomposition, , , , and . CoRR, (2009)Fast branching algorithm for Cluster Vertex Deletion., , , and . CoRR, (2013)Improving TSP tours using dynamic programming over tree decomposition., , and . CoRR, (2017)Hardness of Approximation for H-free Edge Modification Problems., , , and . TOCT, 10 (2): 9:1-9:32 (2018)Constant Factor Approximation for Capacitated k-Center with Outliers., and . STACS, volume 25 of LIPIcs, page 251-262. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Steiner Forest Orientation Problems., , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 361-372. Springer, (2012)Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms., and . Inf. Process. Lett., 113 (5-6): 179-182 (2013)Fast Approximation in Subspaces by Doubling Metric Decomposition., , , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 72-83. Springer, (2010)On Problems Equivalent to (min, +)-Convolution., , , and . ACM Trans. Algorithms, 15 (1): 14:1-14:25 (2019)A bound on the number of perfect matchings in Klee-graphs., , and . Discret. Math. Theor. Comput. Sci., 15 (1): 37-54 (2013)