Texts in Computer Science - Fundamentals of Parameterized Complexity
Latest Publications

TOTAL DOCUMENTS

35

(FIVE YEARS 0)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer London

9781447155584, 9781447155591

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Parameterized Counting and Randomization

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_32 ◽

2013 ◽

pp. 645-673

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Download Full-text

Kernelization Lower Bounds

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_30 ◽

2013 ◽

pp. 571-619

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Keyword(s):

Download Full-text

Another Basis for the W-Hierarchy and the Tradeoff Theorem

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_28 ◽

2013 ◽

pp. 521-531

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Download Full-text

Fixed Parameter Analogues of PSpace and k-Move Games

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_26 ◽

2013 ◽

pp. 491-507

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Keyword(s):

Fixed Parameter

Download Full-text

Beyond W[t]-Hardness

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_25 ◽

2013 ◽

pp. 473-489

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Download Full-text

The W-Hierarchy

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_23 ◽

2013 ◽

pp. 427-459

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Download Full-text

Well-Quasi-Orderings and the Robertson–Seymour Theorems

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_17 ◽

2013 ◽

pp. 319-338

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Download Full-text

Preliminaries

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_1 ◽

2013 ◽

pp. 3-13

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Download Full-text

Optimization Problems, Approximation Schemes, and Their Relation to FPT

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_9 ◽

2013 ◽

pp. 171-182

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Keyword(s):

Optimization Problems ◽

Approximation Schemes

Download Full-text

Color Coding, Multilinear Detection, and Randomized Divide and Conquer

Texts in Computer Science - Fundamentals of Parameterized Complexity ◽

10.1007/978-1-4471-5559-1_8 ◽

2013 ◽

pp. 143-170

Author(s):

Rodney G. Downey ◽

Michael R. Fellows

Keyword(s):

Divide And Conquer ◽

Download Full-text