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

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 Parameterized and Exact Computation
  3. Altmetric Badge
    Chapter 2 Protrusions in Graphs and Their Applications
  4. Altmetric Badge
    Chapter 3 Parameterized Complexity Results in Symmetry Breaking
  5. Altmetric Badge
    Chapter 4 On the Kernelization Complexity of Colorful Motifs
  6. Altmetric Badge
    Chapter 5 Partial Kernelization for Rank Aggregation: Theory and Experiments
  7. Altmetric Badge
    Chapter 6 Enumerate and Measure: Improving Parameter Budget Management
  8. Altmetric Badge
    Chapter 7 On the Exact Complexity of Evaluating Quantified k-CNF
  9. Altmetric Badge
    Chapter 8 Cluster Editing: Kernelization Based on Edge Cuts
  10. Altmetric Badge
    Chapter 9 Computing the Deficiency of Housing Markets with Duplicate Houses
  11. Altmetric Badge
    Chapter 10 A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application
  12. Altmetric Badge
    Chapter 11 An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
  13. Altmetric Badge
    Chapter 12 Multivariate Complexity Analysis of Swap Bribery
  14. Altmetric Badge
    Chapter 13 Parameterizing by the Number of Numbers
  15. Altmetric Badge
    Chapter 14 Are there any good digraph width measures?
  16. Altmetric Badge
    Chapter 15 On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
  17. Altmetric Badge
    Chapter 16 Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
  18. Altmetric Badge
    Chapter 17 On the Grundy Number of a Graph
  19. Altmetric Badge
    Chapter 18 Exponential Time Complexity of Weighted Counting of Independent Sets
  20. Altmetric Badge
    Chapter 19 The Exponential Time Complexity of Computing the Probability That a Graph Is Connected
  21. Altmetric Badge
    Chapter 20 Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
  22. Altmetric Badge
    Chapter 21 Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier
  23. Altmetric Badge
    Chapter 22 Proper Interval Vertex Deletion
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (89th percentile)
  • High Attention Score compared to outputs of the same age and source (89th percentile)

Mentioned by

blogs
1 blog
twitter
1 X user
q&a
1 Q&A thread

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
1 Mendeley
Summary Blogs X Q&A Dimensions citations
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
ADS, January 2010
DOI 10.1007/978-3-642-17493-3
ISBNs
978-3-64-217492-6, 978-3-64-217493-3
Editors

Venkatesh Raman, Saket Saurabh

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
 Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Portugal 1 100%
Germany 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 300%
Professor 1 100%
Readers by discipline Count As %
Mathematics 2 200%
Computer Science 2 200%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 11. 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 12 October 2017.
All research outputs
#3,383,898
of 25,837,817 outputs
Outputs from ADS
#1,799
of 26,744 outputs
Outputs of similar age
#16,987
of 177,915 outputs
Outputs of similar age from ADS
#65
of 627 outputs
Altmetric has tracked 25,837,817 research outputs across all sources so far. Compared to these this one has done well and is in the 86th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 26,744 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 done particularly well, scoring higher than 92% 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 177,915 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 89% of its contemporaries.
We're also able to compare this research output to 627 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 89% of its contemporaries.

This page is provided by Altmetric.