↓ Skip to main content

Algorithms and Complexity

Overview of attention for book
Cover of 'Algorithms and Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Towards a Distributed Search Engine
  3. Altmetric Badge
    Chapter 2 Mechanisms for the Marriage and the Assignment Game
  4. Altmetric Badge
    Chapter 3 Resilient Algorithms and Data Structures
  5. Altmetric Badge
    Chapter 4 An Exact Algorithm for Connected Red-Blue Dominating Set
  6. Altmetric Badge
    Chapter 5 Maximizing PageRank with New Backlinks
  7. Altmetric Badge
    Chapter 6 Enumerating Rooted Graphs with Reflectional Block Structures
  8. Altmetric Badge
    Chapter 7 Improved Approximations for TSP with Simple Precedence Constraints
  9. Altmetric Badge
    Chapter 8 Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
  10. Altmetric Badge
    Chapter 9 Parameterized Complexity of Even/Odd Subgraph Problems
  11. Altmetric Badge
    Chapter 10 Popular Matchings in the Marriage and Roommates Problems
  12. Altmetric Badge
    Chapter 11 Bounding the Number of Tolerable Faults in Majority-Based Systems
  13. Altmetric Badge
    Chapter 12 A Parameterized Algorithm for Chordal Sandwich
  14. Altmetric Badge
    Chapter 13 Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown
  15. Altmetric Badge
    Chapter 14 Graph Unique-Maximum and Conflict-Free Colorings
  16. Altmetric Badge
    Chapter 15 Strategic Coloring of a Graph
  17. Altmetric Badge
    Chapter 16 Multicut Algorithms via Tree Decompositions
  18. Altmetric Badge
    Chapter 17 The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
  19. Altmetric Badge
    Chapter 18 Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
  20. Altmetric Badge
    Chapter 19 A Planar Linear Arboricity Conjecture
  21. Altmetric Badge
    Chapter 20 On the Number of Higher Order Delaunay Triangulations
  22. Altmetric Badge
    Chapter 21 How Simple Robots Benefit from Looking Back
  23. Altmetric Badge
    Chapter 22 On Strategy Improvement Algorithms for Simple Stochastic Games
  24. Altmetric Badge
    Chapter 23 Online Cooperative Cost Sharing
  25. Altmetric Badge
    Chapter 24 On the Power of Nodes of Degree Four in the Local Max-Cut Problem
  26. Altmetric Badge
    Chapter 25 Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
  27. Altmetric Badge
    Chapter 26 Irredundant Set Faster Than O (2 n )
  28. Altmetric Badge
    Chapter 27 Algorithms and Complexity
  29. Altmetric Badge
    Chapter 28 A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
  30. Altmetric Badge
    Chapter 29 Finding the Maximum Suffix with Fewer Comparisons
  31. Altmetric Badge
    Chapter 30 An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
  32. Altmetric Badge
    Chapter 31 Capacitated Confluent Flows: Complexity and Algorithms
  33. Altmetric Badge
    Chapter 32 Preprocessing Speed-Up Techniques Is Hard
  34. Altmetric Badge
    Chapter 33 Communication Requirements for Stable Marriages
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age (61st percentile)
  • Good Attention Score compared to outputs of the same age and source (79th percentile)

Mentioned by

1 Wikipedia page


1 Dimensions

Readers on

1 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.
Algorithms and Complexity
Published by
ADS, May 2010
DOI 10.1007/978-3-642-13073-1
978-3-64-213072-4, 978-3-64-213073-1

Calamoneri, Tiziana, Diaz, Josep

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 %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 100%
Readers by discipline Count As %
Mathematics 1 100%

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 10 April 2017.
All research outputs
of 13,461,834 outputs
Outputs from ADS
of 26,060 outputs
Outputs of similar age
of 263,747 outputs
Outputs of similar age from ADS
of 275 outputs
Altmetric has tracked 13,461,834 research outputs across all sources so far. This one is in the 49th percentile – i.e., 49% of other outputs scored the same or lower than it.
So far Altmetric has tracked 26,060 research outputs from this source. They receive a mean Attention Score of 4.2. This one is in the 33rd percentile – i.e., 33% of its peers scored the same or lower than it.
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 263,747 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 61% of its contemporaries.
We're also able to compare this research output to 275 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 79% of its contemporaries.