Algorithms and Data Structures

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

  • Frank Dehne
  • Marina Gavrilova
  • Jörg-Rüdiger Sack
  • Csaba D. Tóth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5664)

Table of contents

  1. Front Matter
  2. Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel Smid
    Pages 1-12
  3. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann et al.
    Pages 13-24
  4. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann
    Pages 25-36
  5. Spyros Angelopoulos
    Pages 37-48
  6. Boris Aronov, Kevin Buchin, Maike Buchin, Marc van Kreveld, Maarten Löffler, Jun Luo et al.
    Pages 49-60
  7. Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu et al.
    Pages 61-73
  8. Piotr Berman, Bhaskar DasGupta, Marek Karpinski
    Pages 74-85
  9. Piotr Berman, Marek Karpinski, Alexander Zelikovsky
    Pages 86-97
  10. Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
    Pages 98-109
  11. Prosenjit Bose, John Howat, Pat Morin
    Pages 110-118
  12. Joan Boyar, Sandy Irani, Kim S. Larsen
    Pages 119-130
  13. Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer
    Pages 131-143
  14. Jianer Chen, Yang Liu
    Pages 144-155
  15. Atlas F. Cook IV, Carola Wenk
    Pages 156-167
  16. Artur Czumaj, Jurek Czyzowicz, Leszek Gąsieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
    Pages 168-180
  17. Brian C. Dean, Zachary H. Jones
    Pages 181-192
  18. Erik D. Demaine
    Pages 193-193
  19. Jonathan C. Derryberry, Daniel D. Sleator
    Pages 194-205
  20. Walter Didimo, Peter Eades, Giuseppe Liotta
    Pages 206-217

About these proceedings

Introduction

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.

Keywords

algorithmics algorithms approximation art gallery problem combinatorial optimization complexity computational geometry computational graph theory data streams data structures dynamic data structures dynamic programming graph algorithms heuristics metric embe

Editors and affiliations

  • Frank Dehne
    • 1
  • Marina Gavrilova
    • 2
  • Jörg-Rüdiger Sack
    • 3
  • Csaba D. Tóth
    • 4
  1. 1.Carleton UniversityOttawaCanada
  2. 2.Department of Computer ScienceUniversity of CalgaryCalgaryCanada
  3. 3.School of Computer ScienceCarleton UniversityOntarioCanada
  4. 4.University of CalgaryCalgaryCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-03367-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-03366-7
  • Online ISBN 978-3-642-03367-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349