↓ Skip to main content
What is this page? Embed badge

Parameterized Algorithms

Overview of attention for book
Cover of 'Parameterized Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Introduction
  3. Altmetric Badge
    Chapter 2 Kernelization
  4. Altmetric Badge
    Chapter 3 Bounded Search Trees
  5. Altmetric Badge
    Chapter 4 Iterative Compression
  6. Altmetric Badge
    Chapter 5 Randomized Methods in Parameterized Algorithms
  7. Altmetric Badge
    Chapter 6 Miscellaneous
  8. Altmetric Badge
    Chapter 7 Treewidth
  9. Altmetric Badge
    Chapter 8 Finding cuts and separators
  10. Altmetric Badge
    Chapter 9 Advanced kernelization algorithms
  11. Altmetric Badge
    Chapter 10 Algebraic techniques: sieves, convolutions, and polynomials
  12. Altmetric Badge
    Chapter 11 Improving dynamic programming on tree decompositions
  13. Altmetric Badge
    Chapter 12 Matroids
  14. Altmetric Badge
    Chapter 13 Fixed-parameter intractability
  15. Altmetric Badge
    Chapter 14 Lower Bounds Based on the Exponential-Time Hypothesis
  16. Altmetric Badge
    Chapter 15 Lower bounds for kernelization
Attention for Chapter 13: Fixed-parameter intractability
Altmetric Badge

Citations

dimensions_citation
1458 Dimensions

Readers on

mendeley
7 Mendeley
Summary Dimensions citations
So far, Dimensions has found 1,458 publications that cite this research output.

1,458

The most recent citing publications are shown below. View all 1,458 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.