↓ Skip to main content

Algorithms – ESA 2012

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On Big Data Algorithmics
  3. Altmetric Badge
    Chapter 2 Open Problems in Throughput Scheduling
  4. Altmetric Badge
    Chapter 3 Preemptive Coordination Mechanisms for Unrelated Machines
  5. Altmetric Badge
    Chapter 4 Hierarchical Hub Labelings for Shortest Paths
  6. Altmetric Badge
    Chapter 5 Bottleneck Non-crossing Matching in the Plane
  7. Altmetric Badge
    Chapter 6 Lower Bounds for Sorted Geometric Queries in the I/O Model
  8. Altmetric Badge
    Chapter 7 Constructing Street Networks from GPS Trajectories
  9. Altmetric Badge
    Chapter 8 I/O-efficient Hierarchical Diameter Approximation
  10. Altmetric Badge
    Chapter 9 On the Value of Job Migration in Online Makespan Minimization
  11. Altmetric Badge
    Chapter 10 Simplifying Massive Contour Maps
  12. Altmetric Badge
    Chapter 11 Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
  13. Altmetric Badge
    Chapter 12 On Online Labeling with Polynomially Many Labels
  14. Altmetric Badge
    Chapter 13 A 5-Approximation for Capacitated Facility Location
  15. Altmetric Badge
    Chapter 14 Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
  16. Altmetric Badge
    Chapter 15 A Bicriteria Approximation for the Reordering Buffer Problem
  17. Altmetric Badge
    Chapter 16 Time-Dependent Route Planning with Generalized Objective Functions
  18. Altmetric Badge
    Chapter 17 New Lower and Upper Bounds for Representing Sequences
  19. Altmetric Badge
    Chapter 18 Span Programs and Quantum Algorithms for st -Connectivity and Claw Detection
  20. Altmetric Badge
    Chapter 19 The Stretch Factor of L 1 - and L  ∞  -Delaunay Triangulations
  21. Altmetric Badge
    Chapter 20 Two Dimensional Range Minimum Queries and Fibonacci Lattices
  22. Altmetric Badge
    Chapter 21 Locally Correct Fréchet Matchings
  23. Altmetric Badge
    Chapter 22 The Clique Problem in Ray Intersection Graphs
  24. Altmetric Badge
    Chapter 23 Revenue Guarantees in Sponsored Search Auctions
  25. Altmetric Badge
    Chapter 24 Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite
  26. Altmetric Badge
    Chapter 25 Optimal Lower Bound for Differentially Private Multi-party Aggregation
  27. Altmetric Badge
    Chapter 26 A Model for Minimizing Active Processor Time
  28. Altmetric Badge
    Chapter 27 Algorithms – ESA 2012
  29. Altmetric Badge
    Chapter 28 Data Structures on Event Graphs
  30. Altmetric Badge
    Chapter 29 Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
  31. Altmetric Badge
    Chapter 30 The quantum query complexity of read-many formulas
  32. Altmetric Badge
    Chapter 31 A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
  33. Altmetric Badge
    Chapter 32 Steiner Forest Orientation Problems
  34. Altmetric Badge
    Chapter 33 A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems
  35. Altmetric Badge
    Chapter 34 Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes
  36. Altmetric Badge
    Chapter 35 Finding Social Optima in Congestion Games with Positive Externalities
  37. Altmetric Badge
    Chapter 36 Better Bounds for Graph Bisection
  38. Altmetric Badge
    Chapter 37 On the Complexity of Metric Dimension
  39. Altmetric Badge
    Chapter 38 Embedding Paths into Trees: VM Placement to Minimize Congestion
  40. Altmetric Badge
    Chapter 39 Faster Geometric Algorithms via Dynamic Determinant Computation
  41. Altmetric Badge
    Chapter 40 Lines through Segments in 3D Space
  42. Altmetric Badge
    Chapter 41 A Polynomial Kernel for Proper Interval Vertex Deletion
  43. Altmetric Badge
    Chapter 42 Knowledge, Level of Symmetry, and Time of Leader Election
  44. Altmetric Badge
    Chapter 43 An Experimental Study of Dynamic Dominators
  45. Altmetric Badge
    Chapter 44 Optimizing over the Growing Spectrahedron
  46. Altmetric Badge
    Chapter 45 Induced Disjoint Paths in Claw-Free Graphs
  47. Altmetric Badge
    Chapter 46 On Min-Power Steiner Tree
  48. Altmetric Badge
    Chapter 47 Maximum Multicommodity Flows over Time without Intermediate Storage
  49. Altmetric Badge
    Chapter 48 Approximating Earliest Arrival Flows in Arbitrary Networks
  50. Altmetric Badge
    Chapter 49 Resource Buying Games
  51. Altmetric Badge
    Chapter 50 Succinct Data Structures for Path Queries
  52. Altmetric Badge
    Chapter 51 Approximation of Minimum Cost Homomorphisms
  53. Altmetric Badge
    Chapter 52 Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness
  54. Altmetric Badge
    Chapter 53 Improved Implementation of Point Location in General Two-Dimensional Subdivisions
  55. Altmetric Badge
    Chapter 54 Parameterized Complexity of Induced H -Matching on Claw-Free Graphs
  56. Altmetric Badge
    Chapter 55 Solving Simple Stochastic Games with Few Coin Toss Positions
  57. Altmetric Badge
    Chapter 56 Efficient Communication Protocols for Deciding Edit Distance
  58. Altmetric Badge
    Chapter 57 Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
  59. Altmetric Badge
    Chapter 58 Extending Partial Representations of Function Graphs and Permutation Graphs
  60. Altmetric Badge
    Chapter 59 A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
  61. Altmetric Badge
    Chapter 60 Minimum Average Distance Triangulations
  62. Altmetric Badge
    Chapter 61 Colouring AT-Free Graphs
  63. Altmetric Badge
    Chapter 62 Routing Regardless of Network Stability
  64. Altmetric Badge
    Chapter 63 The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
  65. Altmetric Badge
    Chapter 64 Succinct Posets
  66. Altmetric Badge
    Chapter 65 Polynomial-Time Approximation Schemes for Shortest Path with Alternatives
  67. Altmetric Badge
    Chapter 66 On Computing Straight Skeletons by Means of Kinetic Triangulations
  68. Altmetric Badge
    Chapter 67 A Self-adjusting Data Structure for Multidimensional Point Sets
  69. Altmetric Badge
    Chapter 68 TSP Tours in Cubic Graphs: Beyond 4/3
  70. Altmetric Badge
    Chapter 69 FPT Algorithms for Domination in Biclique-Free Graphs
  71. Altmetric Badge
    Chapter 70 Maximum Flow Networks for Stability Analysis of LEGO ® Structures
  72. Altmetric Badge
    Chapter 71 Average Case Analysis of Java 7's Dual Pivot Quicksort
  73. Altmetric Badge
    Chapter 71 Average Case Analysis of Java 7’s Dual Pivot Quicksort
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
5 tweeters
patent
1 patent
wikipedia
1 Wikipedia page

Readers on

mendeley
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.
Title
Algorithms – ESA 2012
Published by
Springer, Berlin, Heidelberg, January 2012
DOI 10.1007/978-3-642-33090-2
ISBNs
978-3-64-233089-6, 978-3-64-233090-2
Editors

Leah Epstein, Paolo Ferragina

Twitter Demographics

The data shown below were collected from the profiles of 5 tweeters 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 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 %
Student > Bachelor 1 100%
Student > Postgraduate 1 100%
Student > Doctoral Student 1 100%
Readers by discipline Count As %
Computer Science 3 300%