| 2022 | On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs. | Charilaos Efthymiou |
| 2022 | Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2022 | Regular Expressions for Tree-Width 2 Graphs. | Amina Doumane |
| 2022 | Hiding Pebbles When the Output Alphabet Is Unary. | Gatan Douneau-Tabot |
| 2022 | High-Probability List-Recovery, and Applications to Heavy Hitters. | Dean Doron, Mary Wootters |
| 2022 | Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. | Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang |
| 2022 | Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions. | Ming Ding, Rasmus Kyng, Peng Zhang |
| 2022 | Set Membership with Two Classical and Quantum Bit Probes. | Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan |
| 2022 | New Additive Approximations for Shortest Paths and Cycles. | Mingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, Ziqian Zhong |
| 2022 | Dynamic Meta-Theorems for Distance and Matching. | Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari |
| 2022 | Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk). | Constantinos Daskalakis |
| 2022 | Improved Reconstruction of Random Geometric Graphs. | Varsha Dani, Josep Daz, Thomas P. Hayes, Cristopher Moore |
| 2022 | Streaming Algorithms for Geometric Steiner Forest. | Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Vesel |
| 2022 | On Computing the k-Shortcut Frchet Distance. | Jacobus Conradi, Anne Driemel |
| 2022 | Metastability of the Potts Ferromagnet on Random Regular Graphs. | Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda |
| 2022 | LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation. | Gil Cohen, Tal Yankovitz |
| 2022 | Expander Random Walks: The General Case and Limitations. | Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma |
| 2022 | Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring. | Aleksander B. G. Christiansen, Eva Rotenberg |
| 2022 | Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond. | Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi |
| 2022 | Approximation Algorithms for Interdiction Problem with Packing Constraints. | Lin Chen, Xiaoyu Wu, Guochuan Zhang |
| 2022 | Online Weighted Cardinality Joint Replenishment Problem with Delay. | Ryder Chen, Jahanvi Khatkar, Seeun William Umboh |
| 2022 | Polylogarithmic Sketches for Clustering. | Moses Charikar, Erik Waingarten |
| 2022 | Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. | Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai |
| 2022 | Pairwise Reachability Oracles and Preservers Under Failures. | Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary |
| 2022 | On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. | Antonio Casares, Thomas Colcombet, Karoliina Lehtinen |