default search action
18th WADS 2023: Montreal, QC, Canada
- Pat Morin
, Subhash Suri
Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings. Lecture Notes in Computer Science 14079, Springer 2023, ISBN 978-3-031-38905-4 - A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. 1-14 - Rusul J. Alsaedi, Joachim Gudmundsson
The Mutual Visibility Problem for Fat Robots. 15-28 - Shinwoo An, Kyungjin Cho, Eunjin Oh:
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. 29-42 - Júlia Baligács
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. 43-64 - Evripidis Bampis, Bruno Escoffier, Niklas Hahn
Online TSP with Known Locations. 65-78 - Sayan Bandyapadhyay
Socially Fair Matching: Exact and Approximation Algorithms. 79-92 - Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. 93-105 - Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
Dominator Coloring and CD Coloring in Almost Cluster Graphs. 106-119 - Jatin Batra, Syamantak Das, Agastya Vibhuti Jha:
Tight Approximation Algorithms for Ordered Covering. 120-135 - Magnus Berg
Online Minimum Spanning Trees with Weight Predictions. 136-148 - Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann
Compact Distance Oracles with Large Sensitivity and Low Stretch. 149-163 - Davide Bilò
Finding Diameter-Reducing Shortcuts in Trees. 164-178 - Prosenjit Bose
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. 179-192 - Joan Boyar
Online Interval Scheduling with Predictions. 193-207 - Kevin Buchin
On Length-Sensitive Fréchet Similarity. 208-231 - Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang:
Hardness of Graph-Structured Algebraic and Symbolic Problems. 232-246 - Xiuge Chen
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. 247-261 - Jongmin Choi, Jaegun Lee, Hee-Kap Ahn
Efficient k-Center Algorithms for Planar Points in Convex Position. 262-274 - Marek Chrobak
Classification via Two-Way Comparisons (Extended Abstract). 275-290 - Mark de Berg
Improved Bounds for Discrete Voronoi Games. 291-308 - Shaleen Deep, Xiao Hu, Paraschos Koutris:
General Space-Time Tradeoffs via Relational Queries. 309-325 - Ian DeHaan, Zachary Friggstad:
Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. 326-339 - Chengyuan Deng, Jie Gao, Jalaj Upadhyay, Chen Wang:
Differentially Private Range Query on Shortest Paths. 340-370 - Tamal K. Dey, Tao Hou, Salman Parsa:
Revisiting Graph Persistence for Updates and Efficiency. 371-385 - Alexander Dobler
Block Crossings in One-Sided Tanglegrams. 386-400 - Adrian Dumitrescu, Csaba D. Tóth:
Observation Routes and External Watchman Routes. 401-415 - David Eppstein:
Lower Bounds for Non-adaptive Shortest Path Relaxation. 416-429 - Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira:
Shortest Coordinated Motion for Square Robots. 430-443 - Henry Förster
Linear Layouts of Bipartite Planar Graphs. 444-459 - Younan Gao
Adaptive Data Structures for 2D Dominance Colored Range Counting. 460-473 - Ofek Gila
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. 474-492 - Michael T. Goodrich, Evrim Ozel:
External-Memory Sorting with Comparison Errors. 493-506 - Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang:
Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs. 507-520 - Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. 521-532 - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. 533-546 - Tereza Klimosová, Vibha Sahlot:
3-Coloring C4 or C3-Free Diameter Two Graphs. 547-560 - Hung-Yeh Lee, Hsuan-Yu Liao, Wing-Kai Hon:
Colored Constrained Spanning Tree on Directed Graphs. 561-573 - Gang Liu, Haitao Wang:
Geometric Hitting Set for Line-Constrained Disks. 574-587 - Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. 588-604 - Hsien-Chih Chang
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. 605-619 - Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. 620-636 - Baruch Schieber, Pranav Sitaraman:
Quick Minimization of Tardy Processing Time on a Single Machine. 637-643 - Gerth Stølting Brodal
Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. 644-659 - Joachim Gudmundsson, Yuan Sha:
Approximating the Discrete Center Line Segment in Linear Time. 660-674 - Max van Mulken, Bettina Speckmann, Kevin Verbeek
Density Approximation for Moving Groups. 675-688 - Haitao Wang:
Dynamic Convex Hulls Under Window-Sliding Updates. 689-703 - Simon Weber
Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs. 704-718
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: