<h2>LIPIcs, Volume 96, STACS 2018</h2>
<ul>
<li>
<span class="authors">Rolf Niedermeier and Brigitte Vallée</span>
<span class="title">LIPIcs, Volume 96, STACS'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018">10.4230/LIPIcs.STACS.2018</a>
</li>
<li>
<span class="authors">Rolf Niedermeier and Brigitte Vallée</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.0">10.4230/LIPIcs.STACS.2018.0</a>
</li>
<li>
<span class="authors">Bruno Salvy</span>
<span class="title">Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.1">10.4230/LIPIcs.STACS.2018.1</a>
</li>
<li>
<span class="authors">Meena Mahajan</span>
<span class="title">Lower Bound Techniques for QBF Proof Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.2">10.4230/LIPIcs.STACS.2018.2</a>
</li>
<li>
<span class="authors">Damien Pous</span>
<span class="title">On the Positive Calculus of Relations with Transitive Closure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.3">10.4230/LIPIcs.STACS.2018.3</a>
</li>
<li>
<span class="authors">Gerhard J. Woeginger</span>
<span class="title">The Open Shop Scheduling Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.4">10.4230/LIPIcs.STACS.2018.4</a>
</li>
<li>
<span class="authors">Anna Adamaszek, Antonios Antoniadis, Amit Kumar, and Tobias Mömke</span>
<span class="title">Approximating Airports and Railways</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.5">10.4230/LIPIcs.STACS.2018.5</a>
</li>
<li>
<span class="authors">Isolde Adler and Frederik Harwath</span>
<span class="title">Property Testing for Bounded Degree Databases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.6">10.4230/LIPIcs.STACS.2018.6</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Erdös-Pósa Property of Obstructions to Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.7">10.4230/LIPIcs.STACS.2018.7</a>
</li>
<li>
<span class="authors">Andris Ambainis, Martins Kokainis, Krisjanis Prusis, and Jevgenijs Vihrovs</span>
<span class="title">All Classical Adversary Methods are Equivalent for Total Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.8">10.4230/LIPIcs.STACS.2018.8</a>
</li>
<li>
<span class="authors">Max Bannach and Till Tantau</span>
<span class="title">Computing Hitting Set Kernels By AC^0-Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.9">10.4230/LIPIcs.STACS.2018.9</a>
</li>
<li>
<span class="authors">Rémy Belmonte, Michael Lampis, and Valia Mitsou</span>
<span class="title">Parameterized (Approximate) Defective Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.10">10.4230/LIPIcs.STACS.2018.10</a>
</li>
<li>
<span class="authors">Christoph Berkholz</span>
<span class="title">The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.11">10.4230/LIPIcs.STACS.2018.11</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff and Joshua Blinkhorn</span>
<span class="title">Genuine Lower Bounds for QBF Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.12">10.4230/LIPIcs.STACS.2018.12</a>
</li>
<li>
<span class="authors">Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, and Guido Proietti</span>
<span class="title">Efficient Oracles and Routing Schemes for Replacement Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.13">10.4230/LIPIcs.STACS.2018.13</a>
</li>
<li>
<span class="authors">Davide Bilò and Pascal Lenzner</span>
<span class="title">On the Tree Conjecture for the Network Creation Game</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.14">10.4230/LIPIcs.STACS.2018.14</a>
</li>
<li>
<span class="authors">Laurent Bienvenu and Rodney Downey</span>
<span class="title">On Low for Speed Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.15">10.4230/LIPIcs.STACS.2018.15</a>
</li>
<li>
<span class="authors">Michael Blondin, Javier Esparza, and Stefan Jaax</span>
<span class="title">Large Flocks of Small Birds: on the Minimal Size of Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.16">10.4230/LIPIcs.STACS.2018.16</a>
</li>
<li>
<span class="authors">Benedikt Bollig, Marie Fortin, and Paul Gastin</span>
<span class="title">Communicating Finite-State Machines and Two-Variable Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.17">10.4230/LIPIcs.STACS.2018.17</a>
</li>
<li>
<span class="authors">Marco Bressan, Enoch Peserico, and Luca Pretto</span>
<span class="title">On Approximating the Stationary Distribution of Time-reversible Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.18">10.4230/LIPIcs.STACS.2018.18</a>
</li>
<li>
<span class="authors">Clément Carbonnel, David A. Cohen, Martin C. Cooper, and Stanislav Zivny</span>
<span class="title">On Singleton Arc Consistency for CSPs Defined by Monotone Patterns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.19">10.4230/LIPIcs.STACS.2018.19</a>
</li>
<li>
<span class="authors">Bernadette Charron-Bost and Shlomo Moran</span>
<span class="title">The Firing Squad Problem Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.20">10.4230/LIPIcs.STACS.2018.20</a>
</li>
<li>
<span class="authors">Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan</span>
<span class="title">Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.21">10.4230/LIPIcs.STACS.2018.21</a>
</li>
<li>
<span class="authors">Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, and Tatiana Starikovskaya</span>
<span class="title">Upper and Lower Bounds for Dynamic Data Structures on Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.22">10.4230/LIPIcs.STACS.2018.22</a>
</li>
<li>
<span class="authors">Debarati Das, Michal Koucký, and Michael Saks</span>
<span class="title">Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.23">10.4230/LIPIcs.STACS.2018.23</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Sarah Eisenstat, and Mikhail Rudoy</span>
<span class="title">Solving the Rubik's Cube Optimally is NP-complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.24">10.4230/LIPIcs.STACS.2018.24</a>
</li>
<li>
<span class="authors">Gökalp Demirci, Henry Hoffmann, and David H. K. Kim</span>
<span class="title">Approximation Algorithms for Scheduling with Resource and Precedence Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.25">10.4230/LIPIcs.STACS.2018.25</a>
</li>
<li>
<span class="authors">Pavel Dvorák, Andreas Emil Feldmann, Dušan Knop, Tomáš Masarík, Tomáš Toufar, and Pavel Veselý</span>
<span class="title">Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.26">10.4230/LIPIcs.STACS.2018.26</a>
</li>
<li>
<span class="authors">László Egri, Dániel Marx, and Pawel Rzazewski</span>
<span class="title">Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.27">10.4230/LIPIcs.STACS.2018.27</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, and Sebastian Ordyniak</span>
<span class="title">Small Resolution Proofs for QBF using Dependency Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.28">10.4230/LIPIcs.STACS.2018.28</a>
</li>
<li>
<span class="authors">Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, and Sebastian Siebertz</span>
<span class="title">Lossy Kernels for Connected Dominating Set on Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.29">10.4230/LIPIcs.STACS.2018.29</a>
</li>
<li>
<span class="authors">Lukas Fleischer and Manfred Kufleitner</span>
<span class="title">The Intersection Problem for Finite Monoids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.30">10.4230/LIPIcs.STACS.2018.30</a>
</li>
<li>
<span class="authors">Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, and Konstantinos Mamouras</span>
<span class="title">Automata Theory on Sliding Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.31">10.4230/LIPIcs.STACS.2018.31</a>
</li>
<li>
<span class="authors">Moses Ganardi, Daniel König, Markus Lohrey, and Georg Zetzsche</span>
<span class="title">Knapsack Problems for Wreath Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.32">10.4230/LIPIcs.STACS.2018.32</a>
</li>
<li>
<span class="authors">Robert Ganian, Fabian Klute, and Sebastian Ordyniak</span>
<span class="title">On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.33">10.4230/LIPIcs.STACS.2018.33</a>
</li>
<li>
<span class="authors">Patrick Gardy, Patricia Bouyer, and Nicolas Markey</span>
<span class="title">Dependences in Strategy Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.34">10.4230/LIPIcs.STACS.2018.34</a>
</li>
<li>
<span class="authors">Serge Gaspers, Shenwei Huang, and Daniel Paulusma</span>
<span class="title">Colouring Square-Free Graphs without Long Induced Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.35">10.4230/LIPIcs.STACS.2018.35</a>
</li>
<li>
<span class="authors">Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna</span>
<span class="title">Optimal Dislocation with Persistent Errors in Subquadratic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.36">10.4230/LIPIcs.STACS.2018.36</a>
</li>
<li>
<span class="authors">George Giakkoupis and Philipp Woelfel</span>
<span class="title">An Improved Bound for Random Binary Search Trees with Concurrent Insertions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.37">10.4230/LIPIcs.STACS.2018.37</a>
</li>
<li>
<span class="authors">Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny Shur, and Tomasz Walen</span>
<span class="title">String Periods in the Order-Preserving Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.38">10.4230/LIPIcs.STACS.2018.38</a>
</li>
<li>
<span class="authors">Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Zivny</span>
<span class="title">Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.39">10.4230/LIPIcs.STACS.2018.39</a>
</li>
<li>
<span class="authors">John M. Hitchcock and Hadi Shafei</span>
<span class="title">Nonuniform Reductions and NP-Completeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.40">10.4230/LIPIcs.STACS.2018.40</a>
</li>
<li>
<span class="authors">Yoichi Iwata, Tomoaki Ogasawara, and Naoto Ohsaka</span>
<span class="title">On the Power of Tree-Depth for Fully Polynomial FPT Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.41">10.4230/LIPIcs.STACS.2018.41</a>
</li>
<li>
<span class="authors">Lars Jaffke, O-joung Kwon, and Jan Arne Telle</span>
<span class="title">A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.42">10.4230/LIPIcs.STACS.2018.42</a>
</li>
<li>
<span class="authors">Sven Jäger and Martin Skutella</span>
<span class="title">Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.43">10.4230/LIPIcs.STACS.2018.43</a>
</li>
<li>
<span class="authors">Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, and Jun Tarui</span>
<span class="title">Space-Efficient Algorithms for Longest Increasing Subsequence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.44">10.4230/LIPIcs.STACS.2018.44</a>
</li>
<li>
<span class="authors">Chris Köcher</span>
<span class="title">Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.45">10.4230/LIPIcs.STACS.2018.45</a>
</li>
<li>
<span class="authors">Dmitry Kosolobov</span>
<span class="title">Relations Between Greedy and Bit-Optimal LZ77 Encodings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.46">10.4230/LIPIcs.STACS.2018.46</a>
</li>
<li>
<span class="authors">Denis Kuperberg and Anirban Majumdar</span>
<span class="title">Width of Non-deterministic Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.47">10.4230/LIPIcs.STACS.2018.47</a>
</li>
<li>
<span class="authors">Michael Luttenberger, Raphaela Palenta, and Helmut Seidl</span>
<span class="title">Computing the Longest Common Prefix of a Context-free Language in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.48">10.4230/LIPIcs.STACS.2018.48</a>
</li>
<li>
<span class="authors">Benoit Larose, Barnaby Martin, and Daniel Paulusma</span>
<span class="title">Surjective H-Colouring over Reflexive Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.49">10.4230/LIPIcs.STACS.2018.49</a>
</li>
<li>
<span class="authors">Filip Mazowiecki and Cristian Riveros</span>
<span class="title">Pumping Lemmas for Weighted Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.50">10.4230/LIPIcs.STACS.2018.50</a>
</li>
<li>
<span class="authors">André Nies and Frank Stephan</span>
<span class="title">Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.51">10.4230/LIPIcs.STACS.2018.51</a>
</li>
<li>
<span class="authors">Taku Onodera and Tetsuo Shibuya</span>
<span class="title">Succinct Oblivious RAM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.52">10.4230/LIPIcs.STACS.2018.52</a>
</li>
<li>
<span class="authors">Pawel Parys</span>
<span class="title">Recursion Schemes and the WMSO+U Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.53">10.4230/LIPIcs.STACS.2018.53</a>
</li>
<li>
<span class="authors">Aayush Rajasekaran, Jeffrey Shallit, and Tim Smith</span>
<span class="title">Sums of Palindromes: an Approach via Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.54">10.4230/LIPIcs.STACS.2018.54</a>
</li>
<li>
<span class="authors">Hans U. Simon</span>
<span class="title">On the Containment Problem for Linear Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.55">10.4230/LIPIcs.STACS.2018.55</a>
</li>
<li>
<span class="authors">Marek Szykula</span>
<span class="title">Improving the Upper Bound on the Length of the Shortest Reset Word</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.56">10.4230/LIPIcs.STACS.2018.56</a>
</li>
<li>
<span class="authors">Yasuhiro Takahashi and Seiichiro Tani</span>
<span class="title">Power of Uninitialized Qubits in Shallow Quantum Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.57">10.4230/LIPIcs.STACS.2018.57</a>
</li>
<li>
<span class="authors">Roei Tell</span>
<span class="title">Lower Bounds on Black-Box Reductions of Hitting to Density Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2018.58">10.4230/LIPIcs.STACS.2018.58</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