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