From post

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.

, , и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 150-159. 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.

 

Другие публикации лиц с тем же именем

An Improved Fixed-Parameter Algorithm for Vertex Cover., , и . Inf. Process. Lett., 65 (3): 163-168 (1998)Surfing with Rod.. Computability and Complexity, том 10010 из Lecture Notes in Computer Science, стр. 9-18. Springer, (2017)The Lost Continent of Polynomial Time: Preprocessing and Kernelization.. IWPEC, том 4169 из Lecture Notes in Computer Science, стр. 276-277. Springer, (2006)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., и . CiE, том 4497 из Lecture Notes in Computer Science, стр. 268-277. Springer, (2007)Distortion Is Fixed Parameter Tractable., , , , , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 463-474. Springer, (2009)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs., , , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 340-351. Springer, (2007)On the Structure of Parameterized Problems in NP (Extended Abstract)., , , и . STACS, том 775 из Lecture Notes in Computer Science, стр. 509-520. Springer, (1994)Efficient Parameterized Preprocessing for Cluster Editing., , , и . FCT, том 4639 из Lecture Notes in Computer Science, стр. 312-321. Springer, (2007)FPT Is Characterized by Useful Obstruction Sets., и . WG, том 8165 из Lecture Notes in Computer Science, стр. 261-273. Springer, (2013)Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design., и . AWOC, том 319 из Lecture Notes in Computer Science, стр. 278-287. Springer, (1988)