| 2026 | Real-Weighted Diameter and Eccentricities of Minor-Free and Bounded VC-Dimension Graphs in Truly Subquadratic Time. | Da Wei Zheng |
| 2026 | Data-Dependent Evaluations for Budgeted Submodular Maximization. | Lejian Zhang, Xueyan Tang, Jing Tang |
| 2026 | Online Coloring for Graphs of Large Odd Girth. | Hirotaka Yoneda, Masataka Yoneda |
| 2026 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2026 | Shortest Path Map Equivalence Decompositions and Applications. | Haitao Wang |
| 2026 | Dynamic Matroids: Base Packing and Covering. | Tijn de Vos, Mara Grilnberger |
| 2026 | Greedy Completion for Weighted (α, β)-Spanners. | Elad Tzalik |
| 2026 | Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams. | Hoang Ta, Hoa T. Vu |
| 2026 | Characterizing Streaming Decidability of CSPs via Non-Redundancy. | Amatya Sharma, Santhoshini Velusamy |
| 2026 | Advances in Exact and Approximate Group Closeness Centrality Maximization. | Christian Schulz, Jakob Ternes, Henning Woydt |
| 2026 | T-REX: Fast and Dynamic Journey Planning for Continental-Scale Public Transit Networks. | Jonas Sauer, Patrick Steil, Sascha Witt |
| 2026 | A Quadratic Lower Bound for Stable Roommates Solvability. | Will Rosenbaum |
| 2026 | Graph Scheduling with Group Completion Times. | Lars Rohwedder, Leander Schnaars |
| 2026 | Adaptive Sampling for Minimum-Norm k-Clustering. | Haripriya Pulyassary, Chaitanya Swamy |
| 2026 | Warm-Starting All-Pairs Shortest Paths with Predictions. | Adam Polak, Jonas Schmidt |
| 2026 | Sublinear Algorithms for Estimating Single-Linkage Clustering Costs. | Pan Peng, Christian Sohler, Yi Xu |
| 2026 | Multiple-Choice Knapsack with Small Items. | Jakub Pawlewicz |
| 2026 | Polynomial-Size Encoding of All Cuts of Small Value in Integer-Valued Symmetric Submodular Functions. | Sang-il Oum, Marek Sokolowski |
| 2026 | Fully Scalable MPC Algorithms for WSPD in Doubling and Euclidean Spaces. | Eunjin Oh, Hyeonjun Shin |
| 2026 | Adaptive Sparsification for Linear Programming. | tienne Objois, Adrian Vladu |
| 2026 | Dynamic Grammar-Compressed Self-Index in δ-Optimal Space. | Takaaki Nishimoto, Yasuo Tabei |
| 2026 | Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products. | Christopher Musco, Indu Ramesh |
| 2026 | Virtual-Memory Powersort. | Finn Moltmann, Tamio-Vesa Nakajima, Sebastian Wild |
| 2026 | Approximation Algorithms for Machine Minimization. | Mohsen Mohammadi, Mohammad R. Salavatipour |
| 2026 | On the See-Through Watchman Route Problem and the Quota-TSP Problem on Infinite Lines. | Joseph S. B. Mitchell, Linh Nguyen |