↓ Skip to main content

Algorithms - ESA 2003

Overview of attention for book
Cover of 'Algorithms - ESA 2003'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Sublinear Computing
  3. Altmetric Badge
    Chapter 2 Authenticated Data Structures
  4. Altmetric Badge
    Chapter 3 Approximation Algorithms and Network Games
  5. Altmetric Badge
    Chapter 4 Algorithms - ESA 2003
  6. Altmetric Badge
    Chapter 5 Line System Design and a Generalized Coloring Problem
  7. Altmetric Badge
    Chapter 6 Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties
  8. Altmetric Badge
    Chapter 7 Scheduling for Flow-Time with Admission Control
  9. Altmetric Badge
    Chapter 8 On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows
  10. Altmetric Badge
    Chapter 9 Semi-clairvoyant Scheduling
  11. Altmetric Badge
    Chapter 10 Algorithms for Graph Rigidity and Scene Analysis
  12. Altmetric Badge
    Chapter 11 Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting
  13. Altmetric Badge
    Chapter 12 Multi-player and Multi-round Auctions with Severely Bounded Communication
  14. Altmetric Badge
    Chapter 13 Network Lifetime and Power Assignment in ad hoc Wireless Networks
  15. Altmetric Badge
    Chapter 14 Disjoint Unit Spheres admit at Most Two Line Transversals
  16. Altmetric Badge
    Chapter 15 An Optimal Algorithm for the Maximum-Density Segment Problem
  17. Altmetric Badge
    Chapter 16 Estimating Dominance Norms of Multiple Data Streams
  18. Altmetric Badge
    Chapter 17 Smoothed Motion Complexity
  19. Altmetric Badge
    Chapter 18 Kinetic Dictionaries: How to Shoot a Moving Target
  20. Altmetric Badge
    Chapter 19 Deterministic Rendezvous in Graphs
  21. Altmetric Badge
    Chapter 20 Fast Integer Programming in Fixed Dimension
  22. Altmetric Badge
    Chapter 21 Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs
  23. Altmetric Badge
    Chapter 22 Dominating Sets and Local Treewidth
  24. Altmetric Badge
    Chapter 23 Approximating Energy Efficient Paths in Wireless Multi-hop Networks
  25. Altmetric Badge
    Chapter 24 Bandwidth Maximization in Multicasting
  26. Altmetric Badge
    Chapter 25 Optimal Distance Labeling for Interval and Circular-Arc Graphs
  27. Altmetric Badge
    Chapter 26 Improved Approximation of the Stable Marriage Problem
  28. Altmetric Badge
    Chapter 27 Fast Algorithms for Computing the Smallest k -Enclosing Disc
  29. Altmetric Badge
    Chapter 28 The Minimum Generalized Vertex Cover Problem
  30. Altmetric Badge
    Chapter 29 An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint
  31. Altmetric Badge
    Chapter 30 On-Demand Broadcasting Under Deadline
  32. Altmetric Badge
    Chapter 31 Improved Bounds for Finger Search on a RAM
  33. Altmetric Badge
    Chapter 32 The Voronoi Diagram of Planar Convex Objects
  34. Altmetric Badge
    Chapter 33 Buffer Overflows of Merging Streams
  35. Altmetric Badge
    Chapter 34 Improved Competitive Guarantees for QoS Buffering
  36. Altmetric Badge
    Chapter 35 On Generalized Gossiping and Broadcasting
  37. Altmetric Badge
    Chapter 36 Approximating the Achromatic Number Problem on Bipartite Graphs
  38. Altmetric Badge
    Chapter 37 Adversary Immune Leader Election in ad hoc Radio Networks
  39. Altmetric Badge
    Chapter 38 Universal Facility Location
  40. Altmetric Badge
    Chapter 39 A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm
  41. Altmetric Badge
    Chapter 40 I/O-Efficient Undirected Shortest Paths
  42. Altmetric Badge
    Chapter 41 On the Complexity of Approximating TSP with Neighborhoods and Related Problems
  43. Altmetric Badge
    Chapter 42 A Lower Bound for Cake Cutting
  44. Altmetric Badge
    Chapter 43 Ray Shooting and Stone Throwing
  45. Altmetric Badge
    Chapter 44 Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
  46. Altmetric Badge
    Chapter 45 Binary Space Partition for Orthogonal Fat Rectangles
  47. Altmetric Badge
    Chapter 46 Sequencing by Hybridization in Few Rounds
  48. Altmetric Badge
    Chapter 47 Efficient Algorithms for the Ring Loading Problem with Demand Splitting
  49. Altmetric Badge
    Chapter 48 Seventeen Lines and One-Hundred-and-One Points
  50. Altmetric Badge
    Chapter 49 Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
  51. Altmetric Badge
    Chapter 50 Streaming Geometric Optimization Using Graphics Hardware
  52. Altmetric Badge
    Chapter 51 An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
  53. Altmetric Badge
    Chapter 52 Experiments on Graph Clustering Algorithms
  54. Altmetric Badge
    Chapter 53 More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling
  55. Altmetric Badge
    Chapter 54 The Minimum Shift Design Problem: Theory and Practice
  56. Altmetric Badge
    Chapter 55 Loglog Counting of Large Cardinalities
  57. Altmetric Badge
    Chapter 56 Packing a Trunk
  58. Altmetric Badge
    Chapter 57 Fast Smallest-Enclosing-Ball Computation in High Dimensions
  59. Altmetric Badge
    Chapter 58 Automated Generation of Search Tree Algorithms for Graph Modification Problems
  60. Altmetric Badge
    Chapter 59 Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
  61. Altmetric Badge
    Chapter 60 Fleet Assignment with Connection Dependent Ground Times
  62. Altmetric Badge
    Chapter 61 A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
  63. Altmetric Badge
    Chapter 62 The Fractional Prize-Collecting Steiner Tree Problem on Trees
  64. Altmetric Badge
    Chapter 63 Algorithms and Experiments for the Webgraph
  65. Altmetric Badge
    Chapter 64 Finding Short Integral Cycle Bases for Cyclic Timetabling
  66. Altmetric Badge
    Chapter 65 Slack Optimization of Timing-Critical Nets
  67. Altmetric Badge
    Chapter 66 Multisampling: A New Approach to Uniform Sampling and Approximate Counting
  68. Altmetric Badge
    Chapter 67 Multicommodity Flow Approximation Used for Exact Graph Partitioning
  69. Altmetric Badge
    Chapter 68 A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs
  70. Altmetric Badge
    Chapter 69 Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
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 (96th percentile)
  • High Attention Score compared to outputs of the same age and source (99th percentile)

Mentioned by

blogs
1 blog
patent
4 patents
wikipedia
9 Wikipedia pages

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
51 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 2003
Published by
ADS, January 2003
DOI 10.1007/b13632
ISBNs
978-3-54-020064-2, 978-3-54-039658-1
Editors

Giuseppe Di Battista, Uri Zwick

Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 21. 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 2024.
All research outputs
#1,843,732
of 25,837,817 outputs
Outputs from ADS
#780
of 26,744 outputs
Outputs of similar age
#3,628
of 140,128 outputs
Outputs of similar age from ADS
#3
of 648 outputs
Altmetric has tracked 25,837,817 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 92nd percentile: it's in the top 10% 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 96% 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 140,128 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 96% of its contemporaries.
We're also able to compare this research output to 648 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 99% of its contemporaries.