Author of the publication

On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.

, , , , and . COCOA, volume 8881 of Lecture Notes in Computer Science, page 625-636. Springer, (2014)

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

On the Structure of Parameterized Problems in NP (Extended Abstract)., , , and . STACS, volume 775 of Lecture Notes in Computer Science, page 509-520. Springer, (1994)Local Search: Is Brute-Force Avoidable?, , , , , and . IJCAI, page 486-491. (2009)Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design., and . AWOC, volume 319 of Lecture Notes in Computer Science, page 278-287. Springer, (1988)FPT Is Characterized by Useful Obstruction Sets., and . WG, volume 8165 of Lecture Notes in Computer Science, page 261-273. Springer, (2013)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs., , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 340-351. Springer, (2007)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., and . CiE, volume 4497 of Lecture Notes in Computer Science, page 268-277. Springer, (2007)The Lost Continent of Polynomial Time: Preprocessing and Kernelization.. IWPEC, volume 4169 of Lecture Notes in Computer Science, page 276-277. Springer, (2006)Efficient Parameterized Preprocessing for Cluster Editing., , , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 312-321. Springer, (2007)Distortion Is Fixed Parameter Tractable., , , , , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 463-474. Springer, (2009)Fast search algorithms for layout permutation problems., and . Integr., 12 (3): 321-337 (1991)