| 2022 | The Variance-Penalized Stochastic Shortest Path Problem. | Jakob Piribauer, Ocan Sankur, Christel Baier |
| 2022 | Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. | Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny |
| 2022 | Learning Algorithms Versus Automatability of Frege Systems. | Jn Pich, Rahul Santhanam |
| 2022 | Space Characterizations of Complexity Measures and Size-Space Trade-Offs in Propositional Proof Systems. | Theodoros Papamakarios, Alexander A. Razborov |
| 2022 | An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space. | Takaaki Nishimoto, Shunsuke Kanda, Yasuo Tabei |
| 2022 | Strongly Sublinear Algorithms for Testing Pattern Freeness. | Ilan Newman, Nithin Varma |
| 2022 | Linearly Ordered Colourings of Hypergraphs. | Tamio-Vesa Nakajima, Stanislav Zivn |
| 2022 | The SDP Value of Random 2CSPs. | Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu |
| 2022 | A PTAS for Capacitated Vehicle Routing on Trees. | Claire Mathieu, Hang Zhou |
| 2022 | Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. | Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2022 | Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyrfs' Path Argument. | Konrad Majewski, Toms Masark, Jana Novotn, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski |
| 2022 | Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. | Zhenjian Lu, Igor C. Oliveira, Marius Zimand |
| 2022 | Backdoor Sets on Nowhere Dense SAT. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan |
| 2022 | On Lower Bounds of Approximating Parameterized k-Clique. | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
| 2022 | Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. | Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang |
| 2022 | Parameterized Complexity of Untangling Knots. | Clment Legrand-Duchesne, Ashutosh Rai, Martin Tancer |
| 2022 | The Manifold Joys of Sampling (Invited Talk). | Yin Tat Lee, Santosh S. Vempala |
| 2022 | Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. | Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak |
| 2022 | Near-Optimal Decremental Hopsets with Applications. | Jakub Lacki, Yasamin Nazari |
| 2022 | Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game. | William Kuszmaul, Shyam Narayanan |
| 2022 | Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. | Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul |
| 2022 | Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts. | Shimon Kogan, Merav Parter |
| 2022 | A Study of Weisfeiler-Leman Colorings on Planar Graphs. | Sandra Kiefer, Daniel Neuen |
| 2022 | A Faster Interior-Point Method for Sum-Of-Squares Optimization. | Shunhua Jiang, Bento Natura, Omri Weinstein |
| 2022 | A PTAS for Packing Hypercubes into a Knapsack. | Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas |