Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2011

Algorithms and Data Structures

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

Editors:

  1. Frank Dehne

    1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. John Iacono

    1. Department of Computer Science and Engineering, Polytechnic Institute of New York University, New York, USA

    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, Herzberg Laboratories, Carleton University, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

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

Conference series link(s): WADS: Algorithms and Data Structures Symposium

Conference proceedings info: WADS 2011.

Sections

Buy it now

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

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

Table of contents (61 papers)

  1. Front Matter

    PDF

  2. Piecewise-Linear Approximations of Uncertain Functions

    • Mohammad Ali Abam, Mark de Berg, Amirali Khosravi
    Pages 1-12

  3. A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs

    • Abhijin Adiga, Jasine Babu, L. Sunil Chandran
    Pages 13-24

  4. On the Area Requirements of Euclidean Minimum Spanning Trees

    • Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella
    Pages 25-36

  5. Multi-target Ray Searching Problems

    • Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou
    Pages 37-48

  6. Convex Transversals

    • Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf et al.
    Pages 49-60

  7. How to Cover a Point Set with a V-Shape of Minimum Width

    • Boris Aronov, Muriel Dulieu
    Pages 61-72

  8. Witness Rectangle Graphs

    • Boris Aronov, Muriel Dulieu, Ferran Hurtado
    Pages 73-85

  9. Faster Optimal Algorithms for Segment Minimization with Small Maximal Value

    • Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young
    Pages 86-97

  10. Orthogonal Cartograms with Few Corners Per Face

    • Therese Biedl, Lesvia Elena Ruiz Velázquez
    Pages 98-109

  11. Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals

    • Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao
    Pages 110-121

  12. Feedback Vertex Set in Mixed Graphs

    • Paul Bonsma, Daniel Lokshtanov
    Pages 122-133

  13. Switching to Directional Antennas with Constant Increase in Radius and Hop Distance

    • Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Flatland, Matthew J. Katz, Anil Maheshwari
    Pages 134-146

  14. Frequency Capping in Online Advertising

    • Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph (Seffi) Naor
    Pages 147-158

  15. Adjacency-Preserving Spatial Treemaps

    • Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira
    Pages 159-170

  16. Register Loading via Linear Programming

    • Gruia Calinescu, Minming Li
    Pages 171-182

  17. Connecting a Set of Circles with Minimum Sum of Radii

    • Erin Wolf Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan et al.
    Pages 183-194

  20. Multicut in Trees Viewed through the Eyes of Vertex Cover

    • Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang
    Pages 219-230
Back to top

Other Volumes

  1. Algorithms and Data Structures

Back to top

About this book

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.
Back to top

Keywords

Back to top

Editors and Affiliations

  • School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, Ottawa, Canada

    Frank Dehne

  • Department of Computer Science and Engineering, Polytechnic Institute of New York University, New York, USA

    John Iacono

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

    Jörg-Rüdiger Sack

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation