<h2>LIPIcs, Volume 66, STACS 2017</h2>
<ul>
<li>
<span class="authors">Heribert Vollmer and Brigitte Vallée</span>
<span class="title">LIPIcs, Volume 66, STACS'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017">10.4230/LIPIcs.STACS.2017</a>
</li>
<li>
<span class="authors">Heribert Vollmer and Brigitte Vallée</span>
<span class="title">Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.0">10.4230/LIPIcs.STACS.2017.0</a>
</li>
<li>
<span class="authors">Juha Kontinen</span>
<span class="title">Computational Aspects of Logics in Team Semantics (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.1">10.4230/LIPIcs.STACS.2017.1</a>
</li>
<li>
<span class="authors">Artur Jez</span>
<span class="title">Recompression: New Approach to Word Equations and Context Unification (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.2">10.4230/LIPIcs.STACS.2017.2</a>
</li>
<li>
<span class="authors">Antoine Joux</span>
<span class="title">Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.3">10.4230/LIPIcs.STACS.2017.3</a>
</li>
<li>
<span class="authors">Till Tantau</span>
<span class="title">Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.4">10.4230/LIPIcs.STACS.2017.4</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Split Contraction: The Untold Story</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.5">10.4230/LIPIcs.STACS.2017.5</a>
</li>
<li>
<span class="authors">Marianne Akian, Stéphane Gaubert, Julien Grand-Clément, and Jérémie Guillaud</span>
<span class="title">The Operator Approach to Entropy Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.6">10.4230/LIPIcs.STACS.2017.6</a>
</li>
<li>
<span class="authors">Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, and Jacobo Torán</span>
<span class="title">Parameterized Complexity of Small Weight Automorphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.7">10.4230/LIPIcs.STACS.2017.7</a>
</li>
<li>
<span class="authors">Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, and Dennis Olivetti</span>
<span class="title">What Can Be Verified Locally?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.8">10.4230/LIPIcs.STACS.2017.8</a>
</li>
<li>
<span class="authors">Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, and Yannik Stein</span>
<span class="title">Improved Time-Space Trade-Offs for Computing Voronoi Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.9">10.4230/LIPIcs.STACS.2017.9</a>
</li>
<li>
<span class="authors">Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, and Paolo Penna</span>
<span class="title">Energy-Efficient Delivery by Heterogeneous Mobile Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.10">10.4230/LIPIcs.STACS.2017.10</a>
</li>
<li>
<span class="authors">Suman K. Bera and Amit Chakrabarti</span>
<span class="title">Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.11">10.4230/LIPIcs.STACS.2017.11</a>
</li>
<li>
<span class="authors">Abhishek Bhrushundi, Prahladh Harsha, and Srikanth Srinivasan</span>
<span class="title">On Polynomial Approximations Over Z/2^kZ*</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.12">10.4230/LIPIcs.STACS.2017.12</a>
</li>
<li>
<span class="authors">Vittorio Bilò and Marios Mavronicolas</span>
<span class="title">Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.13">10.4230/LIPIcs.STACS.2017.13</a>
</li>
<li>
<span class="authors">Stanislav Böhm, Stefan Göller, Simon Halfon, and Piotr Hofman</span>
<span class="title">On Büchi One-Counter Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.14">10.4230/LIPIcs.STACS.2017.14</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk and Michal Pilipczuk</span>
<span class="title">Optimizing Tree Decompositions in MSO</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.15">10.4230/LIPIcs.STACS.2017.15</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Tillmann Miltzow, and Pawel Rzazewski</span>
<span class="title">Complexity of Token Swapping and its Variants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.16">10.4230/LIPIcs.STACS.2017.16</a>
</li>
<li>
<span class="authors">Vasco Brattka, Rupert Hölzl, and Rutger Kuyper</span>
<span class="title">Monte Carlo Computability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.17">10.4230/LIPIcs.STACS.2017.17</a>
</li>
<li>
<span class="authors">Benjamin Burton, Sergio Cabello, Stefan Kratsch, and William Pettersson</span>
<span class="title">The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.18">10.4230/LIPIcs.STACS.2017.18</a>
</li>
<li>
<span class="authors">Arnaud Carayol and Stefan Göller</span>
<span class="title">On Long Words Avoiding Zimin Patterns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.19">10.4230/LIPIcs.STACS.2017.19</a>
</li>
<li>
<span class="authors">Titouan Carette, Mathieu Laurière, and Frédéric Magniez</span>
<span class="title">Extended Learning Graphs for Triangle Finding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.20">10.4230/LIPIcs.STACS.2017.20</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay</span>
<span class="title">Lower Bounds for Elimination via Weak Regularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.21">10.4230/LIPIcs.STACS.2017.21</a>
</li>
<li>
<span class="authors">Lin Chen, Dániel Marx, Deshi Ye, and Guochuan Zhang</span>
<span class="title">Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.22">10.4230/LIPIcs.STACS.2017.22</a>
</li>
<li>
<span class="authors">Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, and Jeffrey Shallit</span>
<span class="title">Fractional Coverings, Greedy Coverings, and Rectifier Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.23">10.4230/LIPIcs.STACS.2017.23</a>
</li>
<li>
<span class="authors">Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, and Charles Paperman</span>
<span class="title">Separability of Reachability Sets of Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.24">10.4230/LIPIcs.STACS.2017.24</a>
</li>
<li>
<span class="authors">Radu Curticapean, Holger Dell, and Marc Roth</span>
<span class="title">Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.25">10.4230/LIPIcs.STACS.2017.25</a>
</li>
<li>
<span class="authors">Yann Disser and Stefan Kratsch</span>
<span class="title">Robust and Adaptive Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.26">10.4230/LIPIcs.STACS.2017.26</a>
</li>
<li>
<span class="authors">Zdenek Dvorák, Daniel Král, and Bojan Mohar</span>
<span class="title">Graphic TSP in Cubic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.27">10.4230/LIPIcs.STACS.2017.27</a>
</li>
<li>
<span class="authors">Zdenek Dvorák and Bernard Lidický</span>
<span class="title">Independent Sets near the Lower Bound in Bounded Degree Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.28">10.4230/LIPIcs.STACS.2017.28</a>
</li>
<li>
<span class="authors">Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, and James Worrell</span>
<span class="title">Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.29">10.4230/LIPIcs.STACS.2017.29</a>
</li>
<li>
<span class="authors">Bernd Finkbeiner and Martin Zimmermann</span>
<span class="title">The First-Order Logic of Hyperproperties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.30">10.4230/LIPIcs.STACS.2017.30</a>
</li>
<li>
<span class="authors">Eldar Fischer, Oded Lachish, and Yadu Vasudev</span>
<span class="title">Improving and Extending the Testing of Distributions for Shape-Restricted Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.31">10.4230/LIPIcs.STACS.2017.31</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, S. M. Meesum, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Matrix Rigidity from the Viewpoint of Parameterized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.32">10.4230/LIPIcs.STACS.2017.32</a>
</li>
<li>
<span class="authors">Dominik D. Freydenberger and Markus L. Schmid</span>
<span class="title">Deterministic Regular Expressions with Back-References</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.33">10.4230/LIPIcs.STACS.2017.33</a>
</li>
<li>
<span class="authors">Paul Gallot, Anca Muscholl, Gabriele Puppis, and Sylvain Salvati</span>
<span class="title">On the Decomposition of Finite-Valued Streaming String Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.34">10.4230/LIPIcs.STACS.2017.34</a>
</li>
<li>
<span class="authors">Moses Ganardi, Danny Hucke, Daniel König, and Markus Lohrey</span>
<span class="title">Circuit Evaluation for Finite Semirings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.35">10.4230/LIPIcs.STACS.2017.35</a>
</li>
<li>
<span class="authors">Robert Ganian, M. S. Ramanujan, and Stefan Szeider</span>
<span class="title">Combining Treewidth and Backdoors for CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.36">10.4230/LIPIcs.STACS.2017.36</a>
</li>
<li>
<span class="authors">Ignacio Garcia-Marco, Pascal Koiran, Timothée Pecatte, and Stéphan Thomassé</span>
<span class="title">On the Complexity of Partial Derivatives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.37">10.4230/LIPIcs.STACS.2017.37</a>
</li>
<li>
<span class="authors">Mohit Garg and Jaikumar Radhakrishnan</span>
<span class="title">Set Membership with Non-Adaptive Bit Probes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.38">10.4230/LIPIcs.STACS.2017.38</a>
</li>
<li>
<span class="authors">Samuel J. van Gool and Benjamin Steinberg</span>
<span class="title">Pro-Aperiodic Monoids via Saturated Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.39">10.4230/LIPIcs.STACS.2017.39</a>
</li>
<li>
<span class="authors">Petr Gregor and Torsten Mütze</span>
<span class="title">Trimming and Gluing Gray Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.40">10.4230/LIPIcs.STACS.2017.40</a>
</li>
<li>
<span class="authors">Shahrzad Haddadan and Peter Winkler</span>
<span class="title">Mixing of Permutations by Biased Transposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.41">10.4230/LIPIcs.STACS.2017.41</a>
</li>
<li>
<span class="authors">Peter Hoyer and Mojtaba Komeili</span>
<span class="title">Efficient Quantum Walk on the Grid with Multiple Marked Elements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.42">10.4230/LIPIcs.STACS.2017.42</a>
</li>
<li>
<span class="authors">Dmitry Itsykson, Alexander Knop, Andrey Romashchenko, and Dmitry Sokolov</span>
<span class="title">On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.43">10.4230/LIPIcs.STACS.2017.43</a>
</li>
<li>
<span class="authors">Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, and Thomas Sauerwald</span>
<span class="title">Multiple Random Walks on Paths and Grids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.44">10.4230/LIPIcs.STACS.2017.44</a>
</li>
<li>
<span class="authors">Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, and Arseny M. Shur</span>
<span class="title">On the Size of Lempel-Ziv and Lyndon Factorizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.45">10.4230/LIPIcs.STACS.2017.45</a>
</li>
<li>
<span class="authors">Dusan Knop, Martin Koutecký, and Matthias Mnich</span>
<span class="title">Voting and Bribing in Single-Exponential Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.46">10.4230/LIPIcs.STACS.2017.46</a>
</li>
<li>
<span class="authors">Michael Kompatscher and Trung Van Pham</span>
<span class="title">A Complexity Dichotomy for Poset Constraint Satisfaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.47">10.4230/LIPIcs.STACS.2017.47</a>
</li>
<li>
<span class="authors">Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, and Grischa Weberstädt</span>
<span class="title">Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.48">10.4230/LIPIcs.STACS.2017.48</a>
</li>
<li>
<span class="authors">Alexander S. Kulikov and Vladimir V. Podolskii</span>
<span class="title">Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.49">10.4230/LIPIcs.STACS.2017.49</a>
</li>
<li>
<span class="authors">Stéphane Le Roux, Arno Pauly, and Jean-François Raskin</span>
<span class="title">Minkowski Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.50">10.4230/LIPIcs.STACS.2017.50</a>
</li>
<li>
<span class="authors">Qian Li and Xiaoming Sun</span>
<span class="title">On the Sensitivity Complexity of k-Uniform Hypergraph Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.51">10.4230/LIPIcs.STACS.2017.51</a>
</li>
<li>
<span class="authors">Markus Lohrey and Georg Zetzsche</span>
<span class="title">The Complexity of Knapsack in Graph Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.52">10.4230/LIPIcs.STACS.2017.52</a>
</li>
<li>
<span class="authors">Jack H. Lutz and Neil Lutz</span>
<span class="title">Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.53">10.4230/LIPIcs.STACS.2017.53</a>
</li>
<li>
<span class="authors">Gaétan Richard</span>
<span class="title">On the Synchronisation Problem over Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.54">10.4230/LIPIcs.STACS.2017.54</a>
</li>
<li>
<span class="authors">Aleksi Saarela</span>
<span class="title">Word Equations Where a Power Equals a Product of Powers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.55">10.4230/LIPIcs.STACS.2017.55</a>
</li>
<li>
<span class="authors">Piotr Sankowski and Karol Wegrzycki</span>
<span class="title">Improved Distance Queries and Cycle Counting by Frobenius Normal Form</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.56">10.4230/LIPIcs.STACS.2017.56</a>
</li>
<li>
<span class="authors">Maciej Skorski</span>
<span class="title">Lower Bounds on Key Derivation for Square-Friendly Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.57">10.4230/LIPIcs.STACS.2017.57</a>
</li>
<li>
<span class="authors">Marius Zimand</span>
<span class="title">List Approximation for Increasing Kolmogorov Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2017.58">10.4230/LIPIcs.STACS.2017.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