↓ Skip to main content

Fundamentals of Parameterized Complexity

Overview of attention for book
Cover of 'Fundamentals of Parameterized Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Preliminaries
  3. Altmetric Badge
    Chapter 2 The Basic Definitions
  4. Altmetric Badge
    Chapter 3 Bounded Search Trees
  5. Altmetric Badge
    Chapter 4 Kernelization
  6. Altmetric Badge
    Chapter 5 More on Kernelization
  7. Altmetric Badge
    Chapter 6 Iterative Compression, and Measure and Conquer, for Minimization Problems
  8. Altmetric Badge
    Chapter 7 Further Elementary Techniques
  9. Altmetric Badge
    Chapter 8 Color Coding, Multilinear Detection, and Randomized Divide and Conquer
  10. Altmetric Badge
    Chapter 9 Optimization Problems, Approximation Schemes, and Their Relation to FPT
  11. Altmetric Badge
    Chapter 10 Treewidth and Dynamic Programming
  12. Altmetric Badge
    Chapter 11 Heuristics for Treewidth
  13. Altmetric Badge
    Chapter 12 Methods via Automata and Bounded Treewidth
  14. Altmetric Badge
    Chapter 13 Courcelle’s Theorem
  15. Altmetric Badge
    Chapter 14 More on Width-Metrics: Applications and Local Treewidth
  16. Altmetric Badge
    Chapter 15 Depth-First Search and the Plehn–Voigt Theorem
  17. Altmetric Badge
    Chapter 16 Other Width Metrics
  18. Altmetric Badge
    Chapter 17 Well-Quasi-Orderings and the Robertson–Seymour Theorems
  19. Altmetric Badge
    Chapter 18 The Graph Minor Theorem
  20. Altmetric Badge
    Chapter 19 Applications of the Obstruction Principle and WQO s
  21. Altmetric Badge
    Chapter 20 Reductions
  22. Altmetric Badge
    Chapter 21 The Basic Class W [1] and an Analog of Cook’s Theorem
  23. Altmetric Badge
    Chapter 22 Some Other W [1] Hardness Results
  24. Altmetric Badge
    Chapter 23 The W -Hierarchy
  25. Altmetric Badge
    Chapter 24 The Monotone and Antimonotone Collapse Theorems: Monotone W [2 t +1]= W [2 t ] and Antimonotone W [2 t +2]= W [2 t +1]
  26. Altmetric Badge
    Chapter 25 Beyond W [ t ]-Hardness
  27. Altmetric Badge
    Chapter 26 Fixed Parameter Analogues of PSpace and k -Move Games
  28. Altmetric Badge
    Chapter 27 Provable Intractability: The Class XP
  29. Altmetric Badge
    Chapter 28 Another Basis for the W -Hierarchy and the Tradeoff Theorem
  30. Altmetric Badge
    Chapter 29 The M -Hierarchy, and XP -Optimality
  31. Altmetric Badge
    Chapter 30 Kernelization Lower Bounds
  32. Altmetric Badge
    Chapter 31 Parameterized Approximation
  33. Altmetric Badge
    Chapter 32 Parameterized Counting and Randomization
  34. Altmetric Badge
    Chapter 33 Research Horizons
  35. Altmetric Badge
    Chapter 34 Appendix 1: Network Flows and Matchings
  36. Altmetric Badge
    Chapter 35 Appendix 2: Menger’s Theorems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
3 Wikipedia pages

Citations

dimensions_citation
934 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Fundamentals of Parameterized Complexity
Published by
Springer London, December 2013
DOI 10.1007/978-1-4471-5559-1
ISBNs
978-1-4471-5558-4, 978-1-4471-5559-1
Authors

Downey, Rodney G., Fellows, Michael R.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Japan 2 100%
France 1 50%
Germany 1 50%
Spain 1 50%
United States 1 50%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 29 1450%
Student > Master 14 700%
Student > Bachelor 9 450%
Researcher 8 400%
Student > Postgraduate 6 300%
Other 9 450%
Readers by discipline Count As %
Computer Science 55 2750%
Psychology 3 150%
Mathematics 3 150%
Engineering 3 150%
Physics and Astronomy 2 100%
Other 5 250%