| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2022 | Analyzing XOR-Forrelation Through Stochastic Calculus. | Xinyu Wu |
| 2022 | Sharp Indistinguishability Bounds from Non-Uniform Approximations. | Christopher Williamson |
| 2022 | High Quality Consistent Digital Curved Rays via Vector Field Rounding. | Takeshi Tokuyama, Ryo Yoshimura |
| 2022 | Optimal Oracles for Point-To-Set Principles. | Donald M. Stull |
| 2022 | NP-Completeness of Perfect Matching Index of Cubic Graphs. | Martin Skoviera, Peter Varsa |
| 2022 | Superlinear Lower Bounds Based on ETH. | Andrs Z. Salamon, Michael Wehar |
| 2022 | A Relativization Perspective on Meta-Complexity. | Hanlin Ren, Rahul Santhanam |
| 2022 | On Finer Separations Between Subclasses of Read-Once Oblivious ABPs. | C. Ramya, Anamay Tengse |
| 2022 | Compact Representation for Matrices of Bounded Twin-Width. | Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz |
| 2022 | Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM). | Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Guillaume Theyssier |
| 2022 | Isolation Schemes for Problems on Decomposable Graphs. | Jesper Nederlof, Michal Pilipczuk, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2022 | One-Way Communication Complexity and Non-Adaptive Decision Trees. | Nikhil S. Mande, Swagato Sanyal, Suhail Sherif |
| 2022 | Extending the Reach of the Point-To-Set Principle. | Jack H. Lutz, Neil Lutz, Elvira Mayordomo |
| 2022 | Scheduling with Communication Delay in Near-Linear Time. | Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
| 2022 | Determining a Slater Winner Is Complete for Parallel Access to NP. | Michael Lampis |
| 2022 | Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk). | Fabian Kuhn |
| 2022 | One-To-Two-Player Lifting for Mildly Growing Memory. | Alexander Kozachinskiy |
| 2022 | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. | Tomohiro Koana, Christian Komusiewicz, Andr Nichterlein, Frank Sommer |
| 2022 | Fairly Popular Matchings and Optimality. | Telikepalli Kavitha |
| 2022 | Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. | Mamadou Moustapha Kant, Eun Jung Kim, O-joung Kwon, Sang-il Oum |
| 2022 | Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. | Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh |
| 2022 | Classes of Intersection Digraphs with Good Algorithmic Properties. | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2022 | Satisfiability of Circuits and Equations over Finite Malcev Algebras. | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
| 2022 | Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. | Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilgyi |