↓ Skip to main content

Parameterized and Exact Computation

Overview of attention for book
Cover of 'Parameterized and Exact Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Exact Complexity and Satisfiability
  3. Altmetric Badge
    Chapter 2 The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups
  4. Altmetric Badge
    Chapter 3 Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
  5. Altmetric Badge
    Chapter 4 Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem
  6. Altmetric Badge
    Chapter 5 The Fine Details of Fast Dynamic Programming over Tree Decompositions
  7. Altmetric Badge
    Chapter 6 On Subexponential and FPT-Time Inapproximability
  8. Altmetric Badge
    Chapter 7 Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
  9. Altmetric Badge
    Chapter 8 Chain Minors Are FPT
  10. Altmetric Badge
    Chapter 9 Incompressibility of H-Free Edge Modification
  11. Altmetric Badge
    Chapter 10 Contracting Few Edges to Remove Forbidden Induced Subgraphs
  12. Altmetric Badge
    Chapter 11 Fixed-Parameter and Approximation Algorithms: A New Look
  13. Altmetric Badge
    Chapter 12 Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
  14. Altmetric Badge
    Chapter 13 Computing Tree-Depth Faster Than 2 n
  15. Altmetric Badge
    Chapter 14 Faster Exact Algorithms for Some Terminal Set Problems
  16. Altmetric Badge
    Chapter 15 Parameterized Algorithms for Modular-Width
  17. Altmetric Badge
    Chapter 16 A Faster FPT Algorithm for Bipartite Contraction
  18. Altmetric Badge
    Chapter 17 On the Ordered List Subgraph Embedding Problems
  19. Altmetric Badge
    Chapter 18 A Completeness Theory for Polynomial (Turing) Kernelization
  20. Altmetric Badge
    Chapter 19 On Sparsification for Computing Treewidth
  21. Altmetric Badge
    Chapter 20 The Jump Number Problem: Exact and Parameterized
  22. Altmetric Badge
    Chapter 21 On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
  23. Altmetric Badge
    Chapter 22 Hardness of r-dominating set on Graphs of Diameter (r + 1)
  24. Altmetric Badge
    Chapter 23 Amalgam Width of Matroids
  25. Altmetric Badge
    Chapter 24 On the Parameterized Complexity of Reconfiguration Problems
  26. Altmetric Badge
    Chapter 25 FPT Algorithms for Consecutive Ones Submatrix Problems
  27. Altmetric Badge
    Chapter 26 Upper Bounds on Boolean-Width with Applications to Exact Algorithms
  28. Altmetric Badge
    Chapter 27 Speeding Up Dynamic Programming with Representative Sets
  29. Altmetric Badge
    Chapter 28 Completeness Results for Parameterized Space Classes
  30. Altmetric Badge
    Chapter 29 Treewidth and Pure Nash Equilibria
  31. Altmetric Badge
    Chapter 30 Algorithms for k-Internal Out-Branching
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Above-average Attention Score compared to outputs of the same age and source (55th percentile)

Mentioned by

wikipedia
3 Wikipedia pages

Readers on

mendeley
4 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
Parameterized and Exact Computation
Published by
Lecture notes in computer science, January 2013
DOI 10.1007/978-3-319-03898-8
ISBNs
978-3-31-903897-1, 978-3-31-903898-8
Editors

Gregory Gutin, Stefan Szeider

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 25%
Unknown 3 75%
Readers by discipline Count As %
Computer Science 1 25%
Unknown 3 75%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 14 April 2023.
All research outputs
#7,754,533
of 23,572,509 outputs
Outputs from Lecture notes in computer science
#2,494
of 8,153 outputs
Outputs of similar age
#85,965
of 284,650 outputs
Outputs of similar age from Lecture notes in computer science
#100
of 318 outputs
Altmetric has tracked 23,572,509 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,153 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has gotten more attention than average, scoring higher than 54% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 284,650 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 45th percentile – i.e., 45% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 318 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 55% of its contemporaries.