LIPIcs, Volume 241, MFCS 2022

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