| 2026 | On the Computation of Schrijver's Kernels. | Vincent Delecroix, Oscar Fontaine, Francis Lazarus |
| 2026 | Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings. | Rajat De, Dominik Kempa |
| 2026 | History-Independent Maximal Matchings can be Surprisingly Efficient, and Lead to Better Worst-Case Guarantees. | Rathish Das, William Kuszmaul |
| 2026 | From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. | Daniel Dadush, James B. Orlin, Aaron Sidford, Lszl A. Vgh |
| 2026 | Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure. | Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer |
| 2026 | Lower Bounds for CSP Hierarchies Through Ideal Reduction. | Jonas Conneryd, Yassine Ghannane, Shuo Pang |
| 2026 | Collaborative Prediction: Tractable Information Aggregation via Agreement. | Natalie Collina, Ira Globus-Harris, Surbhi Goel, Varun Gupta, Aaron Roth, Mirah Shi |
| 2026 | Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets. | Riccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll, Stefano Leonardi, Guido Schfer, Artem Tsikiridis |
| 2026 | One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. | Edith Cohen, Jelani Nelson, Tams Sarls, Mihir Singhal, Uri Stemmer |
| 2026 | An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the k-Means Problem. | Vincent Cohen-Addad, Fabian Kuhn, Zahra Parsaeian |
| 2026 | Online 3-Taxi on General Metrics. | Christian Coester, Tze-Yang Poon |
| 2026 | On the Quantum Chromatic Gap. | Lorenzo Ciardo |
| 2026 | Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs. | Julia Chuzhoy, Ron Mosenzon, Ohad Trabelsi |
| 2026 | Deterministic Dynamic Edge Colouring. | Aleksander B. G. Christiansen |
| 2026 | Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap. | Manuel Christalla, Luise Puhlmann, Vera Traub |
| 2026 | Balanced Spanning Tree Distributions Have Separation Fairness. | Harry Chen, Kamesh Munagala, Govind S. Sankar |
| 2026 | Explicit Min-wise Hash Families with Optimal Size. | Xue Chen, Shengtang Huang, Xin Li |
| 2026 | Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions. | Kuan Cheng, Ruiyang Wu |
| 2026 | Does block size matter in randomized block Krylov low-rank approximation? | Tyler Chen, Ethan N. Epperly, Raphael A. Meyer, Christopher Musco, Akash Rao |
| 2026 | Detecting Correlation Efficiently in Very Supercritical Stochastic Block Models: Breaking the Otter's Threshold Barrier. | Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li |
| 2026 | Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors. | Shabarish Chenakkod, Michal Derezinski, Xiaoyu Dong |
| 2026 | (α, β)-Spanners and Hybrid Spanners with Nearly Tight Bounds. | Shiri Chechik, Gur Lifshitz |
| 2026 | Approximately Dominating Sets in Elections. | Moses Charikar, Prasanna Ramakrishnan, Kangning Wang |
| 2026 | Testing forbidden order-pattern properties on hypergrids. | Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma |
| 2026 | Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More. | Rishi Chandra, Michael Dinitz, Chenglin Fan, Zongrui Zou |