| 2022 | Data Structures for Node Connectivity Queries. | Zeev Nutov |
| 2022 | A Unified Framework for Hopsets. | Ofer Neiman, Idan Shabat |
| 2022 | The Pareto Cover Problem. | Bento Natura, Meike Neuwohner, Stefan Weltge |
| 2022 | Computing Treedepth in Polynomial Space and Linear FPT Time. | Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz |
| 2022 | Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds. | Clment Maria, Owen Rouill |
| 2022 | (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. | Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen |
| 2022 | Cardinality Estimation Using Gumbel Distribution. | Aleksander Lukasiewicz, Przemyslaw Uznanski |
| 2022 | Average Sensitivity of the Knapsack Problem. | Soh Kumabe, Yuichi Yoshida |
| 2022 | Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams. | Lex de Kogel, Marc J. van Kreveld, Jordi L. Vermeulen |
| 2022 | Scheduling Kernels via Configuration LP. | Dusan Knop, Martin Kouteck |
| 2022 | Approximation Algorithms for Round-UFP and Round-SAP. | Debajyoti Kar, Arindam Khan, Andreas Wiese |
| 2022 | Vertex Sparsifiers for Hyperedge Connectivity. | Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang |
| 2022 | Embedding Phylogenetic Trees in Networks of Low Treewidth. | Leo van Iersel, Mark Jones, Mathias Weller |
| 2022 | Maximum Weight b-Matchings in Random-Order Streams. | Chien-Chung Huang, Franois Sellier |
| 2022 | Chromatic k-Nearest Neighbor Queries. | Thijs van der Horst, Maarten Lffler, Frank Staals |
| 2022 | O(1) Steiner Point Removal in Series-Parallel Graphs. | D. Ellis Hershkowitz, Jason Li |
| 2022 | Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. | Monika Henzinger, Ami Paz, A. R. Sricharan |
| 2022 | Hedonic Games and Treewidth Revisited. | Tesshu Hanaka, Michael Lampis |
| 2022 | Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. | Bernhard Haepler, D. Ellis Hershkowitz, Goran Zuzic |
| 2022 | Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. | Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt |
| 2022 | Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. | Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi |
| 2022 | Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2022 | Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. | Younan Gao, Meng He |
| 2022 | Taming Graphs with No Large Creatures and Skinny Ladders. | Jakub Gajarsk, Lars Jaffke, Paloma T. Lima, Jana Novotn, Marcin Pilipczuk, Pawel Rzazewski, Uverton S. Souza |
| 2022 | Simple Worst-Case Optimal Adaptive Prefix-Free Coding. | Travis Gagie |