Book Volume 9294 2015

Algorithms - ESA 2015

23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings

Editors:

ISBN: 978-3-662-48349-7 (Print) 978-3-662-48350-3 (Online)

Table of contents (86 chapters)

previous Page of 5
  1. Front Matter

    Pages I-XXIII

  2. No Access

    Chapter

    Pages 1-12

    Improved Approximation Algorithms for Stochastic Matching

  3. No Access

    Chapter

    Pages 13-24

    Sorting and Permuting without Bank Conflicts on GPUs

  4. No Access

    Chapter

    Pages 25-34

    Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons

  5. No Access

    Chapter

    Pages 35-46

    Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems

  6. No Access

    Chapter

    Pages 47-58

    Buffer Management for Packets with Processing Times

  7. No Access

    Chapter

    Pages 59-70

    A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem

  8. No Access

    Chapter

    Pages 71-82

    Exact Minkowski Sums of Polygons With Holes

  9. No Access

    Chapter

    Pages 83-94

    λ > 4

  10. No Access

    Chapter

    Pages 95-105

    Revenue Maximization for Selling Multiple Correlated Items

  11. No Access

    Chapter

    Pages 106-117

    Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm

  12. No Access

    Chapter

    Pages 118-129

    Towards Tight Lower Bounds for Scheduling Problems

  13. No Access

    Chapter

    Pages 130-141

    1-Planar Graphs have Constant Book Thickness

  14. No Access

    Chapter

    Pages 142-154

    Access, Rank, and Select in Grammar-compressed Strings

  15. No Access

    Chapter

    Pages 155-166

    Fully-Dynamic Approximation of Betweenness Centrality

  16. No Access

    Chapter

    Pages 167-178

    Improved Purely Additive Fault-Tolerant Spanners

  17. No Access

    Chapter

    Pages 179-190

    Subexponential Time Algorithms for Finding Small Tree and Path Decompositions

  18. No Access

    Chapter

    Pages 191-202

    Enumeration of 2-Level Polytopes

  19. No Access

    Chapter

    Pages 203-214

    Upper and Lower Bounds for Online Routing on Delaunay Triangulations

  20. No Access

    Chapter

    Pages 215-226

    On Computing the Hyperbolicity of Real-World Graphs

  21. No Access

    Chapter

    Pages 227-238

    Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs

previous Page of 5