Skip to main content
Springer Nature Link
Account

Algorithms and Data Structures

18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Pat Morin

    1. Carleton University, Ottawa, Canada

  2. Subhash Suri

    1. University of California, Santa Barbara, USA

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

Included in the following conference series:

Conference proceedings info: WADS 2023.

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 99.00
Price excludes VAT (Canada)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 129.99
Price excludes VAT (Canada)
  • 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

About this book

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023.
The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions.
They present original research on the theory, design and application of algorithms and data structures.

Similar content being viewed by others

Keywords

Table of contents (47 papers)

  1. Front Matter

    Pages i-xii
    Download chapter PDF

  2. Geometric Spanning Trees Minimizing the Wiener Index

    • A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
    Pages 1-14

  3. The Mutual Visibility Problem for Fat Robots

    • Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
    Pages 15-28

  4. Faster Algorithms for Cycle Hitting Problems on Disk Graphs

    • Shinwoo An, Kyungjin Cho, Eunjin Oh
    Pages 29-42

  5. Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride

    • Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker
    Pages 43-64

  6. Online TSP with Known Locations

    • Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris
    Pages 65-78

  7. Socially Fair Matching: Exact and Approximation Algorithms

    • Sayan Bandyapadhyay, Fedor Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
    Pages 79-92

  8. A Parameterized Approximation Scheme for Generalized Partial Vertex Cover

    • Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
    Pages 93-105

  9. Dominator Coloring and CD Coloring in Almost Cluster Graphs

    • Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
    Pages 106-119

  10. Tight Approximation Algorithms for Ordered Covering

    • Jatin Batra, Syamantak Das, Agastya Vibhuti Jha
    Pages 120-135

  11. Online Minimum Spanning Trees with Weight Predictions

    • Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
    Pages 136-148

  12. Compact Distance Oracles with Large Sensitivity and Low Stretch

    • Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
    Pages 149-163

  13. Finding Diameter-Reducing Shortcuts in Trees

    • Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
    Pages 164-178

  14. Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon

    • Prosenjit Bose, Anthony D’Angelo, Stephane Durocher
    Pages 179-192

  15. Online Interval Scheduling with Predictions

    • Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
    Pages 193-207

  16. On Length-Sensitive Fréchet Similarity

    • Kevin Buchin, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Carola Wenk
    Pages 208-231

  17. Hardness of Graph-Structured Algebraic and Symbolic Problems

    • Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang
    Pages 232-246

  18. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs

    • Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth
    Pages 247-261

  19. Efficient k-Center Algorithms for Planar Points in Convex Position

    • Jongmin Choi, Jaegun Lee, Hee-Kap Ahn
    Pages 262-274

  20. Classification via Two-Way Comparisons (Extended Abstract)

    • Marek Chrobak, Neal E. Young
    Pages 275-290
Back to top

Other volumes

  1. Algorithms and Data Structures

Editors and Affiliations

  • Carleton University, Ottawa, Canada

    Pat Morin

  • University of California, Santa Barbara, USA

    Subhash Suri

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Publish with us

Policies and ethics

Back to top