Skip to main content
Springer Nature Link
Log in

Algorithms and Data Structures

11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings

  • Conference proceedings
  • © 2009

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. Marina Gavrilova

    1. Department of Computer Science, University of Calgary, Calgary, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jörg-Rüdiger Sack

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Csaba D. Tóth

    1. University of Calgary, Calgary, 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 5664)

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

Included in the following conference series:

Conference proceedings info: WADS 2009.

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

Access this book

Log in via an institution
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

About this book

This book constitutes the refereed proceedings of the 11th Algorithms and Data Structures Symposium, WADS 2009, held in Banff, Canada, in August 2009.

The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 49 revised full papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.

Similar content being viewed by others

Keywords

Table of contents (49 papers)

  1. Front Matter

    Download chapter PDF

  2. On the Power of the Semi-Separated Pair Decomposition

    • Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel Smid
    Pages 1-12

  3. Plane Graphs with Parity Constraints

    • Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann et al.
    Pages 13-24

  4. Straight-Line Rectangular Drawings of Clustered Graphs

    • Patrizio Angelini, Fabrizio Frati, Michael Kaufmann
    Pages 25-36

  5. Online Priority Steiner Tree Problems

    • Spyros Angelopoulos
    Pages 37-48

  6. Connect the Dot: Computing Feed-Links with Minimum Dilation

    • Boris Aronov, Kevin Buchin, Maike Buchin, Marc van Kreveld, Maarten Löffler, Jun Luo et al.
    Pages 49-60

  7. Minimal Locked Trees

    • Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu et al.
    Pages 61-73

  8. Approximating Transitive Reductions for Directed Networks

    • Piotr Berman, Bhaskar DasGupta, Marek Karpinski
    Pages 74-85

  9. 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2

    • Piotr Berman, Marek Karpinski, Alexander Zelikovsky
    Pages 86-97

  10. Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

    • Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
    Pages 98-109

  11. A Distribution-Sensitive Dictionary with Low Space Overhead

    • Prosenjit Bose, John Howat, Pat Morin
    Pages 110-118

  12. A Comparison of Performance Measures for Online Algorithms

    • Joan Boyar, Sandy Irani, Kim S. Larsen
    Pages 119-130

  13. Delaunay Triangulation of Imprecise Points Simplified and Extended

    • Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer
    Pages 131-143

  14. An Improved SAT Algorithm in Terms of Formula Length

    • Jianer Chen, Yang Liu
    Pages 144-155

  15. Shortest Path Problems on a Polyhedral Surface

    • Atlas F. Cook IV, Carola Wenk
    Pages 156-167

  16. Approximation Algorithms for Buy-at-Bulk Geometric Network Design

    • Artur Czumaj, Jurek Czyzowicz, Leszek Gąsieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
    Pages 168-180

  17. Rank-Sensitive Priority Queues

    • Brian C. Dean, Zachary H. Jones
    Pages 181-192

  18. Algorithms Meet Art, Puzzles, and Magic

    • Erik D. Demaine
    Pages 193-193

  19. Skip-Splay: Toward Achieving the Unified Bound in the BST Model

    • Jonathan C. Derryberry, Daniel D. Sleator
    Pages 194-205

  20. Drawing Graphs with Right Angle Crossings

    • Walter Didimo, Peter Eades, Giuseppe Liotta
    Pages 206-217
Back to top

Editors and Affiliations

  • Carleton University, Ottawa, Canada

    Frank Dehne

  • Department of Computer Science, University of Calgary, Calgary, Canada

    Marina Gavrilova

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

    Jörg-Rüdiger Sack

  • University of Calgary, Calgary, Canada

    Csaba D. Tóth

Bibliographic Information

Publish with us

Policies and ethics

Back to top