| 2026 | Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs. | Yossi Azar, Shahar Lewkowicz |
| 2026 | On the Usefulness of Promises. | Per Austrin, Johan Hstad, Bjrn Martinsson |
| 2026 | Coloring Graphs with Few Colors in the Streaming Model. | Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar |
| 2026 | Better Bounds for Semi-Streaming Single-Source Shortest Paths. | Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan |
| 2026 | Vizing's Theorem in Deterministic Almost-Linear Time. | Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2026 | Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes. | Vikrant Ashvinkumar, Mursalin Habib, Shashank Srivastava |
| 2026 | A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time. | Alexander Armbruster, Lars Rohwedder, Andreas Wiese |
| 2026 | Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints. | Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese |
| 2026 | Faster algorithms for packing forests in graphs and related problems. | Pavel A. Arkhipov, Vladimir Kolmogorov |
| 2026 | Additive Approximation Schemes for Low-Dimensional Embeddings. | Prashanti Anderson, Ainesh Bakshi, Samuel B. Hopkins |
| 2026 | Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets. | Noga Alon, Shakhar Smorodinsky |
| 2026 | Determinization of Min-Plus Weighted Automata is Decidable. | Shaull Almagor, Guy Arbel, Sarai Sheinvald |
| 2026 | Matroids are Equitable. | Hannaneh Akrami, Roshan Raj, Lszl A. Vgh |
| 2026 | Near-Optimal Min-Sum Multi-Robot Motion Planning in a Planar Polygonal Environment. | Pankaj K. Agarwal, Benjamin Holmgren, Alex Steiger |
| 2026 | Computing the Heaviest Disk and Related Problems. | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
| 2026 | Optimal mass estimation in the conditional sampling model. | Tomer Adar, Eldar Fischer, Amit Levi |
| 2026 | Burling Graphs in Graphs with Large Chromatic Number. | Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masarkov, Pawel Rzazewski, Bartosz Walczak |
| 2026 | Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation. | Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin, Andr Nusser, Carolin Rehs |
| 2026 | A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. | Amir Abboud, Shyan Akmal, Nick Fischer |
| 2026 | On the Structure of Replicable Hypothesis Testers. | Anders Aamand, Maryam Aliakbarpour, Justin Y. Chen, Shyam Narayanan, Sandeep Silwal |
| 2026 | Phase transition of the Sinkhorn-Knopp algorithm. | Kun He |
| 2026 | Long Arithmetic Progressions in Sparse Subset Sums: A Computational Perspective. | Lin Chen, Yuchen Mao, Guochuan Zhang |
| 2026 | Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions. | Jason Li, Connor Mowry, Satish Rao |
| 2026 | Online Connectivity Augmentation. | Mohit Garg, Aditya Subramanian |
| 2026 | A Post-Quantum Lower Bound for the Distributed Lovasz Local Lemma. | Sebastian Brandt, Tim Gttlicher |