LIPIcs, Volume 154, STACS 2020

• Christophe Paul and Markus Bläser LIPIcs, Vol. 154, STACS 2020, Complete Volume 10.4230/LIPIcs.STACS.2020
• Christophe Paul and Markus Bläser Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2020.0
• Dana Randall Statistical Physics and Algorithms (Invited Talk) 10.4230/LIPIcs.STACS.2020.1
• Martin Grohe Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk) 10.4230/LIPIcs.STACS.2020.2
• Olivier Bournez Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk) 10.4230/LIPIcs.STACS.2020.3
• Martin C. Cooper, Simon de Givry, and Thomas Schiex Graphical Models: Queries, Complexity, Algorithms (Tutorial) 10.4230/LIPIcs.STACS.2020.4
• Marten Maack and Klaus Jansen Inapproximability Results for Scheduling with Interval and Resource Restrictions 10.4230/LIPIcs.STACS.2020.5
• Jan Philipp Wächter and Armin Weiß An Automaton Group with PSPACE-Complete Word Problem 10.4230/LIPIcs.STACS.2020.6
• Wim Martens, Matthias Niewerth, and Tina Trautner A Trichotomy for Regular Trail Queries 10.4230/LIPIcs.STACS.2020.7
• Antonin Callard and Mathieu Hoyrup Descriptive Complexity on Non-Polish Spaces 10.4230/LIPIcs.STACS.2020.8
• Titus Dose and Christian Glaßer NP-Completeness, Proof Systems, and Disjoint NP-Pairs 10.4230/LIPIcs.STACS.2020.9
• Philip Bille, Inge Li Gørtz, and Teresa Anna Steiner String Indexing with Compressed Patterns 10.4230/LIPIcs.STACS.2020.10
• Yusuke Kobayashi An FPT Algorithm for Minimum Additive Spanner Problem 10.4230/LIPIcs.STACS.2020.11
• Susanne Albers and Maximilian Janke New Bounds for Randomized List Update in the Paid Exchange Model 10.4230/LIPIcs.STACS.2020.12
• Dan Bergren, Eduard Eiben, Robert Ganian, and Iyad Kanj On Covering Segments with Unit Intervals 10.4230/LIPIcs.STACS.2020.13
• Jarkko Kari and Etienne Moutot Decidability and Periodicity of Low Complexity Tilings 10.4230/LIPIcs.STACS.2020.14
• Manuel Lafond, Binhai Zhu, and Peng Zou The Tandem Duplication Distance Is NP-Hard 10.4230/LIPIcs.STACS.2020.15
• Paweł Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, and Marek Szykuła Existential Length Universality 10.4230/LIPIcs.STACS.2020.16
• Walter Hussak and Amitabh Trehan On the Termination of Flooding 10.4230/LIPIcs.STACS.2020.17
• Bartłomiej Dudek, Paweł Gawrychowski, and Tatiana Starikovskaya Generalised Pattern Matching Revisited 10.4230/LIPIcs.STACS.2020.18
• Gregory Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, and Magnus Wahlström Parameterized Pre-Coloring Extension and List Coloring Problems 10.4230/LIPIcs.STACS.2020.19
• Sevag Gharibian, Stephen Piddock, and Justin Yirka Oracle Complexity Classes and Local Measurements on Physical Hamiltonians 10.4230/LIPIcs.STACS.2020.20
• Marius Zimand Secret Key Agreement from Correlated Data, with No Prior Information 10.4230/LIPIcs.STACS.2020.21
• Michał Gańczorz Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before 10.4230/LIPIcs.STACS.2020.22
• Taisuke Izumi, François Le Gall, and Frédéric Magniez Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model 10.4230/LIPIcs.STACS.2020.23
• Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, and Olivier Serre Lower Bounds for Arithmetic Circuits via the Hankel Matrix 10.4230/LIPIcs.STACS.2020.24
• Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, and Maximilian Katzmann Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs 10.4230/LIPIcs.STACS.2020.25
• Nathalie Aubrun, Julien Esnay, and Mathieu Sablik Domino Problem Under Horizontal Constraints 10.4230/LIPIcs.STACS.2020.26
• George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, and Philipp Zschoche Computing Maximum Matchings in Temporal Graphs 10.4230/LIPIcs.STACS.2020.27
• Brieuc Guinard and Amos Korman Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths 10.4230/LIPIcs.STACS.2020.28
• Falko Hegerfeld and Stefan Kratsch Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space 10.4230/LIPIcs.STACS.2020.29
• Mitsuru Funakoshi and Julian Pape-Lange Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements 10.4230/LIPIcs.STACS.2020.30
• Édouard Bonnet, Sergio Cabello, and Wolfgang Mulzer Maximum Matchings in Geometric Intersection Graphs 10.4230/LIPIcs.STACS.2020.31
• Thomas Colcombet and Sylvain Lombardy Unambiguous Separators for Tropical Tree Automata 10.4230/LIPIcs.STACS.2020.32
• Mirmahdi Rahgoshay and Mohammad R. Salavatipour Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment 10.4230/LIPIcs.STACS.2020.33
• Yi-Jun Chang, Martín Farach-Colton, Tsan-Sheng Hsu, and Meng-Tsung Tsai Streaming Complexity of Spanning Tree Computation 10.4230/LIPIcs.STACS.2020.34
• Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, and Kunihiro Wasa Shortest Reconfiguration of Colorings Under Kempe Changes 10.4230/LIPIcs.STACS.2020.35
• Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse Elimination Distances, Blocking Sets, and Kernels for Vertex Cover 10.4230/LIPIcs.STACS.2020.36
• S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, and Nikhil Vyas Near-Optimal Complexity Bounds for Fragments of the Skolem Problem 10.4230/LIPIcs.STACS.2020.37
• Stefan Kratsch and Florian Nelles Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths 10.4230/LIPIcs.STACS.2020.38
• Michał Wrona Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width 10.4230/LIPIcs.STACS.2020.39
• Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, and Stefan Jaax Succinct Population Protocols for Presburger Arithmetic 10.4230/LIPIcs.STACS.2020.40
• Lech Duraj A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem 10.4230/LIPIcs.STACS.2020.41
• Andrés Cristi, Mathieu Mari, and Andreas Wiese Fixed-Parameter Algorithms for Unsplittable Flow Cover 10.4230/LIPIcs.STACS.2020.42
• Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm 10.4230/LIPIcs.STACS.2020.43
• Andrés Cristi and Andreas Wiese Better Approximations for General Caching and UFP-Cover Under Resource Augmentation 10.4230/LIPIcs.STACS.2020.44
• Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, and Ronald de Wolf Improved Bounds on Fourier Entropy and Min-Entropy 10.4230/LIPIcs.STACS.2020.45
• Bruno Bauwens Information Distance Revisited 10.4230/LIPIcs.STACS.2020.46
• Suryajith Chillara On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits 10.4230/LIPIcs.STACS.2020.47
• Dietmar Berwanger and Laurent Doyen Observation and Distinction. Representing Information in Infinite Games 10.4230/LIPIcs.STACS.2020.48
• Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, and James Worrell How Fast Can You Escape a Compact Polytope? 10.4230/LIPIcs.STACS.2020.49
• Sidhanth Mohanty, Ryan O'Donnell, and Pedro Paredes The SDP Value for Random Two-Eigenvalue CSPs 10.4230/LIPIcs.STACS.2020.50
• Xiang Huang, Jack H. Lutz, Elvira Mayordomo, and Donald M. Stull Asymptotic Divergences and Strong Dichotomy 10.4230/LIPIcs.STACS.2020.51
• S. M. Dhannya and N. S. Narayanaswamy Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs 10.4230/LIPIcs.STACS.2020.52
• Monika Henzinger and Pan Peng Constant-Time Dynamic (Δ+1)-Coloring 10.4230/LIPIcs.STACS.2020.53
• Marcelo Arenas, Juan Reutter, Etienne Toussaint, Martín Ugarte, Francisco Vial, and Domagoj Vrgoč Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards 10.4230/LIPIcs.STACS.2020.54
• André Nies and Frank Stephan Randomness and Initial Segment Complexity for Probability Measures 10.4230/LIPIcs.STACS.2020.55
• Jakub Gajarský and Stephan Kreutzer Computing Shrub-Depth Decompositions 10.4230/LIPIcs.STACS.2020.56
• Hans L. Bodlaender, Lars Jaffke, and Jan Arne Telle Typical Sequences Revisited - Computing Width Parameters of Graphs 10.4230/LIPIcs.STACS.2020.57
• Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, and Florian Sikora Grundy Coloring & Friends, Half-Graphs, Bicliques 10.4230/LIPIcs.STACS.2020.58
• Nikhil Vyas and R. Ryan Williams Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms 10.4230/LIPIcs.STACS.2020.59
• Jacobo Torán and Florian Wörz Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space 10.4230/LIPIcs.STACS.2020.60