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