<h2>LIPIcs, Volume 138, MFCS 2019</h2>
<ul>
<li>
<span class="authors">Peter Rossmanith, Pinar Heggernes, and Joost-Pieter Katoen</span>
<span class="title">LIPIcs, Volume 138, MFCS'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019">10.4230/LIPIcs.MFCS.2019</a>
</li>
<li>
<span class="authors">Peter Rossmanith, Pinar Heggernes, and Joost-Pieter Katoen</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.0">10.4230/LIPIcs.MFCS.2019.0</a>
</li>
<li>
<span class="authors">Mohammad Abdulaziz, Kurt Mehlhorn, and Tobias Nipkow</span>
<span class="title">Trustworthy Graph Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.1">10.4230/LIPIcs.MFCS.2019.1</a>
</li>
<li>
<span class="authors">Alexandra Silva</span>
<span class="title">Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.2">10.4230/LIPIcs.MFCS.2019.2</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov</span>
<span class="title">Picking Random Vertices (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.3">10.4230/LIPIcs.MFCS.2019.3</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Popular Matchings: Good, Bad, and Mixed (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.4">10.4230/LIPIcs.MFCS.2019.4</a>
</li>
<li>
<span class="authors">Jérôme Leroux</span>
<span class="title">Petri Net Reachability Problem (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.5">10.4230/LIPIcs.MFCS.2019.5</a>
</li>
<li>
<span class="authors">Marcin Bienkowski and Hsiang-Hsuan Liu</span>
<span class="title">An Improved Online Algorithm for the Traveling Repairperson Problem on a Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.6">10.4230/LIPIcs.MFCS.2019.6</a>
</li>
<li>
<span class="authors">Magnús M. Halldórsson and Murilo Santos de Lima</span>
<span class="title">Query-Competitive Sorting with Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.7">10.4230/LIPIcs.MFCS.2019.7</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Jarosław Byrka, Marek Chrobak, Christian Coester, Łukasz Jeż, and Elias Koutsoupias</span>
<span class="title">Better Bounds for Online Line Chasing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.8">10.4230/LIPIcs.MFCS.2019.8</a>
</li>
<li>
<span class="authors">Patricia Bouyer and Nathan Thomasset</span>
<span class="title">Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.9">10.4230/LIPIcs.MFCS.2019.9</a>
</li>
<li>
<span class="authors">Paweł Parys</span>
<span class="title">Parity Games: Zielonka’s Algorithm in Quasi-Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.10">10.4230/LIPIcs.MFCS.2019.10</a>
</li>
<li>
<span class="authors">Guy Avni, Thomas A. Henzinger, and Đorđe Žikelić</span>
<span class="title">Bidding Mechanisms in Graph Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.11">10.4230/LIPIcs.MFCS.2019.11</a>
</li>
<li>
<span class="authors">Athanasios L. Konstantinidis and Charis Papadopoulos</span>
<span class="title">Cluster Deletion on Interval Graphs and Split Related Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.12">10.4230/LIPIcs.MFCS.2019.12</a>
</li>
<li>
<span class="authors">Hoang-Oanh Le and Van Bang Le</span>
<span class="title">Constrained Representations of Map Graphs and Half-Squares</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.13">10.4230/LIPIcs.MFCS.2019.13</a>
</li>
<li>
<span class="authors">Barnaby Martin, Daniël Paulusma, and Siani Smith</span>
<span class="title">Colouring H-Free Graphs of Bounded Diameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.14">10.4230/LIPIcs.MFCS.2019.14</a>
</li>
<li>
<span class="authors">Victor Chepoi, Arnaud Labourel, and Sébastien Ratel</span>
<span class="title">Distance Labeling Schemes for Cube-Free Median Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.15">10.4230/LIPIcs.MFCS.2019.15</a>
</li>
<li>
<span class="authors">Emanuel Kieroński</span>
<span class="title">One-Dimensional Guarded Fragments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.16">10.4230/LIPIcs.MFCS.2019.16</a>
</li>
<li>
<span class="authors">Daniel Danielski and Emanuel Kieroński</span>
<span class="title">Finite Satisfiability of Unary Negation Fragment with Transitivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.17">10.4230/LIPIcs.MFCS.2019.17</a>
</li>
<li>
<span class="authors">Ian Pratt-Hartmann and Lidia Tendera</span>
<span class="title">The Fluted Fragment with Transitivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.18">10.4230/LIPIcs.MFCS.2019.18</a>
</li>
<li>
<span class="authors">Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, and Fan Yang</span>
<span class="title">Counting of Teams in First-Order Team Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.19">10.4230/LIPIcs.MFCS.2019.19</a>
</li>
<li>
<span class="authors">Zeev Nutov, Guy Kortsarz, and Eli Shalom</span>
<span class="title">Approximating Activation Edge-Cover and Facility Location Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.20">10.4230/LIPIcs.MFCS.2019.20</a>
</li>
<li>
<span class="authors">Christian Konrad and Viktor Zamaraev</span>
<span class="title">Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.21">10.4230/LIPIcs.MFCS.2019.21</a>
</li>
<li>
<span class="authors">Evripidis Bampis, Bruno Escoffier, and Alexandre Teiller</span>
<span class="title">Multistage Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.22">10.4230/LIPIcs.MFCS.2019.22</a>
</li>
<li>
<span class="authors">Olivier Bournez and Arnaud Durand</span>
<span class="title">Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.23">10.4230/LIPIcs.MFCS.2019.23</a>
</li>
<li>
<span class="authors">Michele Boreale</span>
<span class="title">On the Coalgebra of Partial Differential Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.24">10.4230/LIPIcs.MFCS.2019.24</a>
</li>
<li>
<span class="authors">Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander Melnikov, Karen Seidel, and Frank Stephan</span>
<span class="title">Random Subgroups of Rationals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.25">10.4230/LIPIcs.MFCS.2019.25</a>
</li>
<li>
<span class="authors">Julian Dörfler, Marc Roth, Johannes Schmitt, and Philip Wellnitz</span>
<span class="title">Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.26">10.4230/LIPIcs.MFCS.2019.26</a>
</li>
<li>
<span class="authors">Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, and Meirav Zehavi</span>
<span class="title">Packing Arc-Disjoint Cycles in Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.27">10.4230/LIPIcs.MFCS.2019.27</a>
</li>
<li>
<span class="authors">Jayakrishnan Madathil, Roohani Sharma, and Meirav Zehavi</span>
<span class="title">A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.28">10.4230/LIPIcs.MFCS.2019.28</a>
</li>
<li>
<span class="authors">Diego Figueira, Varun Ramanathan, and Pascal Weil</span>
<span class="title">The Quantifier Alternation Hierarchy of Synchronous Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.29">10.4230/LIPIcs.MFCS.2019.29</a>
</li>
<li>
<span class="authors">Anantha Padmanabha and R. Ramanujam</span>
<span class="title">Two variable fragment of Term Modal Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.30">10.4230/LIPIcs.MFCS.2019.30</a>
</li>
<li>
<span class="authors">Erich Grädel and Svenja Schalthöfer</span>
<span class="title">Choiceless Logarithmic Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.31">10.4230/LIPIcs.MFCS.2019.31</a>
</li>
<li>
<span class="authors">Radovan Červený and Ondřej Suchý</span>
<span class="title">Faster FPT Algorithm for 5-Path Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.32">10.4230/LIPIcs.MFCS.2019.32</a>
</li>
<li>
<span class="authors">Dušan Knop, Tomáš Masařík, and Tomáš Toufar</span>
<span class="title">Parameterized Complexity of Fair Vertex Evaluation Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.33">10.4230/LIPIcs.MFCS.2019.33</a>
</li>
<li>
<span class="authors">Lars Jaffke and Paloma T. Lima</span>
<span class="title">A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.34">10.4230/LIPIcs.MFCS.2019.34</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, and Saket Saurabh</span>
<span class="title">Parameterized Complexity of Conflict-Free Matchings and Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.35">10.4230/LIPIcs.MFCS.2019.35</a>
</li>
<li>
<span class="authors">Victor Lagerkvist and Gustav Nordh</span>
<span class="title">On the Strength of Uniqueness Quantification in Primitive Positive Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.36">10.4230/LIPIcs.MFCS.2019.36</a>
</li>
<li>
<span class="authors">Michal Garlík</span>
<span class="title">Resolution Lower Bounds for Refutation Statements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.37">10.4230/LIPIcs.MFCS.2019.37</a>
</li>
<li>
<span class="authors">Eva Fluck</span>
<span class="title">Tangles and Single Linkage Hierarchical Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.38">10.4230/LIPIcs.MFCS.2019.38</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">Approximating the Orthogonality Dimension of Graphs and Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.39">10.4230/LIPIcs.MFCS.2019.39</a>
</li>
<li>
<span class="authors">Carl Einarson and Felix Reidl</span>
<span class="title">Domination Above r-Independence: Does Sparseness Help?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.40">10.4230/LIPIcs.MFCS.2019.40</a>
</li>
<li>
<span class="authors">Esther Galby, Paloma T. Lima, and Bernard Ries</span>
<span class="title">Reducing the Domination Number of Graphs via Edge Contractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.41">10.4230/LIPIcs.MFCS.2019.41</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, Thekla Hamm, and O-joung Kwon</span>
<span class="title">Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.42">10.4230/LIPIcs.MFCS.2019.42</a>
</li>
<li>
<span class="authors">Markus Lohrey and Armin Weiß</span>
<span class="title">The Power Word Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.43">10.4230/LIPIcs.MFCS.2019.43</a>
</li>
<li>
<span class="authors">Joel D. Day, Florin Manea, and Dirk Nowotka</span>
<span class="title">Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.44">10.4230/LIPIcs.MFCS.2019.44</a>
</li>
<li>
<span class="authors">Sandra Kiefer and Daniel Neuen</span>
<span class="title">The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.45">10.4230/LIPIcs.MFCS.2019.45</a>
</li>
<li>
<span class="authors">Nathalie Aubrun, Sebastián Barbieri, and Etienne Moutot</span>
<span class="title">The Domino Problem is Undecidable on Surface Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.46">10.4230/LIPIcs.MFCS.2019.46</a>
</li>
<li>
<span class="authors">Titus Dose</span>
<span class="title">P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.47">10.4230/LIPIcs.MFCS.2019.47</a>
</li>
<li>
<span class="authors">Mathieu Hoyrup and Donald M. Stull</span>
<span class="title">Semicomputable Points in Euclidean Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.48">10.4230/LIPIcs.MFCS.2019.48</a>
</li>
<li>
<span class="authors">Nicola Galesi, Dmitry Itsykson, Artur Riazanov, and Anastasia Sofronova</span>
<span class="title">Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.49">10.4230/LIPIcs.MFCS.2019.49</a>
</li>
<li>
<span class="authors">Pierre Clairambault and Andrzej S. Murawski</span>
<span class="title">On the Expressivity of Linear Recursion Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.50">10.4230/LIPIcs.MFCS.2019.50</a>
</li>
<li>
<span class="authors">Florent Koechlin, Cyril Nicaud, and Pablo Rotondo</span>
<span class="title">Uniform Random Expressions Lack Expressivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.51">10.4230/LIPIcs.MFCS.2019.51</a>
</li>
<li>
<span class="authors">C. Ramya and B. V. Raghavendra Rao</span>
<span class="title">Lower Bounds for Multilinear Order-Restricted ABPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.52">10.4230/LIPIcs.MFCS.2019.52</a>
</li>
<li>
<span class="authors">Nikhil Gupta and Chandan Saha</span>
<span class="title">On the Symmetries of and Equivalence Test for Design Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.53">10.4230/LIPIcs.MFCS.2019.53</a>
</li>
<li>
<span class="authors">Jan Böker, Yijia Chen, Martin Grohe, and Gaurav Rattan</span>
<span class="title">The Complexity of Homomorphism Indistinguishability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.54">10.4230/LIPIcs.MFCS.2019.54</a>
</li>
<li>
<span class="authors">Titouan Carette, Dominic Horsman, and Simon Perdrix</span>
<span class="title">SZX-Calculus: Scalable Graphical Quantum Reasoning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.55">10.4230/LIPIcs.MFCS.2019.55</a>
</li>
<li>
<span class="authors">Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, and Csaba D. Tóth</span>
<span class="title">On the Stretch Factor of Polygonal Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.56">10.4230/LIPIcs.MFCS.2019.56</a>
</li>
<li>
<span class="authors">Jessica Enright, Kitty Meeks, George B. Mertzios, and Viktor Zamaraev</span>
<span class="title">Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.57">10.4230/LIPIcs.MFCS.2019.57</a>
</li>
<li>
<span class="authors">Christoph Berkholz and Nicole Schweikardt</span>
<span class="title">Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.58">10.4230/LIPIcs.MFCS.2019.58</a>
</li>
<li>
<span class="authors">Amirhossein Kazeminia and Andrei A. Bulatov</span>
<span class="title">Counting Homomorphisms Modulo a Prime Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.59">10.4230/LIPIcs.MFCS.2019.59</a>
</li>
<li>
<span class="authors">Andrei A. Bulatov and Stanislav Živný</span>
<span class="title">Approximate Counting CSP Seen from the Other Side</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.60">10.4230/LIPIcs.MFCS.2019.60</a>
</li>
<li>
<span class="authors">Nathan Lhote, Vincent Michielini, and Michał Skrzypczak</span>
<span class="title">Uniformisation Gives the Full Strength of Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.61">10.4230/LIPIcs.MFCS.2019.61</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński, Sławomir Lasota, Christof Löding, and Radosław Piórkowski</span>
<span class="title">New Pumping Technique for 2-Dimensional VASS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.62">10.4230/LIPIcs.MFCS.2019.62</a>
</li>
<li>
<span class="authors">Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, and Petra Wolf</span>
<span class="title">Computational Complexity of Synchronization under Regular Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.63">10.4230/LIPIcs.MFCS.2019.63</a>
</li>
<li>
<span class="authors">Torben Hagerup</span>
<span class="title">A Constant-Time Colored Choice Dictionary with Almost Robust Iteration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.64">10.4230/LIPIcs.MFCS.2019.64</a>
</li>
<li>
<span class="authors">Surender Baswana, Shiv Gupta, and Ayush Tulsyan</span>
<span class="title">Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.65">10.4230/LIPIcs.MFCS.2019.65</a>
</li>
<li>
<span class="authors">Raphaël Clifford, Paweł Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, and Przemysław Uznański</span>
<span class="title">RLE Edit Distance in Near Optimal Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.66">10.4230/LIPIcs.MFCS.2019.66</a>
</li>
<li>
<span class="authors">Sankardeep Chakraborty and Kunihiko Sadakane</span>
<span class="title">Indexing Graph Search Trees and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.67">10.4230/LIPIcs.MFCS.2019.67</a>
</li>
<li>
<span class="authors">Alberto Dennunzio, Enrico Formenti, Darij Grinberg, and Luciano Margara</span>
<span class="title">Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.68">10.4230/LIPIcs.MFCS.2019.68</a>
</li>
<li>
<span class="authors">Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, and Gabriele Puppis</span>
<span class="title">On Synthesis of Resynchronizers for Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.69">10.4230/LIPIcs.MFCS.2019.69</a>
</li>
<li>
<span class="authors">Paul C. Bell and Mika Hirvensalo</span>
<span class="title">Acceptance Ambiguity for Quantum Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.70">10.4230/LIPIcs.MFCS.2019.70</a>
</li>
<li>
<span class="authors">Philip Bille and Inge Li Gørtz</span>
<span class="title">From Regular Expression Matching to Parsing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.71">10.4230/LIPIcs.MFCS.2019.71</a>
</li>
<li>
<span class="authors">Erhard Aichinger</span>
<span class="title">Solving Systems of Equations in Supernilpotent Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.72">10.4230/LIPIcs.MFCS.2019.72</a>
</li>
<li>
<span class="authors">Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, and Kunihiro Wasa</span>
<span class="title">Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.73">10.4230/LIPIcs.MFCS.2019.73</a>
</li>
<li>
<span class="authors">Serge Gaspers and Ray Li</span>
<span class="title">Enumeration of Preferred Extensions in Almost Oriented Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.74">10.4230/LIPIcs.MFCS.2019.74</a>
</li>
<li>
<span class="authors">Théodore Lopez, Benjamin Monmege, and Jean-Marc Talbot</span>
<span class="title">Determinisation of Finitely-Ambiguous Copyless Cost Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.75">10.4230/LIPIcs.MFCS.2019.75</a>
</li>
<li>
<span class="authors">Manfred Droste and Paul Gastin</span>
<span class="title">Aperiodic Weighted Automata and Weighted First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.76">10.4230/LIPIcs.MFCS.2019.76</a>
</li>
<li>
<span class="authors">Pierre Ganty, Elena Gutiérrez, and Pedro Valero</span>
<span class="title">A Congruence-based Perspective on Automata Minimization Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.77">10.4230/LIPIcs.MFCS.2019.77</a>
</li>
<li>
<span class="authors">Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, and David Wehner</span>
<span class="title">Finding Optimal Solutions With Neighborly Help</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.78">10.4230/LIPIcs.MFCS.2019.78</a>
</li>
<li>
<span class="authors">Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, and Xiao Zhou</span>
<span class="title">Reconfiguration of Minimum Steiner Trees via Vertex Exchanges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.79">10.4230/LIPIcs.MFCS.2019.79</a>
</li>
<li>
<span class="authors">Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, and Kunihiro Wasa</span>
<span class="title">The Perfect Matching Reconfiguration Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.80">10.4230/LIPIcs.MFCS.2019.80</a>
</li>
<li>
<span class="authors">Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, and Alexandra Kolla</span>
<span class="title">Spectral Aspects of Symmetric Matrix Signings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.81">10.4230/LIPIcs.MFCS.2019.81</a>
</li>
<li>
<span class="authors">Stefan Kiefer and Cas Widdershoven</span>
<span class="title">Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.82">10.4230/LIPIcs.MFCS.2019.82</a>
</li>
<li>
<span class="authors">Paul C. Bell, Igor Potapov, and Pavel Semukhin</span>
<span class="title">On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2019.83">10.4230/LIPIcs.MFCS.2019.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