Algorithms – ESA 2006

14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings

Editors:

ISBN: 978-3-540-38875-3 (Print) 978-3-540-38876-0 (Online)

Table of contents (73 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-1

      Origami, Linkages, and Polyhedra: Folding with Algorithms

    2. No Access

      Book Chapter

      Pages 2-2

      Reliable and Efficient Geometric Computing

    3. No Access

      Book Chapter

      Pages 3-3

      Some Computational Challenges in Today’s Bio-medicine

  3. Contributed Papers: Design and Analysis Track

    1. No Access

      Book Chapter

      Pages 4-15

      Kinetic Collision Detection for Convex Fat Objects

    2. No Access

      Book Chapter

      Pages 16-27

      Dynamic Connectivity for Axis-Parallel Rectangles

    3. No Access

      Book Chapter

      Pages 28-39

      Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem

    4. No Access

      Book Chapter

      Pages 40-51

      Cooperative TSP

    5. No Access

      Book Chapter

      Pages 52-63

      Fréchet Distance for Curves, Revisited

    6. No Access

      Book Chapter

      Pages 64-75

      Resource Allocation in Bounded Degree Trees

    7. No Access

      Book Chapter

      Pages 76-87

      Dynamic Algorithms for Graph Spanners

    8. No Access

      Book Chapter

      Pages 88-99

      Latency Constrained Aggregation in Sensor Networks

    9. No Access

      Book Chapter

      Pages 100-111

      Competitive Analysis of Flash-Memory Algorithms

    10. No Access

      Book Chapter

      Pages 112-123

      Contention Resolution with Heterogeneous Job Sizes

    11. No Access

      Book Chapter

      Pages 124-135

      Deciding Relaxed Two-Colorability—A Hardness Jump

    12. No Access

      Book Chapter

      Pages 136-147

      Negative Examples for Sequential Importance Sampling of Binary Contingency Tables

    13. No Access

      Book Chapter

      Pages 148-159

      Estimating Entropy over Data Streams

    14. No Access

      Book Chapter

      Pages 160-171

      Necklaces, Convolutions, and X + Y

    15. No Access

      Book Chapter

      Pages 172-183

      Purely Functional Worst Case Constant Time Catenable Sorted Lists

    16. No Access

      Book Chapter

      Pages 184-195

      Taxes for Linear Atomic Congestion Games

    17. No Access

      Book Chapter

      Pages 196-207

      Spanners with Slack

previous Page of 4