Skip to main content
SpringerLink
Log in

Algorithms and Data Structures

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

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Frank Dehne

    1. Carleton University, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jörg-Rüdiger Sack

    1. School of Computer Science, Carleton University, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Michiel Smid

    1. School of Computer Science, Carleton University, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: WADS 2003.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (44 papers)

  1. Front Matter

    Download chapter PDF

  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. Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content

    • Jijun Tang, Bernard M. E. Moret
    Pages 37-46

  6. Toward Optimal Motif Enumeration

    • Patricia A. Evans, Andrew D. Smith
    Pages 47-58

  7. Common-Deadline Lazy Bureaucrat Scheduling Problems

    • Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi
    Pages 59-66

  8. Bandwidth-Constrained Allocation in Grid Computing

    • Anshul Kothari, Subhash Suri, Yunhong Zhou
    Pages 67-78

  9. Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection

    • Sudipta Sengupta
    Pages 79-90

  10. Fast Algorithms for a Class of Temporal Range Queries

    • Qingmin Shi, Joseph JaJa
    Pages 91-102

  11. Distribution-Sensitive Binomial Queues

    • Amr Elmasry
    Pages 103-113

  12. Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees

    • Gianni Franceschini, Roberto Grossi
    Pages 114-126

  13. Extremal Configurations and Levels in Pseudoline Arrangements

    • Micha Sharir, Shakhar Smorodinsky
    Pages 127-139

  14. Fast Relative Approximation of Potential Fields

    • Martin Ziegler
    Pages 140-149

  15. The One-Round Voronoi Game Replayed

    • Sándor P. Fekete, Henk Meijer
    Pages 150-161

  16. Integrated Prefetching and Caching with Read and Write Requests

    • Susanne Albers, Markus Büttner
    Pages 162-173

  17. Online Seat Reservations via Offline Seating Arrangements

    • Jens S. Frederiksen, Kim S. Larsen
    Pages 174-185

  18. Routing and Call Control Algorithms for Ring Networks

    • R. Sai Anand, Thomas Erlebach
    Pages 186-197

  19. Algorithms and Models for Railway Optimization

    • Dorothea Wagner
    Pages 198-206

  20. Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles

    • Matthias Müller-Hannemann, Sven Peyer
    Pages 207-218
Back to top

Other volumes

  1. Algorithms and Data Structures

Keywords

Editors and Affiliations

  • Carleton University, Ottawa, Canada

    Frank Dehne

  • School of Computer Science, Carleton University, Ottawa, Canada

    Jörg-Rüdiger Sack, Michiel Smid

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation