From post

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.

 

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

Efficient Parameterized Preprocessing for Cluster Editing., , , и . FCT, том 4639 из Lecture Notes in Computer Science, стр. 312-321. Springer, (2007)On Search, Decision, and the Efficiency of Polynomial-Time Algorithms., и . J. Comput. Syst. Sci., 49 (3): 769-779 (1994)On the parameterized complexity of multiple-interval graph problems., , , и . Theor. Comput. Sci., 410 (1): 53-61 (2009)Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design., и . AWOC, том 319 из Lecture Notes in Computer Science, стр. 278-287. Springer, (1988)FPT Is Characterized by Useful Obstruction Sets., и . WG, том 8165 из Lecture Notes in Computer Science, стр. 261-273. Springer, (2013)On the Structure of Parameterized Problems in NP (Extended Abstract)., , , и . STACS, том 775 из Lecture Notes in Computer Science, стр. 509-520. Springer, (1994)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)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., и . CiE, том 4497 из Lecture Notes in Computer Science, стр. 268-277. Springer, (2007)The Lost Continent of Polynomial Time: Preprocessing and Kernelization.. IWPEC, том 4169 из Lecture Notes in Computer Science, стр. 276-277. Springer, (2006)