Book Volume 8125 2013

Algorithms – ESA 2013

21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings


ISBN: 978-3-642-40449-8 (Print) 978-3-642-40450-4 (Online)

Table of contents (69 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-12

    The Online Replacement Path Problem

  3. Chapter

    Pages 13-24

    Flip Distance between Triangulations of a Simple Polygon is NP-Complete

  4. Chapter

    Pages 25-36

    Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures

  5. Chapter

    Pages 37-48

    Computing the Greedy Spanner in Linear Space

  6. Chapter

    Pages 49-60

    Friendship and Stable Matching

  7. Chapter

    Pages 61-72

    An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters

  8. Chapter

    Pages 73-84

    Logit Dynamics with Concurrent Updates for Local Interaction Games

  9. Chapter

    Pages 85-96

    On Resilient Graph Spanners

  10. Chapter

    Pages 97-108

    Maximizing Barrier Coverage Lifetime with Mobile Sensors

  11. Chapter

    Pages 109-120

    Theory and Implementation of Online Multiselection Algorithms

  12. Chapter

    Pages 121-132

    An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering

  13. Chapter

    Pages 133-144

    Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform

  14. Chapter

    Pages 145-156

    Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

  15. Chapter

    Pages 157-168

    A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree

  16. Chapter

    Pages 169-180

    Parallel String Sample Sort

  17. Chapter

    Pages 181-192

    Exclusive Graph Searching

  18. Chapter

    Pages 193-204

    Largest Chordal and Interval Subgraphs Faster Than 2 n

  19. Chapter

    Pages 205-216

    Revisiting the Problem of Searching on a Line

  20. Chapter

    Pages 217-228

    On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity

  21. Chapter

    Pages 229-240

    The Encoding Complexity of Two Dimensional Range Minimum Data Structures

previous Page of 4