<h2>LIPIcs, Volume 202, MFCS 2021</h2>
<ul>
<li>
<span class="authors">Filippo Bonchi and Simon J. Puglisi</span>
<span class="title">LIPIcs, Volume 202, MFCS 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021">10.4230/LIPIcs.MFCS.2021</a>
</li>
<li>
<span class="authors">Filippo Bonchi and Simon J. Puglisi</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.0">10.4230/LIPIcs.MFCS.2021.0</a>
</li>
<li>
<span class="authors">Amina Doumane</span>
<span class="title">Non-Axiomatizability of the Equational Theories of Positive Relation Algebras (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.1">10.4230/LIPIcs.MFCS.2021.1</a>
</li>
<li>
<span class="authors">Martin Grohe</span>
<span class="title">A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.2">10.4230/LIPIcs.MFCS.2021.2</a>
</li>
<li>
<span class="authors">Joël Ouaknine</span>
<span class="title">Holonomic Techniques, Periods, and Decision Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.3">10.4230/LIPIcs.MFCS.2021.3</a>
</li>
<li>
<span class="authors">Eva Rotenberg</span>
<span class="title">On Dynamic Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.4">10.4230/LIPIcs.MFCS.2021.4</a>
</li>
<li>
<span class="authors">Barna Saha</span>
<span class="title">Sublinear Algorithms for Edit Distance (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.5">10.4230/LIPIcs.MFCS.2021.5</a>
</li>
<li>
<span class="authors">Mahmoud Abo-Khamis, Ryan Curtin, Sungjin Im, Benjamin Moseley, Hung Ngo, Kirk Pruhs, and Alireza Samadian</span>
<span class="title">An Approximation Algorithm for the Matrix Tree Multiplication Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.6">10.4230/LIPIcs.MFCS.2021.6</a>
</li>
<li>
<span class="authors">Eric Allender, Archit Chauhan, and Samir Datta</span>
<span class="title">Depth-First Search in Directed Planar Graphs, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.7">10.4230/LIPIcs.MFCS.2021.7</a>
</li>
<li>
<span class="authors">Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, and Petra Wolf</span>
<span class="title">Order Reconfiguration Under Width Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.8">10.4230/LIPIcs.MFCS.2021.8</a>
</li>
<li>
<span class="authors">Pablo Arrighi, Marin Costes, and Nathanaël Eon</span>
<span class="title">Universal Gauge-Invariant Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.9">10.4230/LIPIcs.MFCS.2021.9</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay</span>
<span class="title">Equivalence Testing of Weighted Automata over Partially Commutative Monoids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.10">10.4230/LIPIcs.MFCS.2021.10</a>
</li>
<li>
<span class="authors">Kristina Asimi and Libor Barto</span>
<span class="title">Finitely Tractable Promise Constraint Satisfaction Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.11">10.4230/LIPIcs.MFCS.2021.11</a>
</li>
<li>
<span class="authors">David Auger, Xavier Badin de Montjoye, and Yann Strozecki</span>
<span class="title">A Generic Strategy Improvement Method for Simple Stochastic Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.12">10.4230/LIPIcs.MFCS.2021.12</a>
</li>
<li>
<span class="authors">Paolo Baldan, Alberto Carraro, and Tommaso Padoan</span>
<span class="title">(Un)Decidability for History Preserving True Concurrent Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.13">10.4230/LIPIcs.MFCS.2021.13</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, and Kirill Simonov</span>
<span class="title">Parameterized Complexity of Feature Selection for Categorical Data Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.14">10.4230/LIPIcs.MFCS.2021.14</a>
</li>
<li>
<span class="authors">Paul C. Bell and Pavel Semukhin</span>
<span class="title">Decision Questions for Probabilistic Automata on Small Alphabets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.15">10.4230/LIPIcs.MFCS.2021.15</a>
</li>
<li>
<span class="authors">Arpitha P. Bharathi and Monaldo Mastrolilli</span>
<span class="title">Ideal Membership Problem for Boolean Minority and Dual Discriminator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.16">10.4230/LIPIcs.MFCS.2021.16</a>
</li>
<li>
<span class="authors">Siddharth Bhaskar and Robin Kaarsgaard</span>
<span class="title">Graph Traversals as Universal Constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.17">10.4230/LIPIcs.MFCS.2021.17</a>
</li>
<li>
<span class="authors">Davide Bilò, Sarel Cohen, Tobias Friedrich, and Martin Schirneck</span>
<span class="title">Space-Efficient Fault-Tolerant Diameter Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.18">10.4230/LIPIcs.MFCS.2021.18</a>
</li>
<li>
<span class="authors">Achim Blumensath and Jakub Lédl</span>
<span class="title">ω-Forest Algebras and Temporal Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.19">10.4230/LIPIcs.MFCS.2021.19</a>
</li>
<li>
<span class="authors">León Bohn and Christof Löding</span>
<span class="title">Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.20">10.4230/LIPIcs.MFCS.2021.20</a>
</li>
<li>
<span class="authors">Jan Bok, Jiří Fiala, Petr Hliněný, Nikola Jedličková, and Jan Kratochvíl</span>
<span class="title">Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.21">10.4230/LIPIcs.MFCS.2021.21</a>
</li>
<li>
<span class="authors">Cyril Branciard, Alexandre Clément, Mehdi Mhalla, and Simon Perdrix</span>
<span class="title">Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.22">10.4230/LIPIcs.MFCS.2021.22</a>
</li>
<li>
<span class="authors">Marcin Briański, Stefan Felsner, Jędrzej Hodor, and Piotr Micek</span>
<span class="title">Reconfiguring Independent Sets on Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.23">10.4230/LIPIcs.MFCS.2021.23</a>
</li>
<li>
<span class="authors">Florian Bruse, Marco Sälzer, and Martin Lange</span>
<span class="title">Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.24">10.4230/LIPIcs.MFCS.2021.24</a>
</li>
<li>
<span class="authors">Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, and Max van Mulken</span>
<span class="title">Dots & Boxes Is PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.25">10.4230/LIPIcs.MFCS.2021.25</a>
</li>
<li>
<span class="authors">Kevin Buchin, Maarten Löffler, Aleksandr Popov, and Marcel Roeloffzen</span>
<span class="title">Uncertain Curve Simplification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.26">10.4230/LIPIcs.MFCS.2021.26</a>
</li>
<li>
<span class="authors">Silvia Butti and Víctor Dalmau</span>
<span class="title">Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.27">10.4230/LIPIcs.MFCS.2021.27</a>
</li>
<li>
<span class="authors">Arnaldo Cesco and Roberto Gorrieri</span>
<span class="title">A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.28">10.4230/LIPIcs.MFCS.2021.28</a>
</li>
<li>
<span class="authors">Brynmor K. Chapman and R. Ryan Williams</span>
<span class="title">Black-Box Hypotheses and Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.29">10.4230/LIPIcs.MFCS.2021.29</a>
</li>
<li>
<span class="authors">Kostia Chardonnet, Benoît Valiron, and Renaud Vilmart</span>
<span class="title">Geometry of Interaction for ZX-Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.30">10.4230/LIPIcs.MFCS.2021.30</a>
</li>
<li>
<span class="authors">Siddhesh Chaubal and Anna Gál</span>
<span class="title">Diameter Versus Certificate Complexity of Boolean Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.31">10.4230/LIPIcs.MFCS.2021.31</a>
</li>
<li>
<span class="authors">Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, and R. Vijayaragunathan</span>
<span class="title">Budgeted Dominating Sets in Uncertain Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.32">10.4230/LIPIcs.MFCS.2021.32</a>
</li>
<li>
<span class="authors">Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, and James Worrell</span>
<span class="title">On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.33">10.4230/LIPIcs.MFCS.2021.33</a>
</li>
<li>
<span class="authors">Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, and James Worrell</span>
<span class="title">The Pseudo-Skolem Problem is Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.34">10.4230/LIPIcs.MFCS.2021.34</a>
</li>
<li>
<span class="authors">Ugo Dal Lago, Reinhard Kahle, and Isabel Oitavem</span>
<span class="title">A Recursion-Theoretic Characterization of the Probabilistic Class PP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.35">10.4230/LIPIcs.MFCS.2021.35</a>
</li>
<li>
<span class="authors">Samir Datta and Kishlaya Jaiswal</span>
<span class="title">Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.36">10.4230/LIPIcs.MFCS.2021.36</a>
</li>
<li>
<span class="authors">Anuj Dawar and Danny Vagnozzi</span>
<span class="title">On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.37">10.4230/LIPIcs.MFCS.2021.37</a>
</li>
<li>
<span class="authors">Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S. Oliveira, and Ana Silva</span>
<span class="title">Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.38">10.4230/LIPIcs.MFCS.2021.38</a>
</li>
<li>
<span class="authors">Max A. Deppert, Klaus Jansen, and Kim-Manuel Klein</span>
<span class="title">Fuzzy Simultaneous Congruences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.39">10.4230/LIPIcs.MFCS.2021.39</a>
</li>
<li>
<span class="authors">Gaëtan Douéneau-Tabot</span>
<span class="title">Pebble Transducers with Unary Output</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.40">10.4230/LIPIcs.MFCS.2021.40</a>
</li>
<li>
<span class="authors">Amina Doumane</span>
<span class="title">Graph Characterization of the Universal Theory of Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.41">10.4230/LIPIcs.MFCS.2021.41</a>
</li>
<li>
<span class="authors">Gabriel L. Duarte, Mateus de Oliveira Oliveira, and Uéverton S. Souza</span>
<span class="title">Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.42">10.4230/LIPIcs.MFCS.2021.42</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe</span>
<span class="title">Isometric Embeddings in Trees and Their Use in Distance Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.43">10.4230/LIPIcs.MFCS.2021.43</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe</span>
<span class="title">On Computing the Average Distance for Some Chordal-Like Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.44">10.4230/LIPIcs.MFCS.2021.44</a>
</li>
<li>
<span class="authors">Maël Dumas, Anthony Perez, and Ioan Todinca</span>
<span class="title">A Cubic Vertex-Kernel for Trivially Perfect Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.45">10.4230/LIPIcs.MFCS.2021.45</a>
</li>
<li>
<span class="authors">Robert Ferens, Marek Szykuła, and Vojtěch Vorel</span>
<span class="title">Lower Bounds on Avoiding Thresholds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.46">10.4230/LIPIcs.MFCS.2021.46</a>
</li>
<li>
<span class="authors">Marie Fortin, Louwe B. Kuijer, Patrick Totzke, and Martin Zimmermann</span>
<span class="title">HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.47">10.4230/LIPIcs.MFCS.2021.47</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski, Florin Manea, and Stefan Siemer</span>
<span class="title">Matching Patterns with Variables Under Hamming Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.48">10.4230/LIPIcs.MFCS.2021.48</a>
</li>
<li>
<span class="authors">Yoan Géran, Bastien Laboureix, Corto Mascle, and Valentin D. Richard</span>
<span class="title">Keyboards as a New Model of Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.49">10.4230/LIPIcs.MFCS.2021.49</a>
</li>
<li>
<span class="authors">Adam Glos, Martins Kokainis, Ryuhei Mori, and Jevgēnijs Vihrovs</span>
<span class="title">Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.50">10.4230/LIPIcs.MFCS.2021.50</a>
</li>
<li>
<span class="authors">Nathan Grosshans</span>
<span class="title">A Note on the Join of Varieties of Monoids with LI</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.51">10.4230/LIPIcs.MFCS.2021.51</a>
</li>
<li>
<span class="authors">Hermann Gruber and Markus Holzer</span>
<span class="title">Optimal Regular Expressions for Palindromes of Given Length</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.52">10.4230/LIPIcs.MFCS.2021.52</a>
</li>
<li>
<span class="authors">Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann</span>
<span class="title">A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.53">10.4230/LIPIcs.MFCS.2021.53</a>
</li>
<li>
<span class="authors">Gregory Gutin and Anders Yeo</span>
<span class="title">Perfect Forests in Graphs and Their Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.54">10.4230/LIPIcs.MFCS.2021.54</a>
</li>
<li>
<span class="authors">Christoph Haase and Alessio Mansutti</span>
<span class="title">On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.55">10.4230/LIPIcs.MFCS.2021.55</a>
</li>
<li>
<span class="authors">Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, and Kevin Verbeek</span>
<span class="title">Obstructing Classification via Projection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.56">10.4230/LIPIcs.MFCS.2021.56</a>
</li>
<li>
<span class="authors">Hovhannes A. Harutyunyan, Denis Pankratov, and Jesse Racicot</span>
<span class="title">Online Domination: The Value of Getting to Know All Your Neighbors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.57">10.4230/LIPIcs.MFCS.2021.57</a>
</li>
<li>
<span class="authors">Daniel Hausmann, Stefan Milius, and Lutz Schröder</span>
<span class="title">A Linear-Time Nominal μ-Calculus with Name Allocation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.58">10.4230/LIPIcs.MFCS.2021.58</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and François Le Gall</span>
<span class="title">Test of Quantumness with Small-Depth Quantum Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.59">10.4230/LIPIcs.MFCS.2021.59</a>
</li>
<li>
<span class="authors">Pavel Hubáček and Jan Václavek</span>
<span class="title">On Search Complexity of Discrete Logarithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.60">10.4230/LIPIcs.MFCS.2021.60</a>
</li>
<li>
<span class="authors">Mirai Ikebuchi</span>
<span class="title">A Homological Condition on Equational Unifiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.61">10.4230/LIPIcs.MFCS.2021.61</a>
</li>
<li>
<span class="authors">Reijo Jaakkola</span>
<span class="title">Ordered Fragments of First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.62">10.4230/LIPIcs.MFCS.2021.62</a>
</li>
<li>
<span class="authors">Petr Jančar and Jiří Šíma</span>
<span class="title">The Simplest Non-Regular Deterministic Context-Free Language</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.63">10.4230/LIPIcs.MFCS.2021.63</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen, Shivesh K. Roy, and Michał Włodarczyk</span>
<span class="title">On the Hardness of Compressing Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.64">10.4230/LIPIcs.MFCS.2021.64</a>
</li>
<li>
<span class="authors">Vít Jelínek, Michal Opler, and Jakub Pekárek</span>
<span class="title">Griddings of Permutations and Hardness of Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.65">10.4230/LIPIcs.MFCS.2021.65</a>
</li>
<li>
<span class="authors">Michael Kaminski and Igor E. Shparlinski</span>
<span class="title">Sets of Linear Forms Which Are Hard to Compute</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.66">10.4230/LIPIcs.MFCS.2021.66</a>
</li>
<li>
<span class="authors">George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, and James Worrell</span>
<span class="title">On Positivity and Minimality for Second-Order Holonomic Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.67">10.4230/LIPIcs.MFCS.2021.67</a>
</li>
<li>
<span class="authors">Bohdan Kivva</span>
<span class="title">Improved Upper Bounds for the Rigidity of Kronecker Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.68">10.4230/LIPIcs.MFCS.2021.68</a>
</li>
<li>
<span class="authors">Hartmut Klauck and Debbie Lim</span>
<span class="title">The Power of One Clean Qubit in Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.69">10.4230/LIPIcs.MFCS.2021.69</a>
</li>
<li>
<span class="authors">Nicolai Kraus, Fredrik Nordvall Forsberg, and Chuangjie Xu</span>
<span class="title">Connecting Constructive Notions of Ordinals in Homotopy Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.70">10.4230/LIPIcs.MFCS.2021.70</a>
</li>
<li>
<span class="authors">Fu Li and Xiong Zheng</span>
<span class="title">Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.71">10.4230/LIPIcs.MFCS.2021.71</a>
</li>
<li>
<span class="authors">Sven Linker, Fabio Papacchini, and Michele Sevegnani</span>
<span class="title">Finite Models for a Spatial Logic with Discrete and Topological Path Operators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.72">10.4230/LIPIcs.MFCS.2021.72</a>
</li>
<li>
<span class="authors">Nikolas Mählmann, Sebastian Siebertz, and Alexandre Vigny</span>
<span class="title">Recursive Backdoors for SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.73">10.4230/LIPIcs.MFCS.2021.73</a>
</li>
<li>
<span class="authors">Caroline Mattes and Armin Weiß</span>
<span class="title">Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.74">10.4230/LIPIcs.MFCS.2021.74</a>
</li>
<li>
<span class="authors">George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, and Philipp Zschoche</span>
<span class="title">The Complexity of Transitively Orienting Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.75">10.4230/LIPIcs.MFCS.2021.75</a>
</li>
<li>
<span class="authors">Hendrik Molter, Malte Renken, and Philipp Zschoche</span>
<span class="title">Temporal Reachability Minimization: Delaying vs. Deleting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.76">10.4230/LIPIcs.MFCS.2021.76</a>
</li>
<li>
<span class="authors">Nils Morawietz and Petra Wolf</span>
<span class="title">A Timecop’s Chase Around the Table</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.77">10.4230/LIPIcs.MFCS.2021.77</a>
</li>
<li>
<span class="authors">Robert S. R. Myers and Henning Urbat</span>
<span class="title">Syntactic Minimization Of Nondeterministic Finite Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.78">10.4230/LIPIcs.MFCS.2021.78</a>
</li>
<li>
<span class="authors">Keisuke Nakano</span>
<span class="title">Idempotent Turing Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.79">10.4230/LIPIcs.MFCS.2021.79</a>
</li>
<li>
<span class="authors">Satyadev Nandakumar and Subin Pulari</span>
<span class="title">Ergodic Theorems and Converses for PSPACE Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.80">10.4230/LIPIcs.MFCS.2021.80</a>
</li>
<li>
<span class="authors">Damian Niwiński and Michał Skrzypczak</span>
<span class="title">On Guidable Index of Tree Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.81">10.4230/LIPIcs.MFCS.2021.81</a>
</li>
<li>
<span class="authors">Giacomo Paesani, Daniël Paulusma, and Paweł Rzążewski</span>
<span class="title">Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.82">10.4230/LIPIcs.MFCS.2021.82</a>
</li>
<li>
<span class="authors">Pál András Papp and Roger Wattenhofer</span>
<span class="title">Stabilization Bounds for Influence Propagation from a Random Initial State</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.83">10.4230/LIPIcs.MFCS.2021.83</a>
</li>
<li>
<span class="authors">Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, and Alina Vdovina</span>
<span class="title">Parameterized (Modular) Counting and Cayley Graph Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.84">10.4230/LIPIcs.MFCS.2021.84</a>
</li>
<li>
<span class="authors">Bader Abu Radi, Orna Kupferman, and Ofer Leshkowitz</span>
<span class="title">A Hierarchy of Nondeterminism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.85">10.4230/LIPIcs.MFCS.2021.85</a>
</li>
<li>
<span class="authors">Hellis Tamm</span>
<span class="title">Boolean Automata and Atoms of Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.86">10.4230/LIPIcs.MFCS.2021.86</a>
</li>
<li>
<span class="authors">Davide Trotta, Matteo Spadetto, and Valeria de Paiva</span>
<span class="title">The Gödel Fibration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.87">10.4230/LIPIcs.MFCS.2021.87</a>
</li>
<li>
<span class="authors">Stelios Tsampas, Christian Williams, Andreas Nuyts, Dominique Devriese, and Frank Piessens</span>
<span class="title">Abstract Congruence Criteria for Weak Bisimilarity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.88">10.4230/LIPIcs.MFCS.2021.88</a>
</li>
<li>
<span class="authors">Renaud Vilmart</span>
<span class="title">Quantum Multiple-Valued Decision Diagrams in Graphical Calculi</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.89">10.4230/LIPIcs.MFCS.2021.89</a>
</li>
<li>
<span class="authors">Sarah Winter</span>
<span class="title">Decision Problems for Origin-Close Top-Down Tree Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2021.90">10.4230/LIPIcs.MFCS.2021.90</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