| 2026 | A Broader View on Clustering under Cluster-Aware Norm Objectives. | Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase |
| 2026 | Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation. | Lisa Hellerstein, Benedikt M. Plank, Kevin Schewior |
| 2026 | A Near-Complete Resolution of the Exponential-Time Complexity of k-opt for the Traveling Salesman Problem. | Sophia Heimann, Hung P. Hoang, Stefan Hougardy |
| 2026 | Improved Maximin Share Guarantee for Additive Valuations. | Ehsan Heidari, Alireza Kaviani, Masoud Seddighin, AmirMohammad Shahrezaei |
| 2026 | Perfect Matchings in Random Sparsifications of Dense Hypergraphs. | Jie Han, Jingwen Zhao |
| 2026 | Likelihood of the Existence of Average Justified Representation. | Qishen Han, Biaoshuai Tao, Lirong Xia, Chengkai Zhang, Houyu Zhou |
| 2026 | A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows. | Maximilian Probst Gutenberg, Rasmus Kyng, Weixuan Yuan, Wuwei Yuan |
| 2026 | Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case. | Venkatesan Guruswami, Xin Lyu, Weiqiang Yuan |
| 2026 | A Classical Quadratic Speedup for Planted k xor. | Meghal Gupta, William He, Ryan O'Donnell, Noah G. Singer |
| 2026 | A well-separated pair decomposition for low density graphs. | Joachim Gudmundsson, Sampson Wong |
| 2026 | Quantum State Preparation with Optimal T-Count. | David Gosset, Robin Kothari, Kewen Wu |
| 2026 | Catching Rats in H-minor-free Graphs. | Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2026 | Tree Embedding in High Dimensions: Dynamic and Massively Parallel. | Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Qihao Kong, Yi Qian, Eva Szilagyi |
| 2026 | Dynamic Hierarchical j-Tree Decomposition and Its Applications. | Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni, Gernot Zcklein |
| 2026 | Distributed Interactive Proofs for Planarity with Log-Star Communication. | Yuval Gil, Merav Parter |
| 2026 | Entrywise Approximation for Matrix Inversion and Linear Systems. | Mehrdad Ghadiri, Hoai-An Nguyen, Junzhao Yang |
| 2026 | Quantum Hamiltonian Certification. | Minbo Gao, Zhengfeng Ji, Qisheng Wang, Wenjun Yu, Qi Zhao |
| 2026 | Downward self-reducibility in the total function polynomial hierarchy. | Karthik Gajulapalli, Surendra Ghentiyala, Zeyong Li, Sidhant Saraogi |
| 2026 | Online Orthogonal Vectors Revisited. | Karthik Gajulapalli, Alexander Golovnev, Samuel King, Sidhant Saraogi |
| 2026 | Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics. | Jason Gaitonde, Elchanan Mossel |
| 2026 | Breaching the 2-Approximation Barrier for Euclidean Capacitated Vehicle Routing. | Zachary Friggstad, Fabrizio Grandoni, Ramin Mousavi |
| 2026 | ℋ-Planarity and Parametric Extensions: when Modulators Act Globally. | Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos |
| 2026 | Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2026 | Spanning Tree Embeddings Are Not Much Harder than Hierarchical Partitions. | Willem Fletcher, D. Ellis Hershkowitz |
| 2026 | Sensitivity Lower Bounds for Approximation Algorithms. | Noah Fleming, Yuichi Yoshida |