| 2026 | Peeling Rotten Potatoes for a Faster Approximation of Convex Cover. | Omrit Filtser, Tzalik Maimon, Ofir Yomtovyan |
| 2026 | Stochastic Embedding of Digraphs into DAGs. | Arnold Filtser |
| 2026 | Spectral Clustering with Side Information. | Hendrik Fichtenberger, Michael Kapralov, Ekaterina Kochetkova, Silvio Lattanzi, Davide Mazzali, Weronika Wrzos-Kaminska |
| 2026 | On the edge expansion of random polytopes. | Asaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij |
| 2026 | Nearly Tight Sample Complexity for Matroid Online Contention Resolution. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2026 | Contract Design for Sequential Actions. | Tomer Ezra, Michal Feldman, Maya Schlesinger |
| 2026 | Prophet Inequality from Samples: Is the More the Merrier? | Tomer Ezra |
| 2026 | Contract Design Beyond Hidden-Actions. | Tomer Ezra, Stefano Leonardi, Matteo Russo |
| 2026 | Computational barriers for permutation-based problems, and cumulants of weakly dependent random variables. | Bertrand Even, Christophe Giraud, Nicolas Verzelen |
| 2026 | Unsplittable Flow Cut Gap in Undirected Graphs. | David Alemn Espinosa, Nikhil Kumar, Joseph Poremba, F. Bruce Shepherd |
| 2026 | An optimal algorithm for average distance in typical regular graphs. | Alexandros Eskenazis, Manor Mendel, Assaf Naor |
| 2026 | Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time. | Antoine El-Hayek, Monika Henzinger, Jason Li |
| 2026 | A parameterized linear formulation of the integer hull. | Friedrich Eisenbrand, Thomas Rothvoss |
| 2026 | Unbounded Error Correcting Codes. | Klim Efremenko, Or Zamir |
| 2026 | When Contracts Get Complex: Information-Theoretic Barriers. | Paul Dtting, Michal Feldman, Yoav Gal Tzur, Aviad Rubinstein |
| 2026 | Near-Optimal Centerpoints in Polynomial Time in the Ambient Dimension. | Kunal Dutta, Karol Pisula |
| 2026 | RETRACTED: Constructive ℓ | |
| 2026 | A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays. | Marc Dufay, Roger Wattenhofer |
| 2026 | Efficient Online Random Sampling via Randomness Recycling. | Thomas L. Draper, Feras A. Saad |
| 2026 | On Independent Spanning Trees in Random Graphs. | Nemanja Draganic, Keith Frankston, Michael Krivelevich, Alexey Pokrovskiy, Liana Yepremyan |
| 2026 | Tight Differentially Private PCA via Matrix Coherence. | Tommaso d'Orsi, Gleb Novikov |
| 2026 | You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2026 | Learning in an Echo Chamber: Online Learning with Replay Adversary. | Daniil Dmitriev, Harald Eskelund Franck, Carolin Heinzler, Amartya Sanyal |
| 2026 | Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure. | Michal Derezinski, Aaron Sidford |
| 2026 | Improved Approximation for Ranking on General Graphs. | Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu |