| 2022 | Unique Assembly Verification in Two-Handed Self-Assembly. | David Caballero, Timothy Gomez, Robert Schweller, Tim Wylie |
| 2022 | Polynomial Delay Algorithm for Minimal Chordal Completions. | Caroline Brosse, Vincent Limouzy, Arnaud Mary |
| 2022 | Improved Sublinear-Time Edit Distance for Preprocessed Strings. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
| 2022 | A Structural Investigation of the Approximability of Polynomial-Time Problems. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Knnemann |
| 2022 | Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. | Karl Bringmann, Alejandro Cassis |
| 2022 | The Complexity of SPEs in Mean-Payoff Games. | Lonard Brice, Jean-Franois Raskin, Marie van den Bogaard |
| 2022 | Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. | Marcin Brianski, Martin Kouteck, Daniel Krl', Kristna Pekrkov, Felix Schrder |
| 2022 | Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices. | Zvika Brakerski, Nico Dttling, Sanjam Garg, Giulio Malavolta |
| 2022 | Strategy Synthesis for Global Window PCTL. | Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-Franois Raskin |
| 2022 | Passive Learning of Deterministic Bchi Automata by Combinations of DFAs. | Len Bohn, Christof Lding |
| 2022 | The Complexity of Finding Fair Many-To-One Matchings. | Niclas Boehmer, Tomohiro Koana |
| 2022 | Privately Estimating Graph Parameters in Sublinear Time. | Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee |
| 2022 | Sublinear-Round Parallel Matroid Intersection. | Joakim Blikstad |
| 2022 | Reconstructing Decision Trees. | Guy Blanc, Jane Lange, Li-Yang Tan |
| 2022 | Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes. | Mitchell Black, Amir Nayyeri |
| 2022 | Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2022 | Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2022 | Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. | Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun |
| 2022 | Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. | Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein |
| 2022 | Deciding Twin-Width at Most 4 Is NP-Complete. | Pierre Berg, douard Bonnet, Hugues Dprs |
| 2022 | Finding Monotone Patterns in Sublinear Time, Adaptively. | Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten |
| 2022 | Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang |
| 2022 | Circuit Extraction for ZX-Diagrams Can Be #P-Hard. | Niel de Beaudrap, Aleks Kissinger, John van de Wetering |
| 2022 | Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. | Surender Baswana, Koustav Bhanja, Abhyuday Pandey |
| 2022 | Unboundedness for Recursion Schemes: A Simpler Type System. | David Barozzini, Pawel Parys, Jan Wroblewski |