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