Skip to main content
SpringerLink
Log in

Algorithms and Data Structures

13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings

  • Conference proceedings
  • © 2013

Overview

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. Roberto Solis-Oba

    1. Department of Computer Science, The University of Western Ontario, London, 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, 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 8037)

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

Included in the following conference series:

Conference proceedings info: WADS 2013.

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 (46 papers)

  1. Front Matter

    Download chapter PDF

  2. On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects

    • Mahmuda Ahmed, Iffat Chowdhury, Matt Gibson, Mohammad Shahedul Islam, Jessica Sherrette
    Pages 1-12

  3. Bundling Three Convex Polygons to Minimize Area or Perimeter

    • Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park
    Pages 13-24

  4. Smart-Grid Electricity Allocation via Strip Packing with Slicing

    • Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav et al.
    Pages 25-36

  5. On (Dynamic) Range Minimum Queries in External Memory

    • Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava
    Pages 37-48

  6. Distance-Sensitive Planar Point Location

    • Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
    Pages 49-60

  7. Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems

    • Tetsuo Asano, David Kirkpatrick
    Pages 61-72

  8. Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles

    • Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann et al.
    Pages 73-84

  9. Socially Stable Matchings in the Hospitals/Residents Problem

    • Georgios Askalidis, Nicole Immorlica, Augustine Kwanashie, David F. Manlove, Emmanouil Pountourakis
    Pages 85-96

  10. Parameterized Complexity of 1-Planarity

    • Michael J. Bannister, Sergio Cabello, David Eppstein
    Pages 97-108

  11. On the Stretch Factor of the Theta-4 Graph

    • Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot
    Pages 109-120

  12. Better Space Bounds for Parameterized Range Majority and Minority

    • Djamal Belazzougui, Travis Gagie, Gonzalo Navarro
    Pages 121-132

  13. Online Control Message Aggregation in Chain Networks

    • Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Łukasz Jeż, Jiří Sgall, Grzegorz Stachowiak
    Pages 133-145

  14. Fingerprints in Compressed Strings

    • Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind
    Pages 146-157

  15. Beacon-Based Algorithms for Geometric Routing

    • Michael Biro, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell
    Pages 158-169

  16. Interval Selection with Machine-Dependent Intervals

    • Kateřina Böhmová, Yann Disser, Matúš Mihalák, Peter Widmayer
    Pages 170-181

  17. On the Spanning Ratio of Theta-Graphs

    • Prosenjit Bose, André van Renssen, Sander Verdonschot
    Pages 182-194

  18. Relative Interval Analysis of Paging Algorithms on Access Graphs

    • Joan Boyar, Sushmita Gupta, Kim S. Larsen
    Pages 195-206

  19. On Explaining Integer Vectors by Few Homogenous Segments

    • Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondřej Suchý
    Pages 207-218

  20. Trajectory Grouping Structure

    • Kevin Buchin, Maike Buchin, Marc van Kreveld, Bettina Speckmann, Frank Staals
    Pages 219-230
Back to top

Other volumes

  1. Algorithms and Data Structures

Keywords

About this book

This book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. 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 44 revised full papers presented in this volume were carefully reviewed and selected from 139 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.

Editors and Affiliations

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

    Frank Dehne

  • Department of Computer Science, The University of Western Ontario, London, Canada

    Roberto Solis-Oba

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

    Jörg-Rüdiger Sack

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation