↓ Skip to main content

Algorithms – ESA 2010

Overview of attention for book
Cover of 'Algorithms – ESA 2010'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algorithms – ESA 2010
  3. Altmetric Badge
    Chapter 2 Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
  4. Altmetric Badge
    Chapter 3 Non-clairvoyant Speed Scaling for Weighted Flow Time
  5. Altmetric Badge
    Chapter 4 A Robust PTAS for Machine Covering and Packing
  6. Altmetric Badge
    Chapter 5 Balancing Degree, Diameter and Weight in Euclidean Spanners
  7. Altmetric Badge
    Chapter 6 Testing Euclidean Spanners
  8. Altmetric Badge
    Chapter 7 Fast Approximation in Subspaces by Doubling Metric Decomposition
  9. Altmetric Badge
    Chapter 8 f-Sensitivity Distance Oracles and Routing Schemes
  10. Altmetric Badge
    Chapter 9 Fast Minor Testing in Planar Graphs
  11. Altmetric Badge
    Chapter 10 On the Number of Spanning Trees a Planar Graph Can Have
  12. Altmetric Badge
    Chapter 11 Contractions of Planar Graphs in Polynomial Time
  13. Altmetric Badge
    Chapter 12 Communication Complexity of Quasirandom Rumor Spreading
  14. Altmetric Badge
    Chapter 13 A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
  15. Altmetric Badge
    Chapter 14 Contribution Games in Social Networks
  16. Altmetric Badge
    Chapter 15 Improved Bounds for Online Stochastic Matching
  17. Altmetric Badge
    Chapter 16 Online Stochastic Packing Applied to Display Ad Allocation
  18. Altmetric Badge
    Chapter 17 Caching Is Hard – Even in the Fault Model
  19. Altmetric Badge
    Chapter 18 Superselectors: Efficient Constructions and Applications
  20. Altmetric Badge
    Chapter 19 Estimating the Average of a Lipschitz-Continuous Function from One Sample
  21. Altmetric Badge
    Chapter 20 Streaming Graph Computations with a Helpful Advisor
  22. Altmetric Badge
    Chapter 21 Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
  23. Altmetric Badge
    Chapter 22 Minimum Vertex Cover in Rectangle Graphs
  24. Altmetric Badge
    Chapter 23 Feedback Vertex Sets in Tournaments
  25. Altmetric Badge
    Chapter 24 n-Level Graph Partitioning
  26. Altmetric Badge
    Chapter 25 Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
  27. Altmetric Badge
    Chapter 26 Finding the Diameter in Real-World Graphs
  28. Altmetric Badge
    Chapter 27 Budgeted Red-Blue Median and Its Generalizations
  29. Altmetric Badge
    Chapter 28 All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables
  30. Altmetric Badge
    Chapter 29 Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems
  31. Altmetric Badge
    Chapter 30 Robust Algorithms for Sorting Railway Cars
  32. Altmetric Badge
    Chapter 31 Cloning Voronoi Diagrams via Retroactive Data Structures
  33. Altmetric Badge
    Chapter 32 A Unified Approach to Approximate Proximity Searching
  34. Altmetric Badge
    Chapter 33 Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
  35. Altmetric Badge
    Chapter 34 Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space
  36. Altmetric Badge
    Chapter 35 Local Graph Exploration and Fast Property Testing
  37. Altmetric Badge
    Chapter 36 A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
  38. Altmetric Badge
    Chapter 37 Fast Prefix Search in Little Space, with Applications
  39. Altmetric Badge
    Chapter 38 On the Huffman and Alphabetic Tree Problem with General Cost Functions
  40. Altmetric Badge
    Chapter 39 Medium-Space Algorithms for Inverse BWT
  41. Altmetric Badge
    Chapter 40 Median Trajectories
  42. Altmetric Badge
    Chapter 41 Optimal Cover of Points by Disks in a Simple Polygon
  43. Altmetric Badge
    Chapter 42 Algorithms – ESA 2010
  44. Altmetric Badge
    Chapter 43 The Geodesic Diameter of Polygonal Domains
  45. Altmetric Badge
    Chapter 44 Polyhedral and Algorithmic Properties of Quantified Linear Programs
  46. Altmetric Badge
    Chapter 45 Approximating Parameterized Convex Optimization Problems
  47. Altmetric Badge
    Chapter 46 Approximation Schemes for Multi-Budgeted Independence Systems
  48. Altmetric Badge
    Chapter 47 Algorithmic Meta-theorems for Restrictions of Treewidth
  49. Altmetric Badge
    Chapter 48 Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
  50. Altmetric Badge
    Chapter 49 Constructing the R* Consensus Tree of Two Trees in Subcubic Time
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 (85th percentile)
  • High Attention Score compared to outputs of the same age and source (82nd percentile)

Mentioned by

twitter
3 X users
wikipedia
6 Wikipedia pages
q&a
1 Q&A thread

Readers on

mendeley
2 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
Algorithms – ESA 2010
Published by
ADS, January 2010
DOI 10.1007/978-3-642-15775-2
ISBNs
978-3-64-215774-5, 978-3-64-215775-2
Authors

Bansal, Nikhil, Gupta, Anupam, Li, Jian, Mestre, Julián, Nagarajan, Viswanath, Rudra, Atri

Editors

Mark de Berg, Ulrich Meyer

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users 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 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 50%
Unknown 1 50%
Readers by discipline Count As %
Engineering 1 50%
Unknown 1 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 8. 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 24 April 2022.
All research outputs
#4,499,159
of 26,017,215 outputs
Outputs from ADS
#2,752
of 26,744 outputs
Outputs of similar age
#24,997
of 177,915 outputs
Outputs of similar age from ADS
#101
of 627 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. Compared to these this one has done well and is in the 81st 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 well, scoring higher than 89% 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 85% 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 82% of its contemporaries.