Author of the publication

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)

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

Implementing the Standards: Let's Focus on the First Four., and . Discrete Mathematics in the Schools, volume 36 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 51-65. DIMACS/AMS, (1992)Clustering with Partial Information., , , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 144-155. Springer, (2008)On the parameterized complexity of multiple-interval graph problems., , , and . Theor. Comput. Sci., 410 (1): 53-61 (2009)On Search, Decision, and the Efficiency of Polynomial-Time Algorithms., and . J. Comput. Syst. Sci., 49 (3): 769-779 (1994)On the Structure of Parameterized Problems in NP., , , and . Inf. Comput., 123 (1): 38-49 (1995)Fast search algorithms for layout permutation problems., and . Integr., 12 (3): 321-337 (1991)Surfing with Rod.. Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 9-18. Springer, (2017)An Improved Fixed-Parameter Algorithm for Vertex Cover., , and . Inf. Process. Lett., 65 (3): 163-168 (1998)A Fixed-Parameter Approach to Two-Layer Planarization., , , , , , , , , and 2 other author(s). GD, volume 2265 of Lecture Notes in Computer Science, page 1-15. Springer, (2001)The Lost Continent of Polynomial Time: Preprocessing and Kernelization.. IWPEC, volume 4169 of Lecture Notes in Computer Science, page 276-277. Springer, (2006)