LIPIcs, Volume 202, MFCS 2021

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