| 2022 | On the Binary and Boolean Rank of Regular Matrices. | Ishay Haviv, Michal Parnas |
| 2022 | Dispersing Obnoxious Facilities on Graphs by Rounding Distances. | Tim A. Hartmann, Stefan Lendl |
| 2022 | The Hamilton Compression of Highly Symmetric Graphs. | Petr Gregor, Arturo Merino, Torsten Mtze |
| 2022 | Approximation Algorithms for Covering Vertices by Long Paths. | Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano |
| 2022 | Graph Similarity Based on Matrix Norms. | Timo Gervens, Martin Grohe |
| 2022 | Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. | Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2022 | A Robust Class of Languages of 2-Nested Words. | Sverine Fratani, Guillaume Maurras, Pierre-Alain Reynier |
| 2022 | Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | Non-Determinism in Lindenmayer Systems and Global Transformations. | Alexandre Fernandez, Luidnel Maignan, Antoine Spicher |
| 2022 | On the Number of Quantifiers as a Complexity Measure. | Ronald Fagin, Jonathan Lenchner, Nikhil Vyas, R. Ryan Williams |
| 2022 | CNF Encodings of Parity. | Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin |
| 2022 | Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. | Anton Ehrmanntraut, Fabian Egidy, Christian Glaer |
| 2022 | Regular Monoidal Languages. | Matthew Earnshaw, Pawel Sobocinski |
| 2022 | On the Identity Problem for Unitriangular Matrices of Dimension Four. | Ruiwen Dong |
| 2022 | Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. | Dariusz Dereniowski, Izajasz P. Wrosz |
| 2022 | New Lower Bounds and Upper Bounds for Listing Avoidable Vertices. | Mingyang Deng, Virginia Vassilevska Williams, Ziqian Zhong |
| 2022 | Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. | Julian D'Costa, Engel Lefaucheux, Eike Neumann, Jol Ouaknine, James Worrell |
| 2022 | The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. | Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Jol Ouaknine, Mahmoud Salamati, James Worrell |
| 2022 | Enumeration Classes Defined by Circuits. | Nadia Creignou, Arnaud Durand, Heribert Vollmer |
| 2022 | Cohomology in Constraint Satisfaction and Structure Isomorphism. | Adam Conghaile |
| 2022 | A Complexity Approach to Tree Algebras: the Polynomial Case. | Thomas Colcombet, Arthur Jaquard |
| 2022 | Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus. | Alexandre Clment, Simon Perdrix |
| 2022 | LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits. | Alexandre Clment, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benot Valiron |
| 2022 | On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. | Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen |
| 2022 | Higher-Order Quantified Boolean Satisfiability. | Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti |