- Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Linear Layouts of Bipartite Planar Graphs. WADS 2023: 444-459 - Younan Gao:
Adaptive Data Structures for 2D Dominance Colored Range Counting. WADS 2023: 460-473 - Ofek Gila, Michael T. Goodrich, Robert E. Tarjan:
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. WADS 2023: 474-492 - Michael T. Goodrich, Evrim Ozel:
External-Memory Sorting with Comparison Errors. WADS 2023: 493-506 - Joachim Gudmundsson, Yuan Sha:
Approximating the Discrete Center Line Segment in Linear Time. WADS 2023: 660-674 - Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang:
Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs. WADS 2023: 507-520 - Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. WADS 2023: 521-532 - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. WADS 2023: 533-546 - Tereza Klimosová, Vibha Sahlot:
3-Coloring C4 or C3-Free Diameter Two Graphs. WADS 2023: 547-560 - Hung-Yeh Lee, Hsuan-Yu Liao, Wing-Kai Hon:
Colored Constrained Spanning Tree on Directed Graphs. WADS 2023: 561-573 - Gang Liu, Haitao Wang:
Geometric Hitting Set for Line-Constrained Disks. WADS 2023: 574-587 - Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - Max van Mulken, Bettina Speckmann, Kevin Verbeek:
Density Approximation for Moving Groups. WADS 2023: 675-688 - Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. WADS 2023: 620-636 - Baruch Schieber, Pranav Sitaraman:
Quick Minimization of Tardy Processing Time on a Single Machine. WADS 2023: 637-643 - Haitao Wang:
Dynamic Convex Hulls Under Window-Sliding Updates. WADS 2023: 689-703 - Simon Weber, Joel Widmer:
Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs. WADS 2023: 704-718 - 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 [contents] - 2021
- Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose:
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. WADS 2021: 1-14 - Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. WADS 2021: 15-28 - Susanne Albers, Alexander Eckl:
Scheduling with Testing on Multiple Identical Parallel Machines. WADS 2021: 29-42 - Susanne Albers, Maximilian Janke:
Online Makespan Minimization with Budgeted Uncertainty. WADS 2021: 43-56 - Corentin Allair, Antoine Vigneron:
Pattern Matching in Doubling Spaces. WADS 2021: 57-70 - Shinwoo An, Eunjin Oh:
Reachability Problems for Transmission Graphs. WADS 2021: 71-84 - Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. WADS 2021: 85-100 - Jim Apple:
HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields. WADS 2021: 101-114 - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An APTAS for Bin Packing with Clique-Graph Conflicts. WADS 2021: 286-299 - Stav Ashur, Matthew J. Katz:
A 4-Approximation of the $\frac{2\pi }{3}$-MST. WADS 2021: 129-143 - Ioana O. Bercea, Guy Even:
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. WADS 2021: 144-157