↓ Skip to main content

Algorithms – ESA 2013

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Online Replacement Path Problem
  3. Altmetric Badge
    Chapter 2 Flip Distance between Triangulations of a Simple Polygon is NP-Complete
  4. Altmetric Badge
    Chapter 3 Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
  5. Altmetric Badge
    Chapter 4 Computing the Greedy Spanner in Linear Space
  6. Altmetric Badge
    Chapter 5 Friendship and Stable Matching
  7. Altmetric Badge
    Chapter 6 An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
  8. Altmetric Badge
    Chapter 7 Logit Dynamics with Concurrent Updates for Local Interaction Games
  9. Altmetric Badge
    Chapter 8 On Resilient Graph Spanners
  10. Altmetric Badge
    Chapter 9 Maximizing Barrier Coverage Lifetime with Mobile Sensors
  11. Altmetric Badge
    Chapter 10 Theory and Implementation of Online Multiselection Algorithms
  12. Altmetric Badge
    Chapter 11 An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering
  13. Altmetric Badge
    Chapter 12 Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
  14. Altmetric Badge
    Chapter 13 Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
  15. Altmetric Badge
    Chapter 14 A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
  16. Altmetric Badge
    Chapter 15 Parallel String Sample Sort
  17. Altmetric Badge
    Chapter 16 Exclusive Graph Searching
  18. Altmetric Badge
    Chapter 17 Largest Chordal and Interval Subgraphs Faster Than 2 n
  19. Altmetric Badge
    Chapter 18 Revisiting the Problem of Searching on a Line
  20. Altmetric Badge
    Chapter 19 On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
  21. Altmetric Badge
    Chapter 20 The Encoding Complexity of Two Dimensional Range Minimum Data Structures
  22. Altmetric Badge
    Chapter 21 Computing the Fréchet Distance with a Retractable Leash
  23. Altmetric Badge
    Chapter 22 Vertex Deletion for 3D Delaunay Triangulations
  24. Altmetric Badge
    Chapter 23 Economic 3-Colored Subdivision of Triangulations
  25. Altmetric Badge
    Chapter 24 Limitations of Deterministic Auction Design for Correlated Bidders
  26. Altmetric Badge
    Chapter 25 Connectivity Inference in Mass Spectrometry Based Structure Determination
  27. Altmetric Badge
    Chapter 26 Secluded Connectivity Problems
  28. Altmetric Badge
    Chapter 27 List H-Coloring a Graph by Removing Few Vertices
  29. Altmetric Badge
    Chapter 28 Rumor Spreading in Random Evolving Graphs
  30. Altmetric Badge
    Chapter 29 Dynamic Graphs in the Sliding-Window Model
  31. Altmetric Badge
    Chapter 30 A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
  32. Altmetric Badge
    Chapter 31 Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
  33. Altmetric Badge
    Chapter 32 Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap
  34. Altmetric Badge
    Chapter 33 Inefficiency of Standard Multi-unit Auctions
  35. Altmetric Badge
    Chapter 34 FPTAS for Minimizing Earth Mover’s Distance under Rigid Transformations
  36. Altmetric Badge
    Chapter 35 Maximizing a Submodular Function with Viability Constraints
  37. Altmetric Badge
    Chapter 36 Table Cartograms
  38. Altmetric Badge
    Chapter 37 Network Bargaining with General Capacities
  39. Altmetric Badge
    Chapter 38 Nearly Optimal Private Convolution
  40. Altmetric Badge
    Chapter 39 Algorithms – ESA 2013
  41. Altmetric Badge
    Chapter 40 Compressed Cache-Oblivious String B-tree
  42. Altmetric Badge
    Chapter 41 BICO: BIRCH Meets Coresets for k -Means Clustering
  43. Altmetric Badge
    Chapter 42 Long Circuits and Large Euler Subgraphs
  44. Altmetric Badge
    Chapter 43 Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
  45. Altmetric Badge
    Chapter 44 Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
  46. Altmetric Badge
    Chapter 45 Kernelization Using Structural Parameters on Sparse Graph Classes
  47. Altmetric Badge
    Chapter 46 On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ 3
  48. Altmetric Badge
    Chapter 47 Encodings for Range Selection and Top-k Queries
  49. Altmetric Badge
    Chapter 48 Fréchet Queries in Geometric Trees
  50. Altmetric Badge
    Chapter 49 A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
  51. Altmetric Badge
    Chapter 50 An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
  52. Altmetric Badge
    Chapter 51 Balls into Bins Made Faster
  53. Altmetric Badge
    Chapter 52 An Alternative Approach to Alternative Routes: HiDAR
  54. Altmetric Badge
    Chapter 53 Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
  55. Altmetric Badge
    Chapter 54 Better Approximation Algorithms for Technology Diffusion
  56. Altmetric Badge
    Chapter 55 On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
  57. Altmetric Badge
    Chapter 56 Balanced Neighbor Selection for BitTorrent-Like Networks
  58. Altmetric Badge
    Chapter 57 Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
  59. Altmetric Badge
    Chapter 58 Improved Approximation Algorithms for Projection Games
  60. Altmetric Badge
    Chapter 59 The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  61. Altmetric Badge
    Chapter 60 Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
  62. Altmetric Badge
    Chapter 61 The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
  63. Altmetric Badge
    Chapter 62 Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets
  64. Altmetric Badge
    Chapter 63 Optimal Color Range Reporting in One Dimension
  65. Altmetric Badge
    Chapter 64 Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
  66. Altmetric Badge
    Chapter 65 Euclidean Greedy Drawings of Trees
  67. Altmetric Badge
    Chapter 66 Sparse Fault-Tolerant BFS Trees
  68. Altmetric Badge
    Chapter 67 On the Most Likely Convex Hull of Uncertain Points
  69. Altmetric Badge
    Chapter 68 Top- k Document Retrieval in External Memory
  70. Altmetric Badge
    Chapter 69 Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
7 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 2013
Published by
Springer Berlin Heidelberg, August 2013
DOI 10.1007/978-3-642-40450-4
ISBNs
978-3-64-240449-8, 978-3-64-240450-4
Editors

Bodlaender, Hans L., Italiano, Giuseppe F.

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 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 29%
Student > Master 2 29%
Researcher 1 14%
Unknown 2 29%
Readers by discipline Count As %
Engineering 3 43%
Computer Science 1 14%
Business, Management and Accounting 1 14%
Unknown 2 29%