| 2022 | Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. | Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
| 2022 | Strong Approximations and Irrationality in Financial Networks with Derivatives. | Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre |
| 2022 | Satisfiability Problems for Finite Groups. | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Wei |
| 2022 | In-Range Farthest Point Queries and Related Problem in High Dimensions. | Ziyun Huang, Jinhui Xu |
| 2022 | Understanding the Moments of Tabulation Hashing via Chaoses. | Jakob Bk Tejs Houen, Mikkel Thorup |
| 2022 | Delegation for Search Problems. | Justin Holmgren, Andrea Lincoln, Ron D. Rothblum |
| 2022 | A Fixed-Parameter Algorithm for the Kneser Problem. | Ishay Haviv |
| 2022 | Downsampling for Testing and Learning in Product Distributions. | Nathaniel Harms, Yuichi Yoshida |
| 2022 | Homomorphism Tensors and Linear Equations. | Martin Grohe, Gaurav Rattan, Tim Seppelt |
| 2022 | Lower Bounds for Unambiguous Automata via Communication Complexity. | Mika Gs, Stefan Kiefer, Weiqiang Yuan |
| 2022 | Some New (And Old) Results on Contention Resolution (Invited Talk). | Leslie Ann Goldberg |
| 2022 | Distributed Controller Synthesis for Deadlock Avoidance. | Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz |
| 2022 | Tolerant Bipartiteness Testing in Dense Graphs. | Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, Sayantan Sen |
| 2022 | Galloping in Fast-Growth Natural Merge Sorts. | Elahe Ghasemi, Vincent Jug, Ghazal Khalighinejad |
| 2022 | Sublinear Dynamic Interval Scheduling (On One or Multiple Machines). | Pawel Gawrychowski, Karol Pokorski |
| 2022 | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
| 2022 | Reachability in Bidirected Pushdown VASS. | Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schtze, Georg Zetzsche |
| 2022 | The Decision Problem for Perfect Matchings in Dense Hypergraphs. | Luyining Gan, Jie Han |
| 2022 | Approximating Observables Is as Hard as Counting. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2022 | Twin-Width and Types. | Jakub Gajarsk, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2022 | Faster Cut Sparsification of Weighted Graphs. | Sebastian Forster, Tijn de Vos |
| 2022 | (Re)packing Equal Disks into Rectangle. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi |
| 2022 | Streaming Submodular Maximization Under Matroid Constraints. | Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders. | Lo Exibard, Emmanuel Filiot, Ayrat Khalimov |
| 2022 | Testability and Local Certification of Monotone Properties in Minor-Closed Classes. | Louis Esperet, Sergey Norin |