Skip to main content
  • Conference proceedings
  • © 2006

Algorithms - ESA 2006

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4168)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ESA: European Symposium on Algorithms

Conference proceedings info: ESA 2006.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (73 papers)

  1. Front Matter

  2. Contributed Papers: Design and Analysis Track

    1. Kinetic Collision Detection for Convex Fat Objects

      • M. A. Abam, M. de Berg, S. -H. Poon, B. Speckmann
      Pages 4-15
    2. Dynamic Connectivity for Axis-Parallel Rectangles

      • Peyman Afshani, Timothy M. Chan
      Pages 16-27
    3. Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem

      • Christoph Ambühl, Monaldo Mastrolilli
      Pages 28-39
    4. Cooperative TSP

      • Amitai Armon, Adi Avidor, Oded Schwartz
      Pages 40-51
    5. Fréchet Distance for Curves, Revisited

      • Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
      Pages 52-63
    6. Resource Allocation in Bounded Degree Trees

      • Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
      Pages 64-75
    7. Dynamic Algorithms for Graph Spanners

      • Surender Baswana
      Pages 76-87
    8. Latency Constrained Aggregation in Sensor Networks

      • Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti
      Pages 88-99
    9. Competitive Analysis of Flash-Memory Algorithms

      • Avraham Ben-Aroya, Sivan Toledo
      Pages 100-111
    10. Contention Resolution with Heterogeneous Job Sizes

      • Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
      Pages 112-123
    11. Deciding Relaxed Two-Colorability—A Hardness Jump

      • Robert Berke, Tibor Szabó
      Pages 124-135
    12. Negative Examples for Sequential Importance Sampling of Binary Contingency Tables

      • Ivona Bezáková, Alistair Sinclair, Daniel Štefankovič, Eric Vigoda
      Pages 136-147
    13. Estimating Entropy over Data Streams

      • Lakshminath Bhuvanagiri, Sumit Ganguly
      Pages 148-159
    14. Necklaces, Convolutions, and X + Y

      • David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono et al.
      Pages 160-171
    15. Purely Functional Worst Case Constant Time Catenable Sorted Lists

      • Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
      Pages 172-183
    16. Taxes for Linear Atomic Congestion Games

      • Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
      Pages 184-195

Other Volumes

  1. Algorithms – ESA 2006

Editors and Affiliations

  • Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA and School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel

    Yossi Azar

  • Department of Computer Science, University of Leicester, Leicester, UK

    Thomas Erlebach

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access