| 2022 | Selectable Heaps and Optimal Lazy Search Trees. | Bryce Sandlund, Lingyi Zhang |
| 2022 | Compact Redistricting Plans Have Many Spanning Trees. | Ariel D. Procaccia, Jamie Tucker-Foltz |
| 2022 | On the complexity of binary polynomial optimization over acyclic hypergraphs. | Alberto Del Pia, Silvia Di Gregorio |
| 2022 | Limits of Preprocessing for Single-Server PIR. | Giuseppe Persiano, Kevin Yeo |
| 2022 | Planar Multiway Cut with Terminals on Few Faces. | Sukanya Pandey, Erik Jan van Leeuwen |
| 2022 | Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. | Daniel Neuen |
| 2022 | Congruency-Constrained TU Problems Beyond the Bimodular Case. | Martin Ngele, Richard Santiago, Rico Zenklusen |
| 2022 | Approximate Core for Committee Selection via Multilinear Extension and Market Clearing. | Kamesh Munagala, Yiheng Shen, Kangning Wang, Zhiyi Wang |
| 2022 | A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. | Dniel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale |
| 2022 | Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. | Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu |
| 2022 | Balanced Allocations: Caching and Packing, Twinning and Thinning. | Dimitrios Los, Thomas Sauerwald, John Sylvester |
| 2022 | Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2022 | Optimal Sorting Circuits for Short Keys. | Wei-Kai Lin, Elaine Shi |
| 2022 | Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. | Shi Li, Bundit Laekhanukit |
| 2022 | Multi-token Markov Game with Switching Costs. | Jian Li, Daogao Liu |
| 2022 | Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. | Hung Le, Cuong Than |
| 2022 | Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. | Hung Le, Shay Solomon |
| 2022 | Recognizing <italic>k</italic>-leaf powers in polynomial time, for constant <italic>k</italic>. | Manuel Lafond |
| 2022 | Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. | Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg |
| 2022 | Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. | Marvin Knnemann, Andr Nusser |
| 2022 | Strong recovery of geometric planted matchings. | Dmitriy Kunisky, Jonathan Niles-Weed |
| 2022 | Average Sensitivity of Dynamic Programming. | Soh Kumabe, Yuichi Yoshida |
| 2022 | New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier. | Shimon Kogan, Merav Parter |
| 2022 | Competitive Strategies for Symmetric Rendezvous on the Line. | Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran |
| 2022 | Collapsing the Tower - On the Complexity of Multistage Stochastic IPs. | Kim-Manuel Klein, Janina Reuter |