↓ Skip to main content

Algorithms - ESA 2015

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Improved Approximation Algorithms for Stochastic Matching
  3. Altmetric Badge
    Chapter 2 Sorting and Permuting without Bank Conflicts on GPUs
  4. Altmetric Badge
    Chapter 3 Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
  5. Altmetric Badge
    Chapter 4 Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems
  6. Altmetric Badge
    Chapter 5 Buffer Management for Packets with Processing Times
  7. Altmetric Badge
    Chapter 6 A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem
  8. Altmetric Badge
    Chapter 7 Exact Minkowski Sums of Polygons With Holes
  9. Altmetric Badge
    Chapter 8 λ > 4
  10. Altmetric Badge
    Chapter 9 Revenue Maximization for Selling Multiple Correlated Items
  11. Altmetric Badge
    Chapter 10 Algorithms - ESA 2015
  12. Altmetric Badge
    Chapter 11 Towards Tight Lower Bounds for Scheduling Problems
  13. Altmetric Badge
    Chapter 12 1-Planar Graphs have Constant Book Thickness
  14. Altmetric Badge
    Chapter 13 Access, Rank, and Select in Grammar-compressed Strings
  15. Altmetric Badge
    Chapter 14 Fully-Dynamic Approximation of Betweenness Centrality
  16. Altmetric Badge
    Chapter 15 Improved Purely Additive Fault-Tolerant Spanners
  17. Altmetric Badge
    Chapter 16 Subexponential Time Algorithms for Finding Small Tree and Path Decompositions
  18. Altmetric Badge
    Chapter 17 Enumeration of 2-Level Polytopes
  19. Altmetric Badge
    Chapter 18 Upper and Lower Bounds for Online Routing on Delaunay Triangulations
  20. Altmetric Badge
    Chapter 19 On Computing the Hyperbolicity of Real-World Graphs
  21. Altmetric Badge
    Chapter 20 Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
  22. Altmetric Badge
    Chapter 21 Consensus Patterns (Probably) Has no EPTAS
  23. Altmetric Badge
    Chapter 22 Fast Quasi-Threshold Editing
  24. Altmetric Badge
    Chapter 23 Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
  25. Altmetric Badge
    Chapter 24 An Improved Approximation Algorithm for Knapsack Median Using Sparsification
  26. Altmetric Badge
    Chapter 25 Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
  27. Altmetric Badge
    Chapter 26 Self-Adjusting Binary Search Trees: What Makes Them Tick?
  28. Altmetric Badge
    Chapter 27 On Element-Connectivity Preserving Graph Simplification
  29. Altmetric Badge
    Chapter 28 On Randomized Algorithms for Matching in the Online Preemptive Model
  30. Altmetric Badge
    Chapter 29 A Characterization of Consistent Digital Line Segments in ℤ2
  31. Altmetric Badge
    Chapter 30 On the Efficiency of All-Pay Mechanisms
  32. Altmetric Badge
    Chapter 31 Dictionary Matching in a Stream
  33. Altmetric Badge
    Chapter 32 Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
  34. Altmetric Badge
    Chapter 33 A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface
  35. Altmetric Badge
    Chapter 34 Explicit Expanding Expanders
  36. Altmetric Badge
    Chapter 35 On the Threshold of Intractability
  37. Altmetric Badge
    Chapter 36 A Polynomial Kernel for Trivially Perfect Editing
  38. Altmetric Badge
    Chapter 37 Polymatroid Prophet Inequalities
  39. Altmetric Badge
    Chapter 38 Node-Balancing by Edge-Increments
  40. Altmetric Badge
    Chapter 39 The Price of Matching with Metric Preferences
  41. Altmetric Badge
    Chapter 40 Selfish Vector Packing
  42. Altmetric Badge
    Chapter 41 Approximate Deadline-Scheduling with Precedence Constraints
  43. Altmetric Badge
    Chapter 42 Prophet Secretary
  44. Altmetric Badge
    Chapter 43 Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem
  45. Altmetric Badge
    Chapter 44 Maximizing Symmetric Submodular Functions
  46. Altmetric Badge
    Chapter 45 Approximating LZ77 via Small-Space Multiple-Pattern Matching
  47. Altmetric Badge
    Chapter 46 Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
  48. Altmetric Badge
    Chapter 47 Medial Axis Based Routing Has Constant Load Balancing Factor
  49. Altmetric Badge
    Chapter 48 An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
  50. Altmetric Badge
    Chapter 49 Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
  51. Altmetric Badge
    Chapter 50 A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations
  52. Altmetric Badge
    Chapter 51 A Characterization of Visibility Graphs for Pseudo-polygons
  53. Altmetric Badge
    Chapter 52 Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
  54. Altmetric Badge
    Chapter 53 The Temp Secretary Problem
  55. Altmetric Badge
    Chapter 54 How to Sort by Walking on a Tree
  56. Altmetric Badge
    Chapter 55 Improved Analysis of Complete-Linkage Clustering
  57. Altmetric Badge
    Chapter 56 Structural Parameterizations of the Mixed Chinese Postman Problem
  58. Altmetric Badge
    Chapter 57 Online Appointment Scheduling in the Random Order Model
  59. Altmetric Badge
    Chapter 58 Approximation Algorithms for Connected Maximum Cut and Related Problems
  60. Altmetric Badge
    Chapter 59 The Offset Filtration of Convex Objects
  61. Altmetric Badge
    Chapter 60 Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
  62. Altmetric Badge
    Chapter 61 Monotone Drawings of 3-Connected Plane Graphs
  63. Altmetric Badge
    Chapter 62 Faster Fully-Dynamic Minimum Spanning Forest
  64. Altmetric Badge
    Chapter 63 On the Equivalence among Problems of Bounded Width
  65. Altmetric Badge
    Chapter 64 Fast Output-Sensitive Matrix Multiplication
  66. Altmetric Badge
    Chapter 65 A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
  67. Altmetric Badge
    Chapter 66 On the Approximability of Digraph Ordering
  68. Altmetric Badge
    Chapter 67 Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems
  69. Altmetric Badge
    Chapter 68 On the Pathwidth of Almost Semicomplete Digraphs
  70. Altmetric Badge
    Chapter 69 Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence
  71. Altmetric Badge
    Chapter 70 Maximum Matching in Turnstile Streams
  72. Altmetric Badge
    Chapter 71 A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem
  73. Altmetric Badge
    Chapter 72 Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
  74. Altmetric Badge
    Chapter 73 Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
  75. Altmetric Badge
    Chapter 74 Compressed Data Structures for Dynamic Sequences
  76. Altmetric Badge
    Chapter 75 Geometric Hitting Sets for Disks: Theory and Practice
  77. Altmetric Badge
    Chapter 76 Efficient Computation of Middle Levels Gray Codes
  78. Altmetric Badge
    Chapter 77 Computing the Similarity Between Moving Curves
  79. Altmetric Badge
    Chapter 78 I/O-Efficient Similarity Join
  80. Altmetric Badge
    Chapter 79 Improved Approximation Algorithms for Weighted 2-Path Partitions
  81. Altmetric Badge
    Chapter 80 A Multivariate Approach for Weighted FPT Algorithms
  82. Altmetric Badge
    Chapter 81 Incidences with Curves in ℝ d
  83. Altmetric Badge
    Chapter 82 D 3-Tree: A Dynamic Deterministic Decentralized Structure
  84. Altmetric Badge
    Chapter 83 Ignorant vs. Anonymous Recommendations
  85. Altmetric Badge
    Chapter 84 Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
  86. Altmetric Badge
    Chapter 85 Trip-Based Public Transit Routing
  87. Altmetric Badge
    Chapter 86 Mixing Color Coding-Related Techniques
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

patent
3 patents
wikipedia
12 Wikipedia pages

Readers on

mendeley
15 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 2015
Published by
Springer, Berlin, Heidelberg, January 2015
DOI 10.1007/978-3-662-48350-3
ISBNs
978-3-66-248349-7, 978-3-66-248350-3
Editors

Nikhil Bansal, Irene Finocchi

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United Kingdom 1 7%
Unknown 14 93%

Demographic breakdown

Readers by professional status Count As %
Professor 1 7%
Student > Master 1 7%
Unknown 13 87%
Readers by discipline Count As %
Engineering 1 7%
Unknown 14 93%