Parameterized and Exact Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540230717, 9783540286394

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Structural View on Parameterizing Problems: Distance from Triviality

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_15 ◽

2004 ◽

pp. 162-173 ◽

Cited By ~ 31

Author(s):

Jiong Guo ◽

Falk Hüffner ◽

Rolf Niedermeier

Download Full-text

Computing Small Search Numbers in Linear Time

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_4 ◽

2004 ◽

pp. 37-48 ◽

Cited By ~ 11

Author(s):

Hans L. Bodlaender ◽

Dimitrios M. Thilikos

Keyword(s):

Linear Time ◽

Search Numbers

Download Full-text

Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_22 ◽

2004 ◽

pp. 248-259 ◽

Cited By ~ 3

Author(s):

Sergey S. Fedin ◽

Alexander S. Kulikov

Keyword(s):

Upper Bounds ◽

Splitting Algorithms ◽

Running Time

Download Full-text

A Direct Algorithm for the Parameterized Face Cover Problem

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_19 ◽

2004 ◽

pp. 213-222 ◽

Cited By ~ 1

Author(s):

Faisal N. Abu-Khzam ◽

Michael A. Langston

Keyword(s):

Direct Algorithm ◽

Cover Problem

Download Full-text

Looking at the Stars

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_13 ◽

2004 ◽

pp. 138-148 ◽

Cited By ~ 8

Author(s):

Elena Prieto ◽

Christian Sloper

Download Full-text

On Miniaturized Problems in Parameterized Complexity Theory

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_10 ◽

2004 ◽

pp. 108-120 ◽

Cited By ~ 1

Author(s):

Yijia Chen ◽

Jörg Flum

Keyword(s):

Complexity Theory ◽

Parameterized Complexity

Download Full-text

Smaller Kernels for Hitting Set Problems of Constant Arity

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_11 ◽

2004 ◽

pp. 121-126 ◽

Cited By ~ 5

Author(s):

Naomi Nishimura ◽

Prabhakar Ragde ◽

Dimitrios M. Thilikos

Keyword(s):

Hitting Set

Download Full-text

On Decidability of MSO Theories of Representable Matroids

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_9 ◽

2004 ◽

pp. 96-107 ◽

Cited By ~ 1

Author(s):

Petr Hliněný ◽

Detlef Seese

Download Full-text

Parameterized Algorithms for Feedback Vertex Set

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_21 ◽

2004 ◽

pp. 235-247 ◽

Cited By ~ 22

Author(s):

Iyad Kanj ◽

Michael Pelsmajer ◽

Marcus Schaefer

Keyword(s):

Parameterized Algorithms ◽

Feedback Vertex Set ◽

Vertex Set

Download Full-text

Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28639-4_24 ◽

2004 ◽

pp. 271-280 ◽

Cited By ~ 17

Author(s):

Frank Dehne ◽

Mike Fellows ◽

Frances Rosamond ◽

Peter Shaw

Keyword(s):

Vertex Cover ◽

Iterative Compression ◽

Set Splitting ◽

Improved Algorithm

Download Full-text

Parameterized and Exact Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Structural View on Parameterizing Problems: Distance from Triviality

Computing Small Search Numbers in Linear Time

Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms

A Direct Algorithm for the Parameterized Face Cover Problem

Looking at the Stars

On Miniaturized Problems in Parameterized Complexity Theory

Smaller Kernels for Hitting Set Problems of Constant Arity

On Decidability of MSO Theories of Representable Matroids

Parameterized Algorithms for Feedback Vertex Set

Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover

Parameterized and Exact Computation - Lecture Notes in Computer Science
Latest Publications