Algorithms - ESA 2008

16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings

Editors:

ISBN: 978-3-540-87743-1 (Print) 978-3-540-87744-8 (Online)

Table of contents (69 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-12

      Flexible Path Planning Using Corridor Maps

    2. No Access

      Book Chapter

      Pages 13-28

      A Bridging Model for Multi-core Computing

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 29-40

      Robust Kinetic Convex Hulls in 3D

    2. No Access

      Book Chapter

      Pages 41-51

      On Dominance Reporting in 3D

    3. No Access

      Book Chapter

      Pages 52-63

      Stabbing Convex Polygons with a Segment or a Polygon

    4. No Access

      Book Chapter

      Pages 64-75

      An Efficient Algorithm for 2D Euclidean 2-Center with Outliers

    5. No Access

      Book Chapter

      Pages 76-87

      A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry

    6. No Access

      Book Chapter

      Pages 88-99

      Cache-Oblivious Red-Blue Line Segment Intersection

    7. No Access

      Book Chapter

      Pages 100-111

      The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains

    8. No Access

      Book Chapter

      Pages 112-123

      Space-Time Tradeoffs for Proximity Searching in Doubling Spaces

    9. No Access

      Book Chapter

      Pages 124-135

      A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem

    10. No Access

      Book Chapter

      Pages 136-147

      Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

    11. No Access

      Book Chapter

      Pages 148-160

      Straight Skeletons of Three-Dimensional Polyhedra

    12. No Access

      Book Chapter

      Pages 161-172

      Randomized Competitive Analysis for Two-Server Problems

    13. No Access

      Book Chapter

      Pages 173-184

      Decompositions and Boundary Coverings of Non-convex Fat Polyhedra

    14. No Access

      Book Chapter

      Pages 185-197

      Approximating Multi-criteria Max-TSP

    15. No Access

      Book Chapter

      Pages 198-209

      An Integer Programming Algorithm for Routing Optimization in IP Networks

    16. No Access

      Book Chapter

      Pages 210-221

      A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

    17. No Access

      Book Chapter

      Pages 222-233

      Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree

    18. No Access

      Book Chapter

      Pages 234-245

      Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors

previous Page of 4