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)Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover., , , and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 271-280. Springer, (2004)Parameterized Approximation Problems., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 121-129. Springer, (2006)A Purely Democratic Characterization of W1., , , and . IWPEC, volume 5018 of Lecture Notes in Computer Science, page 103-114. Springer, (2008)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)On problems without polynomial kernels., , , and . J. Comput. Syst. Sci., 75 (8): 423-434 (2009)Proving NP-hardness for clique-width II: non-approximability of clique-width, , , and . Electron. Colloquium Comput. Complex., (2005)Open Problems in (Hyper)Graph Decomposition., , , , , , , , , and 19 other author(s). CoRR, (2023)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)The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus., , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 180-189. Springer, (2002)