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