↓ Skip to main content

Algorithms and Computation

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Regular Labelings and Geometric Structures
  3. Altmetric Badge
    Chapter 2 Algorithmic Aspects of Secure Computation and Communication
  4. Altmetric Badge
    Chapter 3 Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
  5. Altmetric Badge
    Chapter 4 A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2
  6. Altmetric Badge
    Chapter 5 Approximate Periodicity
  7. Altmetric Badge
    Chapter 6 Approximating the Average Stretch Factor of Geometric Graphs
  8. Altmetric Badge
    Chapter 7 Satisfiability with Index Dependency
  9. Altmetric Badge
    Chapter 8 Anonymous Fuzzy Identity-Based Encryption for Similarity Search
  10. Altmetric Badge
    Chapter 9 Improved Randomized Algorithms for 3-SAT
  11. Altmetric Badge
    Chapter 10 Quantum Counterfeit Coin Problems
  12. Altmetric Badge
    Chapter 11 Priority Range Trees
  13. Altmetric Badge
    Chapter 12 Should Static Search Trees Ever Be Unbalanced?
  14. Altmetric Badge
    Chapter 13 Levelwise Mesh Sparsification for Shortest Path Queries
  15. Altmetric Badge
    Chapter 14 Unit-Time Predecessor Queries on Massive Data Sets
  16. Altmetric Badge
    Chapter 15 Popularity at Minimum Cost
  17. Altmetric Badge
    Chapter 16 Structural and Complexity Aspects of Line Systems of Graphs
  18. Altmetric Badge
    Chapter 17 Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
  19. Altmetric Badge
    Chapter 18 Generating Trees on Multisets
  20. Altmetric Badge
    Chapter 19 Seidel Minor, Permutation Graphs and Combinatorial Properties
  21. Altmetric Badge
    Chapter 20 Simultaneous Interval Graphs
  22. Altmetric Badge
    Chapter 21 Unbalanced Graph Partitioning
  23. Altmetric Badge
    Chapter 22 On the Intersection of Tolerance and Cocomparability Graphs
  24. Altmetric Badge
    Chapter 23 Flows in One-Crossing-Minor-Free Graphs
  25. Altmetric Badge
    Chapter 24 From Holant to #CSP and Back: Dichotomy for Holant c Problems
  26. Altmetric Badge
    Chapter 25 Computing Sparse Multiples of Polynomials
  27. Altmetric Badge
    Chapter 26 Fractal Parallelism: Solving SAT in Bounded Space and Time
  28. Altmetric Badge
    Chapter 27 Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
  29. Altmetric Badge
    Chapter 28 New Upper Bounds on the Average PTF Density of Boolean Functions
  30. Altmetric Badge
    Chapter 29 An Optimal Algorithm for Computing Angle-Constrained Spanners
  31. Altmetric Badge
    Chapter 30 Approximating Minimum Bending Energy Path in a Simple Corridor
  32. Altmetric Badge
    Chapter 31 Analysis of an Iterated Local Search Algorithm for Vertex Coloring
  33. Altmetric Badge
    Chapter 32 Bounded Max-colorings of Graphs
  34. Altmetric Badge
    Chapter 33 Parameterized Algorithms for Boxicity
  35. Altmetric Badge
    Chapter 34 On Tractable Cases of Target Set Selection
  36. Altmetric Badge
    Chapter 35 Combining Two Worlds: Parameterised Approximation for Vertex Cover
  37. Altmetric Badge
    Chapter 36 Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
  38. Altmetric Badge
    Chapter 37 Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles
  39. Altmetric Badge
    Chapter 38 Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
  40. Altmetric Badge
    Chapter 39 An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems
  41. Altmetric Badge
    Chapter 40 A Faster Algorithm for the Maximum Even Factor Problem
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 (63rd percentile)
  • High Attention Score compared to outputs of the same age and source (80th percentile)

Mentioned by

1 tweeter
1 Q&A thread


2 Dimensions

Readers on

9 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 Computation
Published by
ADS, January 2010
DOI 10.1007/978-3-642-17517-6
978-3-64-217516-9, 978-3-64-217517-6

Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park

Twitter Demographics

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

Mendeley readers

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

Geographical breakdown

Country Count As %
Germany 1 11%
Unknown 8 89%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 56%
Student > Master 2 22%
Student > Postgraduate 1 11%
Unknown 1 11%
Readers by discipline Count As %
Computer Science 4 44%
Environmental Science 1 11%
Business, Management and Accounting 1 11%
Physics and Astronomy 1 11%
Engineering 1 11%
Other 0 0%
Unknown 1 11%

Attention Score in Context

This research output has an Altmetric Attention Score of 4. 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 03 September 2019.
All research outputs
of 15,782,077 outputs
Outputs from ADS
of 29,752 outputs
Outputs of similar age
of 280,640 outputs
Outputs of similar age from ADS
of 230 outputs
Altmetric has tracked 15,782,077 research outputs across all sources so far. This one has received more attention than most of these and is in the 69th percentile.
So far Altmetric has tracked 29,752 research outputs from this source. They receive a mean Attention Score of 4.3. This one has done well, scoring higher than 75% 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 280,640 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 63% of its contemporaries.
We're also able to compare this research output to 230 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 80% of its contemporaries.