Parameterized Complexity Theory

Authors:

ISBN: 978-3-540-29952-3 (Print) 978-3-540-29953-0 (Online)

Table of contents (16 chapters)

  1. Front Matter

    Pages I-XIII

  2. No Access

    Chapter

    Pages 1-31

    Fixed-Parameter Tractability

  3. No Access

    Chapter

    Pages 33-43

    Reductions and Parameterized Intractability

  4. No Access

    Chapter

    Pages 45-63

    The Class W[P]

  5. No Access

    Chapter

    Pages 65-93

    Logic and Complexity

  6. No Access

    Chapter

    Pages 95-103

    Two Fundamental Hierarchies

  7. No Access

    Chapter

    Pages 105-131

    The First Level of the Hierarchies

  8. No Access

    Chapter

    Pages 133-164

    The W-Hierarchy

  9. No Access

    Chapter

    Pages 165-205

    The A-Hierarchy

  10. No Access

    Chapter

    Pages 207-231

    Kernelization and Linear Programming Techniques

  11. No Access

    Chapter

    Pages 233-260

    The Automata-Theoretic Approach

  12. No Access

    Chapter

    Pages 261-299

    Tree Width

  13. No Access

    Chapter

    Pages 301-325

    Planarity and Bounded Local Tree Width

  14. No Access

    Chapter

    Pages 327-355

    Homomorphisms and Embeddings

  15. No Access

    Chapter

    Pages 357-388

    Parameterized Counting Problems

  16. No Access

    Chapter

    Pages 389-416

    Bounded Fixed-Parameter Tractability and Limited Nondeterminism

  17. No Access

    Chapter

    Pages 417-451

    Subexponential Fixed-Parameter Tractability

  18. Back Matter

    Pages 453-495