Skip to main content
  • Conference proceedings
  • © 2017

Algorithms and Data Structures

15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017, Proceedings

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

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 2017.

Buy it now

Buying options

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

  1. Front Matter

    Pages I-XX
  2. Covering Segments with Unit Squares

    • Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
    Pages 1-12
  3. Replica Placement on Bounded Treewidth Graphs

    • Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral
    Pages 13-24
  4. Fast Exact Algorithms for Survivable Network Design with Uniform Requirements

    • Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
    Pages 25-36
  5. The Complexity of Tree Partitioning

    • Zhao An, Qilong Feng, Iyad Kanj, Ge Xia
    Pages 37-48
  6. Effectiveness of Local Search for Art Gallery Problems

    • Sayan Bandyapadhyay, Aniket Basu Roy
    Pages 49-60
  7. Parameterized Complexity of Geometric Covering Problems Having Conflicts

    • Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
    Pages 61-72
  8. Obedient Plane Drawings for Disk Intersection Graphs

    • Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow
    Pages 73-84
  9. \(\delta \)-Greedy t-spanner

    • Gali Bar-On, Paz Carmi
    Pages 85-96
  10. Dynamic Graph Coloring

    • Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen et al.
    Pages 97-108
  11. Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron

    • Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    Pages 109-120
  12. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width

    • Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon
    Pages 121-132
  13. Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks

    • Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
    Pages 133-144
  14. A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings

    • Therese Biedl, Philippe Demontigny
    Pages 145-156
  15. A Deterministic Algorithm for Online Steiner Tree Leasing

    • Marcin Bienkowski, Artur Kraska, Paweł Schmidt
    Pages 169-180
  16. The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation

    • Gianfranco Bilardi, Lorenzo De Stefani
    Pages 181-192
  17. Maximum Plane Trees in Multipartite Geometric Graphs

    • Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari et al.
    Pages 193-204
  18. Local Routing in Spanners Based on WSPDs

    • Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmović, Frédérik Paradis
    Pages 205-216
  19. Relaxing the Irrevocability Requirement for Online Graph Algorithms

    • Joan Boyar, Lene M. Favrholdt, Michal Kotrbčík, Kim S. Larsen
    Pages 217-228

Other Volumes

  1. Algorithms and Data Structures

About this book

This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017.

The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 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.

The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures 

Editors and Affiliations

  • Computer Science, University of Toronto , Toronto, Canada

    Faith Ellen

  • Computer Science, Memorial University of Newfoundland , St. John’s, Canada

    Antonina Kolokolova

  • Carleton University, Ottawa, Canada

    Jörg-Rüdiger Sack

Bibliographic Information

Buy it now

Buying options

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