| 2022 | Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2022 | Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Frchet Distance. | Karl Bringmann, Anne Driemel, Andr Nusser, Ioannis Psarros |
| 2022 | Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. | Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta |
| 2022 | Twin-width VI: the lens of contraction sequences. | douard Bonnet, Eun Jung Kim, Amadeus Reinald, Stphan Thomass |
| 2022 | Partially Optimal Edge Fault-Tolerant Spanners. | Greg Bodwin, Michael Dinitz, Caleb Robelle |
| 2022 | On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. | Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda |
| 2022 | Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology. | Mitchell Black, William Maxwell, Amir Nayyeri, Eli Winkelman |
| 2022 | Optimal angle bounds for Steiner triangulations of polygons. | Christopher J. Bishop |
| 2022 | Distributed Zero-Knowledge Proofs Over Networks. | Aviv Bick, Gillat Kol, Rotem Oshman |
| 2022 | How many Clusters? - An algorithmic answer. | Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar |
| 2022 | Better Sum Estimation via Weighted Sampling. | Lorenzo Beretta, Jakub Tetek |
| 2022 | Splay trees on trees. | Benjamin Aram Berendsohn, Lszl Kozma |
| 2022 | Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang |
| 2022 | New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. | Soheil Behnezhad, Sanjeev Khanna |
| 2022 | Stochastic Vertex Cover with Few Queries. | Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan |
| 2022 | Sensitivity Oracles for All-Pairs Mincuts. | Surender Baswana, Abhyuday Pandey |
| 2022 | The complexity of testing all properties of planar graphs, and the role of isomorphism. | Sabyasachi Basu, Akash Kumar, C. Seshadhri |
| 2022 | Combinatorial Gap Theorem and Reductions between Promise CSPs. | Libor Barto, Marcin Kozik |
| 2022 | Learning-Augmented Weighted Paging. | Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee |
| 2022 | Fast Consensus via the Unconstrained Undecided State Dynamics. | Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elssser, Hamed Hosseinpour, Dominik Kaaser, Peter Kling |
| 2022 | Online Nash Social Welfare Maximization with Predictions. | Siddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh, Billy Jin |
| 2022 | Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2022 | An Improved Analysis of Greedy for Online Steiner Forest. | tienne Bamas, Marina Drygala, Andreas Maggiori |
| 2022 | Deterministic Budget-Feasible Clock Auctions. | Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan |
| 2022 | High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. | Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett |