Book 2015

Parameterized Algorithms

ISBN: 978-3-319-21274-6 (Print) 978-3-319-21275-3 (Online)

Table of contents (15 chapters)

  1. Front Matter

    Pages i-xvii

  2. Basic Toolbox

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-15

      Introduction

    3. No Access

      Chapter

      Pages 17-49

      Kernelization

    4. No Access

      Chapter

      Pages 51-76

      Bounded Search Trees

    5. No Access

      Chapter

      Pages 77-98

      Iterative Compression

    6. No Access

      Chapter

      Pages 99-127

      Randomized Methods in Parameterized Algorithms

    7. No Access

      Chapter

      Pages 129-150

      Miscellaneous

    8. No Access

      Chapter

      Pages 151-244

      Treewidth

  3. Advanced Algorithmic Techniques

    1. Front Matter

      Pages 245-245

    2. No Access

      Chapter

      Pages 247-284

      Finding cuts and separators

    3. No Access

      Chapter

      Pages 285-319

      Advanced kernelization algorithms

    4. No Access

      Chapter

      Pages 321-355

      Algebraic techniques: sieves, convolutions, and polynomials

    5. No Access

      Chapter

      Pages 357-375

      Improving dynamic programming on tree decompositions

    6. No Access

      Chapter

      Pages 377-418

      Matroids

  4. Lower Bounds

    1. Front Matter

      Pages 419-419

    2. No Access

      Chapter

      Pages 421-465

      Fixed-parameter intractability

    3. No Access

      Chapter

      Pages 467-521

      Lower Bounds Based on the Exponential-Time Hypothesis

    4. No Access

      Chapter

      Pages 523-555

      Lower bounds for kernelization

  5. Back Matter

    Pages 556-613