Algorithms and Data Structures

8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003. Proceedings

  • Frank Dehne
  • Jörg-Rüdiger Sack
  • Michiel Smid
Conference proceedings WADS 2003

DOI: 10.1007/b11837

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

Table of contents (44 papers)

  1. Front Matter
  2. Multi-party Pseudo-Telepathy
    Gilles Brassard, Anne Broadbent, Alain Tapp
    Pages 1-11
  3. Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips
    Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
    Pages 12-24
  4. Shape Segmentation and Matching with Flow Discretization
    Tamal K. Dey, Joachim Giesen, Samrat Goswami
    Pages 25-36
  5. Toward Optimal Motif Enumeration
    Patricia A. Evans, Andrew D. Smith
    Pages 47-58
  6. Common-Deadline Lazy Bureaucrat Scheduling Problems
    Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi
    Pages 59-66
  7. Bandwidth-Constrained Allocation in Grid Computing
    Anshul Kothari, Subhash Suri, Yunhong Zhou
    Pages 67-78
  8. Fast Algorithms for a Class of Temporal Range Queries
    Qingmin Shi, Joseph JaJa
    Pages 91-102
  9. Distribution-Sensitive Binomial Queues
    Amr Elmasry
    Pages 103-113
  10. Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees
    Gianni Franceschini, Roberto Grossi
    Pages 114-126
  11. Extremal Configurations and Levels in Pseudoline Arrangements
    Micha Sharir, Shakhar Smorodinsky
    Pages 127-139
  12. The One-Round Voronoi Game Replayed
    Sándor P. Fekete, Henk Meijer
    Pages 150-161
  13. Integrated Prefetching and Caching with Read and Write Requests
    Susanne Albers, Markus Büttner
    Pages 162-173
  14. Online Seat Reservations via Offline Seating Arrangements
    Jens S. Frederiksen, Kim S. Larsen
    Pages 174-185
  15. Routing and Call Control Algorithms for Ring Networks
    R. Sai Anand, Thomas Erlebach
    Pages 186-197
  16. Algorithms and Models for Railway Optimization
    Dorothea Wagner
    Pages 198-206
  17. Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles
    Matthias Müller-Hannemann, Sven Peyer
    Pages 207-218

About these proceedings


Scheduling Triangulation algorithm design algorithmics algorithms approximation calculus combinatorics complexity computational geometry computational graph theory discrete computational mathematics graph algorithms optimization sorting

Editors and affiliations

  • Frank Dehne
    • 1
  • Jörg-Rüdiger Sack
    • 2
  • Michiel Smid
    • 3
  1. 1.Carleton UniversityOttawaCanada
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada
  3. 3.School of Computer ScienceCarleton UniversityOttawaCanada

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-40545-0
  • Online ISBN 978-3-540-45078-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349