Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Data Structures

16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Zachary Friggstad

    1. Department of Computing Science, University of Alberta, Edmonton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jörg-Rüdiger Sack

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Mohammad R Salavatipour

    1. Department of Computing Science, University of Alberta, Edmonton, 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 11646)

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

Included in the following conference series:

Conference proceedings info: WADS 2019.

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 EPUB and 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 (42 papers)

  1. Front Matter

    Pages i-xx
    Download chapter PDF

  2. Succinct Data Structures for Families of Interval Graphs

    • Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
    Pages 1-13

  3. On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow

    • Kateřina Altmanová, Petr Kolman, Jan Voborník
    Pages 14-27

  4. Efficient Nearest-Neighbor Query and Clustering of Planar Curves

    • Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan
    Pages 28-42

  5. Positive-Instance Driven Dynamic Programming for Graph Searching

    • Max Bannach, Sebastian Berndt
    Pages 43-56

  6. How to Morph a Tree on a Small Grid

    • Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani et al.
    Pages 57-70

  7. Approximating Robust Bin Packing with Budgeted Uncertainty

    • Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss
    Pages 71-84

  8. Rank-Select Indices Without Tears

    • Tim Baumann, Torben Hagerup
    Pages 85-98

  9. A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs

    • Amariah Becker, Philip N. Klein, Aaron Schild
    Pages 99-111

  10. A Framework for Vehicle Routing Approximation Schemes in Trees

    • Amariah Becker, Alice Paul
    Pages 112-125

  11. Avoidable Vertices and Edges in Graphs

    • Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Servatius
    Pages 126-139

  12. Plane Hop Spanners for Unit Disk Graphs

    • Ahmad Biniaz
    Pages 140-154

  13. On the Minimum Consistent Subset Problem

    • Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi et al.
    Pages 155-167

  14. Parameterized Complexity of Conflict-Free Graph Coloring

    • Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
    Pages 168-180

  15. Graph Isomorphism for \((H_1,H_2)\)-Free Graphs: An Almost Complete Dichotomy

    • Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
    Pages 181-195

  16. Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs

    • Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira
    Pages 196-210

  17. Computing Maximum Independent Set on Outerstring Graphs and Their Relatives

    • Prosenjit Bose, Paz Carmi, Mark J. Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal et al.
    Pages 211-224

  18. Online Bin Covering with Advice

    • Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
    Pages 225-238

  19. Stackelberg Packing Games

    • Toni Böhnlein, Oliver Schaudt, Joachim Schauer
    Pages 239-253

  20. FRESH: Fréchet Similarity with Hashing

    • Matteo Ceccarello, Anne Driemel, Francesco Silvestri
    Pages 254-268
Back to top

Other volumes

  1. Algorithms and Data Structures

Keywords

About this book

This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.

Editors and Affiliations

  • Department of Computing Science, University of Alberta, Edmonton, Canada

    Zachary Friggstad, Mohammad R Salavatipour

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

    Jörg-Rüdiger Sack

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation