| 2022 | 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, Vienna, Austria, August 22-26, 2022 Stefan Szeider, Robert Ganian, Alexandra Silva |
| 2022 | A Complexity Approach to Tree Algebras: the Polynomial Case. Thomas Colcombet, Arthur Jaquard |
| 2022 | A Robust Class of Languages of 2-Nested Words. Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier |
| 2022 | A Universal Skolem Set of Positive Lower Density. Florian Luca, Joël Ouaknine, James Worrell |
| 2022 | Algebraic Representations of Unique Bipartite Perfect Matching. Gal Beniamini |
| 2022 | An Exact Algorithm for Knot-Free Vertex Deletion. M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2022 | An Updated Survey of Bidding Games on Graphs (Invited Talk). Guy Avni, Thomas A. Henzinger |
| 2022 | Approximation Algorithms for Covering Vertices by Long Paths. Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano |
| 2022 | Automating OBDD proofs is NP-hard. Dmitry Itsykson, Artur Riazanov |
| 2022 | Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. Zhuan Khye Koh, Georg Loho |
| 2022 | Boundaries to Single-Agent Stability in Additively Separable Hedonic Games. Martin Bullinger |
| 2022 | Bounded Degree Nonnegative Counting CSP. Jin-Yi Cai, Daniel P. Szabo |
| 2022 | Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell |
| 2022 | CNF Encodings of Parity. Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin |
| 2022 | Cohomology in Constraint Satisfaction and Structure Isomorphism. Adam Ó Conghaile |
| 2022 | Comonadic semantics for hybrid logic. Samson Abramsky, Dan Marsden |
| 2022 | Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions. Robert I. Booth, Titouan Carette |
| 2022 | Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. Hoàng-Oanh Le, Van Bang Le |
| 2022 | Computing the Minimum Bottleneck Moving Spanning Tree. Haitao Wang, Yiming Zhao |
| 2022 | Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew |
| 2022 | Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. Dariusz Dereniowski, Izajasz P. Wrosz |
| 2022 | Continuous Rational Functions Are Deterministic Regular. Olivier Carton, Gaëtan Douéneau-Tabot |
| 2022 | Countdown μ-Calculus. Jedrzej Kolodziejski, Bartek Klin |
| 2022 | Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. Dominik Peteler, Karin Quaas |
| 2022 | Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. Niclas Boehmer, Klaus Heeger, Rolf Niedermeier |
| 2022 | Dispersing Obnoxious Facilities on Graphs by Rounding Distances. Tim A. Hartmann, Stefan Lendl |
| 2022 | Enumeration Classes Defined by Circuits. Nadia Creignou, Arnaud Durand, Heribert Vollmer |
| 2022 | Exact Matching in Graphs of Bounded Independence Number. Nicolas El Maalouly, Raphael Steiner |
| 2022 | Extending Partial Representations of Circle Graphs in Near-Linear Time. Guido Brückner, Ignaz Rutter, Peter Stumpf |
| 2022 | Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. Christian Komusiewicz, Nils Morawietz |
| 2022 | Fixed-Point Cycles and Approximate EFX Allocations. Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma |
| 2022 | Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips |
| 2022 | Generalized Bundled Fragments for First-Order Modal Logic. Mo Liu, Anantha Padmanabha, R. Ramanujam, Yanjing Wang |
| 2022 | Graph Realization of Distance Sets. Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
| 2022 | Graph Similarity Based on Matrix Norms. Timo Gervens, Martin Grohe |
| 2022 | Higher-Order Causal Theories Are Models of BV-Logic. Will Simmons, Aleks Kissinger |
| 2022 | Higher-Order Quantified Boolean Satisfiability. Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti |
| 2022 | Improved Approximation Algorithms for the Traveling Tournament Problem. Jingyang Zhao, Mingyu Xiao, Chao Xu |
| 2022 | Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. C. S. Bhargav, Sagnik Dutta, Nitin Saxena |
| 2022 | Independent Set Reconfiguration on Directed Graphs. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa |
| 2022 | LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits. Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron |
| 2022 | Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. Jakub Michaliszyn, Jan Otop |
| 2022 | Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | Membership Problems in Finite Groups. Markus Lohrey, Andreas Rosowski, Georg Zetzsche |
| 2022 | Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2022 | Modern Dynamic Data Structures (Invited Talk). Monika Henzinger |
| 2022 | New Lower Bounds and Upper Bounds for Listing Avoidable Vertices. Mingyang Deng, Virginia Vassilevska Williams, Ziqian Zhong |
| 2022 | Non-Determinism in Lindenmayer Systems and Global Transformations. Alexandre Fernandez, Luidnel Maignan, Antoine Spicher |
| 2022 | Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games. Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris |
| 2022 | On Algorithms Based on Finitely Many Homomorphism Counts. Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun |
| 2022 | On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen |
| 2022 | On Extended Boundary Sequences of Morphic and Sturmian Words. Michel Rigo, Manon Stipulanti, Markus A. Whiteland |
| 2022 | On Kernels for d-Path Vertex Cover. Radovan Cervený, Pratibha Choudhary, Ondrej Suchý |
| 2022 | On Synthesizing Computable Skolem Functions for First Order Logic. Supratik Chakraborty, S. Akshay |
| 2022 | On Uniformization in the Full Binary Tree. Alexander Rabinovich |
| 2022 | On Upward-Planar L-Drawings of Graphs. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo |
| 2022 | On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. Ilario Bonacina, Nicola Galesi, Massimo Lauria |
| 2022 | On the Binary and Boolean Rank of Regular Matrices. Ishay Haviv, Michal Parnas |
| 2022 | On the Identity Problem for Unitriangular Matrices of Dimension Four. Ruiwen Dong |
| 2022 | On the Number of Quantifiers as a Complexity Measure. Ronald Fagin, Jonathan Lenchner, Nikhil Vyas, R. Ryan Williams |
| 2022 | On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz |
| 2022 | On the Skolem Problem for Reversible Sequences. George Kenison |
| 2022 | Online Bipartite Matching and Adwords (Invited Talk). Vijay V. Vazirani |
| 2022 | Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. Anton Ehrmanntraut, Fabian Egidy, Christian Glaßer |
| 2022 | Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh |
| 2022 | Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. David Auger, Pierre Coucheney, Loric Duhaze |
| 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 | RAC Drawings of Graphs with Low Degree. Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister |
| 2022 | Rabbits Approximate, Cows Compute Exactly! Balagopal Komarath, Anurag Pandey, Nitin Saurabh |
| 2022 | Reducing the Vertex Cover Number via Edge Contractions. Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale |
| 2022 | Regular Monoidal Languages. Matthew Earnshaw, Pawel Sobocinski |
| 2022 | Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus. Alexandre Clément, Simon Perdrix |
| 2022 | SAT-Based Circuit Local Improvement. Alexander S. Kulikov, Danila Pechenev, Nikita Slezkin |
| 2022 | Sample Compression Schemes for Balls in Graphs. Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès |
| 2022 | Skolem Meets Schanuel. Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell |
| 2022 | Space-Bounded Unitary Quantum Computation with Postselection. Seiichiro Tani |
| 2022 | Streaming Word Problems. Markus Lohrey, Lukas Lück |
| 2022 | The Complexity of Computing Optimum Labelings for Temporal Connectivity. Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis |
| 2022 | The Complexity of Periodic Energy Minimisation. Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov |
| 2022 | The Hamilton Compression of Highly Symmetric Graphs. Petr Gregor, Arturo Merino, Torsten Mütze |
| 2022 | The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, James Worrell |
| 2022 | Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. Bartosz Bednarczyk, Reijo Jaakkola |
| 2022 | Tree Exploration in Dual-Memory Model. Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski, Dominik Pajak |
| 2022 | Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. Antoine Amarilli, Mikaël Monet |