| 2025 | 19th International Symposium on Algorithms and Data Structures, WADS 2025, York University, Toronto, Canada, August 11-15, 2025 Pat Morin, Eunjin Oh |
| 2025 | A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon. Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann |
| 2025 | A QPTAS for Facility Location on Unit Disk Graphs. Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun |
| 2025 | A WSPD, Separator and Small Tree Cover for c-Packed Graphs. Lindsey Deryckere, Joachim Gudmundsson, André van Renssen, Yuan Sha, Sampson Wong |
| 2025 | Algorithms for Distance Problems in Continuous Graphs. Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira |
| 2025 | An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines. Leah Epstein, Asaf Levin |
| 2025 | An Improved Guillotine Cut for Squares. Parinya Chalermsook, Axel Kugelmann, Ly Orgo, Sumedha Uniyal, Minoo Zarsav |
| 2025 | Approximation Algorithms for the Generalized Point-To-Point Problem. Zachary Friggstad, Mohammad R. Salavatipour, Hao Sun |
| 2025 | Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii. Sayan Bandyapadhyay, Elijah Mitchell |
| 2025 | B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load. Roodabeh Safavi, Martin P. Seybold |
| 2025 | Clustering Point Sets Revisited. Md. Billal Hossain, Benjamin Raichel |
| 2025 | Computational Geometry with Probabilistically Noisy Primitive Operations. David Eppstein, Michael T. Goodrich, Vinesh Sridhar |
| 2025 | Constructing and Routing on Geometric Spanners (Invited Talk). Prosenjit Bose |
| 2025 | Convolution and Knapsack in Higher Dimensions. Kilian Grage, Klaus Jansen, Björn Schumacher |
| 2025 | Crossing and Independent Families Among Polygons. Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada |
| 2025 | Deterministic (2/3 - ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries. Tatsuya Terao |
| 2025 | Dynamic Streaming Algorithms for Geometric Independent Set. Timothy M. Chan, Yuancheng Yu |
| 2025 | Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs. Emanuel Elias Silva Castelo, Oscar Defrain, Guilherme C. M. Gomes |
| 2025 | Evolving Distributions Under Local Motion. Aditya Acharya, David M. Mount |
| 2025 | Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. Niels Grüttemeier, Nils Morawietz, Frank Sommer |
| 2025 | Farthest-Point Voronoi Diagrams in the Hilbert Metric. Minju Song, Mook Kwon Jung, Hee-Kap Ahn |
| 2025 | Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences. Tuyen Pham, Hubert Wagner |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Grandchildren-Weight-Balanced Binary Search Trees. Vincent Jugé |
| 2025 | Linear Layouts of Graphs with Priority Queues. Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink |
| 2025 | Link Diameter, Radius and 2-Point Link Distance Queries in Polygonal Domains. Mart Hagedoorn, Valentin Polishchuk |
| 2025 | Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model. Leah Epstein, Asaf Levin |
| 2025 | Novel Complexity Results for Temporal Separators with Deadlines. Riccardo Dondi, Manuel Lafond |
| 2025 | On Geodesic Disks Enclosing Many Points. Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira, Tyler Tuttle |
| 2025 | On Minimizing Wiggle in Stacked Area Charts. Alexander Dobler, Martin Nöllenburg |
| 2025 | On Planar Straight-Line Dominance Drawings. Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali |
| 2025 | On the Complexity of Finding 1-Center Spanning Trees. Pin-Hsian Lee, Meng-Tsung Tsai, Hung-Lung Wang |
| 2025 | On the Complexity of Minimising the Moving Distance for Dispersing Objects. Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono |
| 2025 | On the Enumeration of Signatures of XOR-CNF's. Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin |
| 2025 | On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms. Lorenzo De Stefani, Vedant Gupta |
| 2025 | Online Routing in Directed Yao₄^∞ Graphs. Prosenjit Bose, Jean-Lou De Carufel, John Stuart |
| 2025 | Parameterized Streaming Algorithms for Topological Sorting. Ho-Lin Chen, Peng-Ting Lin, Meng-Tsung Tsai |
| 2025 | Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nöllenburg |
| 2025 | Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis. Niels Grüttemeier, Klaus Heeger |
| 2025 | Routing Few Robots in a Crowded Network. Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan |
| 2025 | Scheduling on Identical Machines with Setup Time and Unknown Execution Time. Yasushi Kawase, Kazuhisa Makino, Vinh Long Phan, Hanna Sumita |
| 2025 | Skipping Ropes: An Efficient Gray Code Algorithm for Generating Wiggly Permutations. Vincent Pilaud, Aaron Williams |
| 2025 | Spanner for the 0/1/∞ Weighted Region Problem. Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong |
| 2025 | Streaming Algorithms for Conflict-Free Coloring. Rogers Mathew, Fahad Panolan, Seshikanth |
| 2025 | Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage. Meng He, Kaiyu Wu |
| 2025 | Support Vector Machines in the Hilbert Geometry. Aditya Acharya, Auguste H. Gezalyan, Julian Vanecek, David M. Mount, Sunil Arya |
| 2025 | Sweeping a Domain with Line-Of-Sight Between Covisible Agents. Kien C. Huynh, Joseph S. B. Mitchell, Valentin Polishchuk |
| 2025 | Testing Whether a Subgraph Is Convex or Isometric. Sergio Cabello |
| 2025 | The Parameterized Landscape of Labeled Graph Contractions. Manuel Lafond, Bertrand Marchand |
| 2025 | Tight Bounds on the Number of Closest Pairs in Vertical Slabs. Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth |
| 2025 | Unintuitive Facts About Distances on Planar Graphs (Invited Talk). Hsien-Chih Chang |
| 2025 | Vantage Point Selection Algorithms for Bottleneck Capacity Estimation. Vikrant Ashvinkumar, Rezaul Chowdhury, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk |