<h2>LIPIcs, Volume 170, MFCS 2020</h2>
<ul>
<li>
<span class="authors">Javier Esparza and Daniel Král'</span>
<span class="title">LIPIcs, Volume 170, MFCS 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020">10.4230/LIPIcs.MFCS.2020</a>
</li>
<li>
<span class="authors">Javier Esparza and Daniel Král'</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.0">10.4230/LIPIcs.MFCS.2020.0</a>
</li>
<li>
<span class="authors">Nathalie Bertrand</span>
<span class="title">Concurrent Games with Arbitrarily Many Players (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.1">10.4230/LIPIcs.MFCS.2020.1</a>
</li>
<li>
<span class="authors">Sergio Cabello</span>
<span class="title">Some Open Problems in Computational Geometry (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.2">10.4230/LIPIcs.MFCS.2020.2</a>
</li>
<li>
<span class="authors">Mary Wootters</span>
<span class="title">List-Decodability of Structured Ensembles of Codes (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.3">10.4230/LIPIcs.MFCS.2020.3</a>
</li>
<li>
<span class="authors">Deniz Ağaoğlu and Petr Hliněný</span>
<span class="title">Isomorphism Problem for S_d-Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.4">10.4230/LIPIcs.MFCS.2020.4</a>
</li>
<li>
<span class="authors">Jungho Ahn, Eduard Eiben, O-joung Kwon, and Sang-il Oum</span>
<span class="title">A Polynomial Kernel for 3-Leaf Power Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.5">10.4230/LIPIcs.MFCS.2020.5</a>
</li>
<li>
<span class="authors">Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, and Hossein Vahidi</span>
<span class="title">Complexity of Computing the Anti-Ramsey Numbers for Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.6">10.4230/LIPIcs.MFCS.2020.6</a>
</li>
<li>
<span class="authors">Susanne Albers, Arindam Khan, and Leon Ladewig</span>
<span class="title">Best Fit Bin Packing with Random Order Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.7">10.4230/LIPIcs.MFCS.2020.7</a>
</li>
<li>
<span class="authors">Andris Ambainis, Kaspars Balodis, Jānis Iraids, Kamil Khadiev, Vladislavs Kļevickis, Krišjānis Prūsis, Yixin Shen, Juris Smotrovs, and Jevgēnijs Vihrovs</span>
<span class="title">Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.8">10.4230/LIPIcs.MFCS.2020.8</a>
</li>
<li>
<span class="authors">Boris Aronov, Matthew J. Katz, and Elad Sulami</span>
<span class="title">Dynamic Time Warping-Based Proximity Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.9">10.4230/LIPIcs.MFCS.2020.9</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay</span>
<span class="title">A Special Case of Rational Identity Testing and the Brešar-Klep Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.10">10.4230/LIPIcs.MFCS.2020.10</a>
</li>
<li>
<span class="authors">Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, and Malte Skambath</span>
<span class="title">Solving Packing Problems with Few Small Items Using Rainbow Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.11">10.4230/LIPIcs.MFCS.2020.11</a>
</li>
<li>
<span class="authors">Pierre Béaur and Jarkko Kari</span>
<span class="title">Decidability in Group Shifts and Group Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.12">10.4230/LIPIcs.MFCS.2020.12</a>
</li>
<li>
<span class="authors">Arpitha P. Bharathi and Monaldo Mastrolilli</span>
<span class="title">Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.13">10.4230/LIPIcs.MFCS.2020.13</a>
</li>
<li>
<span class="authors">Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, and Chrysanthi Raftopoulou</span>
<span class="title">Layered Fan-Planar Graph Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.14">10.4230/LIPIcs.MFCS.2020.14</a>
</li>
<li>
<span class="authors">Davide Bilò, Vittorio Bilò, Pascal Lenzner, and Louise Molitor</span>
<span class="title">Topological Influence and Locality in Swap Schelling Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.15">10.4230/LIPIcs.MFCS.2020.15</a>
</li>
<li>
<span class="authors">Arindam Biswas, Venkatesh Raman, and Saket Saurabh</span>
<span class="title">Approximation in (Poly-) Logarithmic Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.16">10.4230/LIPIcs.MFCS.2020.16</a>
</li>
<li>
<span class="authors">Markus Bläser and Vladimir Lysikov</span>
<span class="title">Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.17">10.4230/LIPIcs.MFCS.2020.17</a>
</li>
<li>
<span class="authors">Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, and Bertrand Simon</span>
<span class="title">Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.18">10.4230/LIPIcs.MFCS.2020.18</a>
</li>
<li>
<span class="authors">Mikołaj Bojańczyk and Janusz Schmude</span>
<span class="title">Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.19">10.4230/LIPIcs.MFCS.2020.19</a>
</li>
<li>
<span class="authors">Jan Bok, Richard Brewster, Tomás Feder, Pavol Hell, and Nikola Jedličková</span>
<span class="title">List Homomorphism Problems for Signed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.20">10.4230/LIPIcs.MFCS.2020.20</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Angelo Montanari, Adriano Peron, and Pietro Sala</span>
<span class="title">On a Temporal Logic of Prefixes and Infixes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.21">10.4230/LIPIcs.MFCS.2020.21</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, and Jakub Svoboda</span>
<span class="title">Simplified Game of Life: Algorithms and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.22">10.4230/LIPIcs.MFCS.2020.22</a>
</li>
<li>
<span class="authors">Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, and Chunhao Wang</span>
<span class="title">Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.23">10.4230/LIPIcs.MFCS.2020.23</a>
</li>
<li>
<span class="authors">Alexandre Clément and Simon Perdrix</span>
<span class="title">PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.24">10.4230/LIPIcs.MFCS.2020.24</a>
</li>
<li>
<span class="authors">Alessio Conte, Pierluigi Crescenzi, Andrea Marino, and Giulia Punzi</span>
<span class="title">Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.25">10.4230/LIPIcs.MFCS.2020.25</a>
</li>
<li>
<span class="authors">Arjan Cornelissen, Stacey Jeffery, Maris Ozols, and Alvaro Piedrafita</span>
<span class="title">Span Programs and Quantum Time Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.26">10.4230/LIPIcs.MFCS.2020.26</a>
</li>
<li>
<span class="authors">Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, and Viktor Zamaraev</span>
<span class="title">Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.27">10.4230/LIPIcs.MFCS.2020.27</a>
</li>
<li>
<span class="authors">Palash Dey, Jaikumar Radhakrishnan, and Santhoshini Velusamy</span>
<span class="title">Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.28">10.4230/LIPIcs.MFCS.2020.28</a>
</li>
<li>
<span class="authors">Gaëtan Douéneau-Tabot, Emmanuel Filiot, and Paul Gastin</span>
<span class="title">Register Transducers Are Marble Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.29">10.4230/LIPIcs.MFCS.2020.29</a>
</li>
<li>
<span class="authors">Pavol Ďuriš, Rastislav Královič, Richard Královič, Dana Pardubská, Martin Pašen, and Peter Rossmanith</span>
<span class="title">Randomization in Non-Uniform Finite Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.30">10.4230/LIPIcs.MFCS.2020.30</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg</span>
<span class="title">Extending Nearly Complete 1-Planar Drawings in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.31">10.4230/LIPIcs.MFCS.2020.31</a>
</li>
<li>
<span class="authors">Yury Elkin and Vitaliy Kurlin</span>
<span class="title">The Mergegram of a Dendrogram and Its Stability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.32">10.4230/LIPIcs.MFCS.2020.32</a>
</li>
<li>
<span class="authors">Henning Fernau, Petra Wolf, and Tomoyuki Yamakami</span>
<span class="title">Synchronizing Deterministic Push-Down Automata Can Be Really Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.33">10.4230/LIPIcs.MFCS.2020.33</a>
</li>
<li>
<span class="authors">Nathanaël Fijalkow, Paweł Gawrychowski, and Pierre Ohlmann</span>
<span class="title">Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.34">10.4230/LIPIcs.MFCS.2020.34</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Danil Sagunov, and Kirill Simonov</span>
<span class="title">Building Large k-Cores from Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.35">10.4230/LIPIcs.MFCS.2020.35</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, and Andrés Herrera-Poyatos</span>
<span class="title">The Complexity of Approximating the Complex-Valued Potts Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.36">10.4230/LIPIcs.MFCS.2020.36</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, and James Stewart</span>
<span class="title">Fast Algorithms for General Spin Systems on Bipartite Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.37">10.4230/LIPIcs.MFCS.2020.37</a>
</li>
<li>
<span class="authors">Paul D. Gallot, Aurélien Lemay, and Sylvain Salvati</span>
<span class="title">Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.38">10.4230/LIPIcs.MFCS.2020.38</a>
</li>
<li>
<span class="authors">Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, and Xin Zhang</span>
<span class="title">Graph Clustering in All Parameter Regimes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.39">10.4230/LIPIcs.MFCS.2020.39</a>
</li>
<li>
<span class="authors">Pierre Ganty, Elena Gutiérrez, and Pedro Valero</span>
<span class="title">A Quasiorder-Based Perspective on Residual Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.40">10.4230/LIPIcs.MFCS.2020.40</a>
</li>
<li>
<span class="authors">Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, and Igor Razgon</span>
<span class="title">Fractional Covers of Hypergraphs with Bounded Multi-Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.41">10.4230/LIPIcs.MFCS.2020.41</a>
</li>
<li>
<span class="authors">Zeyu Guo</span>
<span class="title">Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.42">10.4230/LIPIcs.MFCS.2020.42</a>
</li>
<li>
<span class="authors">Chetan Gupta, Vimal Raj Sharma, and Raghunath Tewari</span>
<span class="title">Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.43">10.4230/LIPIcs.MFCS.2020.43</a>
</li>
<li>
<span class="authors">Emirhan Gürpınar and Andrei Romashchenko</span>
<span class="title">Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.44">10.4230/LIPIcs.MFCS.2020.44</a>
</li>
<li>
<span class="authors">Kristoffer Arnsfelt Hansen and Steffan Christ Sølvsten</span>
<span class="title">∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.45">10.4230/LIPIcs.MFCS.2020.45</a>
</li>
<li>
<span class="authors">Hiroshi Hirai and Ryuhei Mizutani</span>
<span class="title">Minimum 0-Extension Problems on Directed Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.46">10.4230/LIPIcs.MFCS.2020.46</a>
</li>
<li>
<span class="authors">Svein Høgemo, Christophe Paul, and Jan Arne Telle</span>
<span class="title">Hierarchical Clusterings of Unweighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.47">10.4230/LIPIcs.MFCS.2020.47</a>
</li>
<li>
<span class="authors">Stefan Jaax and Stefan Kiefer</span>
<span class="title">On Affine Reachability Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.48">10.4230/LIPIcs.MFCS.2020.48</a>
</li>
<li>
<span class="authors">Lars Jaffke, Paloma T. Lima, and Geevarghese Philip</span>
<span class="title">Structural Parameterizations of Clique Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.49">10.4230/LIPIcs.MFCS.2020.49</a>
</li>
<li>
<span class="authors">Lars Jaffke, Mateus de Oliveira Oliveira, and Hans Raj Tiwary</span>
<span class="title">Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.50">10.4230/LIPIcs.MFCS.2020.50</a>
</li>
<li>
<span class="authors">Ismaël Jecker, Orna Kupferman, and Nicolas Mazzocchi</span>
<span class="title">Unary Prime Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.51">10.4230/LIPIcs.MFCS.2020.51</a>
</li>
<li>
<span class="authors">Vít Jelínek, Michal Opler, and Jakub Pekárek</span>
<span class="title">A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.52">10.4230/LIPIcs.MFCS.2020.52</a>
</li>
<li>
<span class="authors">Dhawal Jethwani, François Le Gall, and Sanjay K. Singh</span>
<span class="title">Quantum-Inspired Classical Algorithms for Singular Value Transformation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.53">10.4230/LIPIcs.MFCS.2020.53</a>
</li>
<li>
<span class="authors">Toghrul Karimov, Joël Ouaknine, and James Worrell</span>
<span class="title">On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.54">10.4230/LIPIcs.MFCS.2020.54</a>
</li>
<li>
<span class="authors">Piotr Kawałek and Jacek Krzaczkowski</span>
<span class="title">Even Faster Algorithms for CSAT Over supernilpotent Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.55">10.4230/LIPIcs.MFCS.2020.55</a>
</li>
<li>
<span class="authors">Michal Konečný, Florian Steinberg, and Holger Thies</span>
<span class="title">Continuous and Monotone Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.56">10.4230/LIPIcs.MFCS.2020.56</a>
</li>
<li>
<span class="authors">Jan Kratochvíl, Tomáš Masařík, and Jana Novotná</span>
<span class="title">U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.57">10.4230/LIPIcs.MFCS.2020.57</a>
</li>
<li>
<span class="authors">Denis Kuperberg and Jan Martens</span>
<span class="title">Regular Resynchronizability of Origin Transducers Is Undecidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.58">10.4230/LIPIcs.MFCS.2020.58</a>
</li>
<li>
<span class="authors">Orna Kupferman and Ofer Leshkowitz</span>
<span class="title">On Repetition Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.59">10.4230/LIPIcs.MFCS.2020.59</a>
</li>
<li>
<span class="authors">Kazuhiro Kurita and Yasuaki Kobayashi</span>
<span class="title">Efficient Enumerations for Minimal Multicuts and Multiway Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.60">10.4230/LIPIcs.MFCS.2020.60</a>
</li>
<li>
<span class="authors">Dietrich Kuske and Christian Schwarz</span>
<span class="title">Complexity of Counting First-Order Logic for the Subword Order</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.61">10.4230/LIPIcs.MFCS.2020.61</a>
</li>
<li>
<span class="authors">Sophie Laplante, Reza Naserasr, and Anupa Sunny</span>
<span class="title">Sensitivity Lower Bounds from Linear Dependencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.62">10.4230/LIPIcs.MFCS.2020.62</a>
</li>
<li>
<span class="authors">Paloma T. Lima, Erik Jan van Leeuwen, and Marieke van der Wegen</span>
<span class="title">Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.63">10.4230/LIPIcs.MFCS.2020.63</a>
</li>
<li>
<span class="authors">Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau, and Uéverton S. Souza</span>
<span class="title">Reducing Graph Transversals via Edge Contractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.64">10.4230/LIPIcs.MFCS.2020.64</a>
</li>
<li>
<span class="authors">Alexander Lindermayr, Sebastian Siebertz, and Alexandre Vigny</span>
<span class="title">Elimination Distance to Bounded Degree on Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.65">10.4230/LIPIcs.MFCS.2020.65</a>
</li>
<li>
<span class="authors">Sven Linker, Fabio Papacchini, and Michele Sevegnani</span>
<span class="title">Analysing Spatial Properties on Neighbourhood Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.66">10.4230/LIPIcs.MFCS.2020.66</a>
</li>
<li>
<span class="authors">Markus Lohrey and Georg Zetzsche</span>
<span class="title">Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.67">10.4230/LIPIcs.MFCS.2020.67</a>
</li>
<li>
<span class="authors">Raul Lopes and Ignasi Sau</span>
<span class="title">A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.68">10.4230/LIPIcs.MFCS.2020.68</a>
</li>
<li>
<span class="authors">Vincent Michielini and Michał Skrzypczak</span>
<span class="title">Regular Choice Functions and Uniformisations For countable Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.69">10.4230/LIPIcs.MFCS.2020.69</a>
</li>
<li>
<span class="authors">Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, and Roohani Sharma</span>
<span class="title">Quick Separation in Chordal and Split Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.70">10.4230/LIPIcs.MFCS.2020.70</a>
</li>
<li>
<span class="authors">Nils Morawietz, Carolin Rehs, and Mathias Weller</span>
<span class="title">A Timecop’s Work Is Harder Than You Think</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.71">10.4230/LIPIcs.MFCS.2020.71</a>
</li>
<li>
<span class="authors">Janaky Murthy, Vineet Nair, and Chandan Saha</span>
<span class="title">Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.72">10.4230/LIPIcs.MFCS.2020.72</a>
</li>
<li>
<span class="authors">Satyadev Nandakumar and Prateek Vishnoi</span>
<span class="title">Randomness and Effective Dimension of Continued Fractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.73">10.4230/LIPIcs.MFCS.2020.73</a>
</li>
<li>
<span class="authors">Daniel Neider, Patrick Totzke, and Martin Zimmermann</span>
<span class="title">Optimally Resilient Strategies in Pushdown Safety Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.74">10.4230/LIPIcs.MFCS.2020.74</a>
</li>
<li>
<span class="authors">Rian Neogi, M. S. Ramanujan, Saket Saurabh, and Roohani Sharma</span>
<span class="title">On the Parameterized Complexity of Deletion to ℋ-Free Strong Components</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.75">10.4230/LIPIcs.MFCS.2020.75</a>
</li>
<li>
<span class="authors">Mitsunori Ogihara and Kei Uchizawa</span>
<span class="title">Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.76">10.4230/LIPIcs.MFCS.2020.76</a>
</li>
<li>
<span class="authors">Louis Parlant, Jurriaan Rot, Alexandra Silva, and Bas Westerbaan</span>
<span class="title">Preservation of Equations by Monoidal Monads</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.77">10.4230/LIPIcs.MFCS.2020.77</a>
</li>
<li>
<span class="authors">Adam Paszke and Michał Pilipczuk</span>
<span class="title">VC Density of Set Systems Definable in Tree-Like Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.78">10.4230/LIPIcs.MFCS.2020.78</a>
</li>
<li>
<span class="authors">Jarkko Peltomäki and Markus A. Whiteland</span>
<span class="title">All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.79">10.4230/LIPIcs.MFCS.2020.79</a>
</li>
<li>
<span class="authors">Alexander Rabinovich and Doron Tiferet</span>
<span class="title">Ambiguity Hierarchy of Regular Infinite Tree Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.80">10.4230/LIPIcs.MFCS.2020.80</a>
</li>
<li>
<span class="authors">Mikhail Rubinchik and Arseny M. Shur</span>
<span class="title">Palindromic k-Factorization in Pure Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.81">10.4230/LIPIcs.MFCS.2020.81</a>
</li>
<li>
<span class="authors">Ignasi Sau and Uéverton dos Santos Souza</span>
<span class="title">Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.82">10.4230/LIPIcs.MFCS.2020.82</a>
</li>
<li>
<span class="authors">Yasuhiro Takahashi, Yuki Takeuchi, and Seiichiro Tani</span>
<span class="title">Classically Simulating Quantum Circuits with Local Depolarizing Noise</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.83">10.4230/LIPIcs.MFCS.2020.83</a>
</li>
<li>
<span class="authors">Nguyễn Kim Thắng</span>
<span class="title">An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.84">10.4230/LIPIcs.MFCS.2020.84</a>
</li>
<li>
<span class="authors">Caterina Viola and Stanislav Živný</span>
<span class="title">The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.85">10.4230/LIPIcs.MFCS.2020.85</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