| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2025 | Deterministic (2/3 - ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries. | Tatsuya Terao |
| 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 | Farthest-Point Voronoi Diagrams in the Hilbert Metric. | Minju Song, Mook Kwon Jung, Hee-Kap Ahn |
| 2025 | B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load. | Roodabeh Safavi, Martin P. Seybold |
| 2025 | Skipping Ropes: An Efficient Gray Code Algorithm for Generating Wiggly Permutations. | Vincent Pilaud, Aaron Williams |
| 2025 | Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences. | Tuyen Pham, Hubert Wagner |
| 2025 | Streaming Algorithms for Conflict-Free Coloring. | Rogers Mathew, Fahad Panolan, Seshikanth |
| 2025 | On the Complexity of Finding 1-Center Spanning Trees. | Pin-Hsian Lee, Meng-Tsung Tsai, Hung-Lung Wang |
| 2025 | The Parameterized Landscape of Labeled Graph Contractions. | Manuel Lafond, Bertrand Marchand |
| 2025 | Scheduling on Identical Machines with Setup Time and Unknown Execution Time. | Yasushi Kawase, Kazuhisa Makino, Vinh Long Phan, Hanna Sumita |
| 2025 | Grandchildren-Weight-Balanced Binary Search Trees. | Vincent Jug |
| 2025 | Sweeping a Domain with Line-Of-Sight Between Covisible Agents. | Kien C. Huynh, Joseph S. B. Mitchell, Valentin Polishchuk |
| 2025 | Clustering Point Sets Revisited. | Md. Billal Hossain, Benjamin Raichel |
| 2025 | A Near-Linear Time Exact Algorithm for the L₁-Geodesic Frchet Distance Between Two Curves on the Boundary of a Simple Polygon. | Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann |
| 2025 | Link Diameter, Radius and 2-Point Link Distance Queries in Polygonal Domains. | Mart Hagedoorn, Valentin Polishchuk |
| 2025 | Spanner for the 0/1/∞ Weighted Region Problem. | Joachim Gudmundsson, Zijin Huang, Andr van Renssen, Sampson Wong |
| 2025 | Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. | Niels Grttemeier, Nils Morawietz, Frank Sommer |
| 2025 | Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis. | Niels Grttemeier, Klaus Heeger |
| 2025 | Convolution and Knapsack in Higher Dimensions. | Kilian Grage, Klaus Jansen, Bjrn Schumacher |
| 2025 | Linear Layouts of Graphs with Priority Queues. | Emilio Di Giacomo, Walter Didimo, Henry Frster, Torsten Ueckerdt, Johannes Zink |
| 2025 | Approximation Algorithms for the Generalized Point-To-Point Problem. | Zachary Friggstad, Mohammad R. Salavatipour, Hao Sun |
| 2025 | A QPTAS for Facility Location on Unit Disk Graphs. | Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun |
| 2025 | Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model. | Leah Epstein, Asaf Levin |
| 2025 | An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines. | Leah Epstein, Asaf Levin |