Algorithms and Data Structures

12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings

  • Frank Dehne
  • John Iacono
  • Jörg-Rüdiger Sack
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6844)

Table of contents

  1. Front Matter
  2. Mohammad Ali Abam, Mark de Berg, Amirali Khosravi
    Pages 1-12
  3. Abhijin Adiga, Jasine Babu, L. Sunil Chandran
    Pages 13-24
  4. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella
    Pages 25-36
  5. Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou
    Pages 37-48
  6. Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf et al.
    Pages 49-60
  7. Boris Aronov, Muriel Dulieu
    Pages 61-72
  8. Boris Aronov, Muriel Dulieu, Ferran Hurtado
    Pages 73-85
  9. Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young
    Pages 86-97
  10. Therese Biedl, Lesvia Elena Ruiz Velázquez
    Pages 98-109
  11. Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao
    Pages 110-121
  12. Paul Bonsma, Daniel Lokshtanov
    Pages 122-133
  13. Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Flatland, Matthew J. Katz, Anil Maheshwari
    Pages 134-146
  14. Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph (Seffi) Naor
    Pages 147-158
  15. Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira
    Pages 159-170
  16. Gruia Calinescu, Minming Li
    Pages 171-182
  17. Erin Wolf Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan et al.
    Pages 183-194
  18. Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang
    Pages 219-230

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 12th Algorithms and Data Structures Symposium, WADS 2011, held in New York, NY, USA, in August 2011.
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 59 revised full papers presented in this volume were carefully reviewed and selected from 141 submissions. The papers present original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing.

Keywords

DNA synthesis approximation algorithms knapsack problem randomized algorithm wireless networks

Editors and affiliations

  • Frank Dehne
    • 1
  • John Iacono
    • 2
  • Jörg-Rüdiger Sack
    • 3
  1. 1.School of Computer Science, Parallel Computing and Bioinformatics LaboratoryCarleton UniversityOttawaCanada
  2. 2.Department of Computer Science and EngineeringPolytechnic Institute of New York UniversityNew YorkUSA
  3. 3.School of Computer Science, Herzberg LaboratoriesCarleton UniversityOttawaCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-22300-6
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-22299-3
  • Online ISBN 978-3-642-22300-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349