LIPIcs, Volume 138, MFCS 2019

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