Author of the publication

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

Fixed Parameter Tractability and Completeness., and . Complexity Theory: Current Research, page 191-225. Cambridge University Press, (1992)An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem., , , , and . Theory Comput. Syst., 41 (3): 479-492 (2007)FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders., and . TOCT, 6 (4): 16:1-16:26 (2014)Determining the Winner of a Dodgson Election is Hard., , , , and . FSTTCS, volume 8 of LIPIcs, page 459-468. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Polynomial Time Data Reduction for Dominating Set, , and . CoRR, (2002)Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average., , , , , , and . FSTTCS, volume 13 of LIPIcs, page 229-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)The Private Neighbor Cube., , , and . SIAM J. Discret. Math., 7 (1): 41-47 (1994)Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.. WG, volume 2880 of Lecture Notes in Computer Science, page 1-12. Springer, (2003)A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals., , and . J. Univers. Comput. Sci., 3 (11): 1194-1198 (1997)Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . Algorithmica, 61 (2): 362-388 (2011)