| 2026 | The Price of Homogeneity Is Polynomial. | Maximilian Gorsky, Michal T. Seweryn, Sebastian Wiederrecht |
| 2026 | Quickly Excluding an Annotated Planar Graph. | Maximilian Gorsky, Evangelos Protopapas, Sebastian Wiederrecht |
| 2026 | Optimally Controlling a Random Population. | Hugo Gimbert, Corto Mascle, Patrick Totzke |
| 2026 | Optimal Sequential Flows. | Hugo Gimbert, Corto Mascle, Patrick Totzke |
| 2026 | Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding. | Amin Shiraz Gilani, Daochen Wang, Pei Wu, Xingyu Zhou |
| 2026 | A 9/4-Approximation for Directed Feedback Vertex Sets in Quasi-Transitive Digraphs. | Ebrahim Ghorbani, Matthias Mnich |
| 2026 | Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time. | Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis |
| 2026 | Transducing Linear Decompositions of Tournaments. | Colin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kant |
| 2026 | When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs? | Timo Fritsch, Marvin Knnemann, Mirza Redzic, Julian Stie |
| 2026 | Proving Algebraic Independence in Zero-Knowledge. | Michael A. Forbes, Andrei Staicu |
| 2026 | Beyond Brooks: (Δ-1)-Coloring in Semi-Streaming. | Maxime Flin, Magns M. Halldrsson |
| 2026 | Faster Weak Expander Decompositions and Approximate Max Flow. | Henry L. Fleischmann, George Z. Li, Jason Li |
| 2026 | Asymptotic Hausdorff and Language Similarity. | Dana Fisman, Gal Meirom |
| 2026 | New Convex Programming Technique for Nash Social Welfare and Scheduling. | Yuda Feng, Weijiang Hu, Shi Li |
| 2026 | Submodular Maximization over a Matroid k-Intersection: Multiplicative Improvement over Greedy. | Moran Feldman, Justin Ward |
| 2026 | Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs. | David Alemn Espinosa, Niklas Schlomberg |
| 2026 | Recursive Jump Operators and Optimal Proof Systems. | Fabian Egidy |
| 2026 | White-Box Adversarial Streaming Lower Bounds Beyond Two-Party Communication. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang |
| 2026 | Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes. | Anouk Duyster, Tomasz Kociumaka |
| 2026 | Faster Algorithms for k-Orthogonal Vectors in Low Dimension. | Anita Drr, Evangelos Kipouridis, Michael Lampis, Karol Wegrzycki |
| 2026 | A Fine-Grained Dichotomy for the Center Problem on Gromov Hyperbolic Graphs. | Guillaume Ducoffe |
| 2026 | A Faster Directed Single-Source Shortest Path Algorithm. | Ran Duan, Xiao Mao, Xinkai Shu, Longhui Yin |
| 2026 | Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics. | Anne Driemel, Jan Hckendorff, Ioannis Psarros, Christian Sohler, Di Yue |
| 2026 | On Randomness Complexity of 1-Private Protocols. | Samuel Dittmer, Rafail Ostrovsky |
| 2026 | Improved Time-Space Tradeoffs for 3SUM-Indexing. | Itai Dinur, Alexander Golovnev |