| 2022 | On Extended Boundary Sequences of Morphic and Sturmian Words. | Michel Rigo, Manon Stipulanti, Markus A. Whiteland |
| 2022 | An Exact Algorithm for Knot-Free Vertex Deletion. | M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2022 | On Uniformization in the Full Binary Tree. | Alexander Rabinovich |
| 2022 | Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. | Dominik Peteler, Karin Quaas |
| 2022 | Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. | Jakub Michaliszyn, Jan Otop |
| 2022 | Exact Matching in Graphs of Bounded Independence Number. | Nicolas El Maalouly, Raphael Steiner |
| 2022 | A Universal Skolem Set of Positive Lower Density. | Florian Luca, Jol Ouaknine, James Worrell |
| 2022 | Membership Problems in Finite Groups. | Markus Lohrey, Andreas Rosowski, Georg Zetzsche |
| 2022 | Streaming Word Problems. | Markus Lohrey, Lukas Lck |
| 2022 | Generalized Bundled Fragments for First-Order Modal Logic. | Mo Liu, Anantha Padmanabha, R. Ramanujam, Yanjing Wang |
| 2022 | Reducing the Vertex Cover Number via Edge Contractions. | Paloma T. Lima, Vincius Fernandes dos Santos, Ignasi Sau, Uverton S. Souza, Prafullkumar Tale |
| 2022 | Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. | Hong-Oanh Le, Van Bang Le |
| 2022 | Probabilistic Model Checking for Strategic Equilibria-Based Decision Making: Advances and Challenges (Invited Talk). | Marta Kwiatkowska, Gethin Norman, David Parker, Gabriel Santos, Rui Yan |
| 2022 | SAT-Based Circuit Local Improvement. | Alexander S. Kulikov, Danila Pechenev, Nikita Slezkin |
| 2022 | Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. | Christian Komusiewicz, Nils Morawietz |
| 2022 | Rabbits Approximate, Cows Compute Exactly! | Balagopal Komarath, Anurag Pandey, Nitin Saurabh |
| 2022 | Countdown μ-Calculus. | Jedrzej Kolodziejski, Bartek Klin |
| 2022 | Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. | Zhuan Khye Koh, Georg Loho |
| 2022 | The Complexity of Computing Optimum Labelings for Temporal Connectivity. | Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis |
| 2022 | On the Skolem Problem for Reversible Sequences. | George Kenison |
| 2022 | Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games. | Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris |
| 2022 | Automating OBDD proofs is NP-hard. | Dmitry Itsykson, Artur Riazanov |
| 2022 | Independent Set Reconfiguration on Directed Graphs. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa |
| 2022 | Modern Dynamic Data Structures (Invited Talk). | Monika Henzinger |
| 2022 | Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. | Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips |