LIPIcs, Volume 126, STACS 2019

• Rolf Niedermeier and Christophe Paul LIPIcs, Volume 126, STACS'19, Complete Volume 10.4230/LIPIcs.STACS.2019
• Rolf Niedermeier and Christophe Paul Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2019.0
• Leslie Ann Goldberg Computational Complexity and Partition Functions (Invited Talk) 10.4230/LIPIcs.STACS.2019.1
• Anca Muscholl and Gabriele Puppis The Many Facets of String Transducers (Invited Talk) 10.4230/LIPIcs.STACS.2019.2
• Petra Mutzel Algorithmic Data Science (Invited Talk) 10.4230/LIPIcs.STACS.2019.3
• Karl Bringmann Fine-Grained Complexity Theory (Tutorial) 10.4230/LIPIcs.STACS.2019.4
• Tobias Friedrich From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) 10.4230/LIPIcs.STACS.2019.5
• Shaull Almagor, Joël Ouaknine, and James Worrell The Semialgebraic Orbit Problem 10.4230/LIPIcs.STACS.2019.6
• Spyros Angelopoulos, Christoph Dürr, and Shendan Jin Best-Of-Two-Worlds Analysis of Online Search 10.4230/LIPIcs.STACS.2019.7
• Boris Aronov, Omrit Filtser, Matthew J. Katz, and Khadijeh Sheikhan Bipartite Diameter and Other Measures Under Translation 10.4230/LIPIcs.STACS.2019.8
• David Auger, Pierre Coucheney, and Yann Strozecki Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland’s Rule 10.4230/LIPIcs.STACS.2019.9
• Étienne Bamas and Louis Esperet Distributed Coloring of Graphs with an Optimal Number of Colors 10.4230/LIPIcs.STACS.2019.10
• Max Bannach and Till Tantau On the Descriptive Complexity of Color Coding 10.4230/LIPIcs.STACS.2019.11
• Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, and Troy Lee Bounding Quantum-Classical Separations for Classes of Nonlocal Games 10.4230/LIPIcs.STACS.2019.12
• Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, and Florian Sikora Token Sliding on Split Graphs 10.4230/LIPIcs.STACS.2019.13
• Olaf Beyersdorff, Joshua Blinkhorn, and Meena Mahajan Building Strategies into QBF Proofs 10.4230/LIPIcs.STACS.2019.14
• Alexander Birx and Yann Disser Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line 10.4230/LIPIcs.STACS.2019.15
• Marthe Bonamy, Oscar Defrain, Marc Heinrich, and Jean-Florent Raymond Enumerating Minimal Dominating Sets in Triangle-Free Graphs 10.4230/LIPIcs.STACS.2019.16
• Silvia Butti and Stanislav Živný Sparsification of Binary CSPs 10.4230/LIPIcs.STACS.2019.17
• Florent Capelli and Stefan Mengel Tractable QBF by Knowledge Compilation 10.4230/LIPIcs.STACS.2019.18
• Parinya Chalermsook, Andreas Schmid, and Sumedha Uniyal A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs 10.4230/LIPIcs.STACS.2019.19
• Matthew Cook and Turlough Neary Average-Case Completeness in Tag Systems 10.4230/LIPIcs.STACS.2019.20
• Ágnes Cseh and Attila Juhos Pairwise Preferences in the Stable Marriage Problem 10.4230/LIPIcs.STACS.2019.21
• María Emilia Descotte, Diego Figueira, and Santiago Figueira Closure Properties of Synchronized Relations 10.4230/LIPIcs.STACS.2019.22
• Julien Destombes and Andrei Romashchenko Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts 10.4230/LIPIcs.STACS.2019.23
• Martin Dietzfelbinger and Stefan Walzer Constant-Time Retrieval with O(log m) Extra Bits 10.4230/LIPIcs.STACS.2019.24
• Eduard Eiben, Dušan Knop, Fahad Panolan, and Ondřej Suchý Complexity of the Steiner Network Problem with Respect to the Number of Terminals 10.4230/LIPIcs.STACS.2019.25
• Faith Ellen, Rati Gelashvili, Philipp Woelfel, and Leqi Zhu Space Lower Bounds for the Signal Detection Problem 10.4230/LIPIcs.STACS.2019.26
• Grzegorz Fabiański, Michał Pilipczuk, Sebastian Siebertz, and Szymon Toruńczyk Progressive Algorithms for Domination and Independence 10.4230/LIPIcs.STACS.2019.27
• Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos Modification to Planarity is Fixed Parameter Tractable 10.4230/LIPIcs.STACS.2019.28
• Moses Ganardi Visibly Pushdown Languages over Sliding Windows 10.4230/LIPIcs.STACS.2019.29
• Paweł Gawrychowski, Florin Manea, and Radosław Serafin Fast and Longest Rollercoasters 10.4230/LIPIcs.STACS.2019.30
• Kurtuluş Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, and Georgios Piliouras Wealth Inequality and the Price of Anarchy 10.4230/LIPIcs.STACS.2019.31
• Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, and Dimitrios M. Thilikos Lean Tree-Cut Decompositions: Obstructions and Algorithms 10.4230/LIPIcs.STACS.2019.32
• Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, and Gerhard J. Woeginger Dispersing Obnoxious Facilities on a Graph 10.4230/LIPIcs.STACS.2019.33
• Chetan Gupta, Vimal Raj Sharma, and Raghunath Tewari Reachability in O(log n) Genus Graphs is in Unambiguous Logspace 10.4230/LIPIcs.STACS.2019.34
• Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, and David Saulpic Dominating Sets and Connected Dominating Sets in Dynamic Graphs 10.4230/LIPIcs.STACS.2019.35
• Eva-Maria C. Hols and Stefan Kratsch On Kernelization for Edge Dominating Set under Structural Parameters 10.4230/LIPIcs.STACS.2019.36
• Derek Holt, Markus Lohrey, and Saul Schleimer Compressed Decision Problems in Hyperbolic Groups 10.4230/LIPIcs.STACS.2019.37
• Felix Hommelsheim, Moritz Mühlenthaler, and Oliver Schaudt How to Secure Matchings Against Edge Failures 10.4230/LIPIcs.STACS.2019.38
• Bart M. P. Jansen, Marcin Pilipczuk, and Erik Jan van Leeuwen A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs 10.4230/LIPIcs.STACS.2019.39
• Emmanuel Jeandel and Pascal Vanier A Characterization of Subshifts with Computable Language 10.4230/LIPIcs.STACS.2019.40
• Stasys Jukna and Andrzej Lingas Lower Bounds for DeMorgan Circuits of Bounded Negation Width 10.4230/LIPIcs.STACS.2019.41
• Shahbaz Khan and Shashank K. Mehta Depth First Search in the Semi-streaming Model 10.4230/LIPIcs.STACS.2019.42
• Stefan Kiefer and Corto Mascle On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words 10.4230/LIPIcs.STACS.2019.43
• Dušan Knop, Michał Pilipczuk, and Marcin Wrochna Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints 10.4230/LIPIcs.STACS.2019.44
• Robert Krauthgamer and Ohad Trabelsi The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern 10.4230/LIPIcs.STACS.2019.45
• Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, and Sebastian Siebertz Algorithmic Properties of Sparse Digraphs 10.4230/LIPIcs.STACS.2019.46
• Patrick Landwehr and Christof Löding Tree Automata with Global Constraints for Infinite Trees 10.4230/LIPIcs.STACS.2019.47
• Kasper Green Larsen Constructive Discrepancy Minimization with Hereditary L2 Guarantees 10.4230/LIPIcs.STACS.2019.48
• François Le Gall, Harumichi Nishimura, and Ansis Rosmanis Quantum Advantage for the LOCAL Model in Distributed Computing 10.4230/LIPIcs.STACS.2019.49
• Bruno Loff and Sagnik Mukhopadhyay Lifting Theorems for Equality 10.4230/LIPIcs.STACS.2019.50
• Kelin Luo, Thomas Erlebach, and Yinfeng Xu Car-Sharing on a Star Network: On-Line Scheduling with k Servers 10.4230/LIPIcs.STACS.2019.51
• Gregor Matl and Stanislav Živný Beyond Boolean Surjective VCSPs 10.4230/LIPIcs.STACS.2019.52
• Antoine Mottet and Karin Quaas The Containment Problem for Unambiguous Register Automata 10.4230/LIPIcs.STACS.2019.53
• Pál András Papp and Roger Wattenhofer Stabilization Time in Weighted Minority Processes 10.4230/LIPIcs.STACS.2019.54
• Erik Paul Finite Sequentiality of Unambiguous Max-Plus Tree Automata 10.4230/LIPIcs.STACS.2019.55
• Enoch Peserico Paging with Dynamic Memory Capacity 10.4230/LIPIcs.STACS.2019.56
• Gleb Posobin and Alexander Shen Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension 10.4230/LIPIcs.STACS.2019.57
• Sandeep Sen A Unified Approach to Tail Estimates for Randomized Incremental Construction 10.4230/LIPIcs.STACS.2019.58
• Thomas Watson A ZPP^NP[1] Lifting Theorem 10.4230/LIPIcs.STACS.2019.59