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

Kernelization.. CSR, volume 6072 of Lecture Notes in Computer Science, page 107-108. Springer, (2010)On the Parameterized Complexity of Cutting a Few Vertices from a Graph., , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 421-432. Springer, (2013)Exact Algorithms for Graph Homomorphisms., , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 161-171. Springer, (2005)Parameterized Complexity of Superstring Problems., , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. Springer, (2015)Parameterized Algorithms for Directed Maximum Leaf Problems., , , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 352-362. Springer, (2007)Subexponential Parameterized Algorithms., , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 15-27. Springer, (2007)Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 581-592. Springer, (2004)Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 568-580. Springer, (2004)Minimizing Rosenthal Potential in Multicast Games., , , and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 525-536. Springer, (2012)Structured Connectivity Augmentation., , and . MFCS, volume 83 of LIPIcs, page 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)