| 2022 | Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. | Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski |
| 2022 | Existential Definability over the Subword Ordering. | Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2022 | Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk). | Maria-Florina Balcan |
| 2022 | Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk). | Marie Albenque |
| 2022 | Approximability of Robust Network Design: The Directed Case. | Yacine Al-Najjar, Walid Ben-Ameur, Jrmie Leguay |
| 2022 | Mapping Networks via Parallel kth-Hop Traceroute Queries. | Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda |
| 2022 | If VNP Is Hard, Then so Are Equations for It. | Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse |
| 2022 | Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths. | Yung-Chung Chiu, Hsueh-I Lu |
| 2022 | Symmetry and Quantum Query-To-Communication Simulation. | Sourav Chakraborty, Arkadev Chattopadhyay, Peter Hyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf |
| 2022 | On Robustness for the Skolem and Positivity Problems. | S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala |
| 2022 | Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. | Slawomir Lasota |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2021 | Quantum Approximate Counting with Nonadaptive Grover Iterations. | Ramgopal Venkateswaran, Ryan O'Donnell |
| 2021 | On the Fluted Fragment (Invited Talk). | Lidia Tendera |
| 2021 | Resolution with Symmetry Rule Applied to Linear Equations. | Pascal Schweitzer, Constantin Seebach |
| 2021 | 6-Uniform Maker-Breaker Game Is PSPACE-Complete. | Md Lutfar Rahman, Thomas Watson |
| 2021 | Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. | Marta Piecyk, Pawel Rzazewski |
| 2021 | Complexity of the List Homomorphism Problem in Hereditary Graph Classes. | Karolina Okrasa, Pawel Rzazewski |
| 2021 | An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. | Meike Neuwohner |
| 2021 | First-Order Transductions of Graphs (Invited Talk). | Patrice Ossona de Mendez |
| 2021 | Subgroup Membership in GL(2, Z). | Markus Lohrey |
| 2021 | Exploiting Dense Structures in Parameterized Complexity. | William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. | Shaohua Li, Marcin Pilipczuk, Manuel Sorge |
| 2021 | Absorbing Patterns in BST-Like Expression-Trees. | Florent Koechlin, Pablo Rotondo |
| 2021 | Binary Matrix Completion Under Diameter Constraints. | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |