<h2>LIPIcs, Volume 47, STACS 2016</h2>
<ul>
<li>
<span class="authors">Nicolas Ollinger and Heribert Vollmer</span>
<span class="title">LIPIcs, Volume 47, STACS'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016">10.4230/LIPIcs.STACS.2016</a>
</li>
<li>
<span class="authors">Nicolas Ollinger and Heribert Vollmer</span>
<span class="title">Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.0">10.4230/LIPIcs.STACS.2016.0</a>
</li>
<li>
<span class="authors">Jérôme Leroux and Sylvain Schmitz</span>
<span class="title">Ideal Decompositions for Vector Addition Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.1">10.4230/LIPIcs.STACS.2016.1</a>
</li>
<li>
<span class="authors">Carsten Lutz</span>
<span class="title">Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.2">10.4230/LIPIcs.STACS.2016.2</a>
</li>
<li>
<span class="authors">Virginia Vassilevska Williams</span>
<span class="title">Fine-Grained Algorithms and Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.3">10.4230/LIPIcs.STACS.2016.3</a>
</li>
<li>
<span class="authors">Jarkko Kari</span>
<span class="title">Tutorial on Cellular Automata and Tilings (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.4">10.4230/LIPIcs.STACS.2016.4</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, and Morten Stöckel</span>
<span class="title">Graph Reconstruction with a Betweenness Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.5">10.4230/LIPIcs.STACS.2016.5</a>
</li>
<li>
<span class="authors">Anna Adamaszek, Antonios Antoniadis, and Tobias Mömke</span>
<span class="title">Airports and Railways: Facility Location Meets Network Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.6">10.4230/LIPIcs.STACS.2016.6</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, and Saket Saurabh</span>
<span class="title">Simultaneous Feedback Vertex Set: A Parameterized Perspective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.7">10.4230/LIPIcs.STACS.2016.7</a>
</li>
<li>
<span class="authors">S. Akshay, Blaise Genest, Bruno Karelovic, and Nikhil Vyas</span>
<span class="title">On Regularity of Unary Probabilistic Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.8">10.4230/LIPIcs.STACS.2016.8</a>
</li>
<li>
<span class="authors">Spyros Angelopoulos, Christoph Dürr, and Thomas Lidbetter</span>
<span class="title">The Expanding Search Ratio of a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.9">10.4230/LIPIcs.STACS.2016.9</a>
</li>
<li>
<span class="authors">Rahul Arora, Ashu Gupta, Rohit Gurjar, and Raghunath Tewari</span>
<span class="title">Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.10">10.4230/LIPIcs.STACS.2016.10</a>
</li>
<li>
<span class="authors">Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, and Victor Kozyakin</span>
<span class="title">Entropy Games and Matrix Multiplication Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.11">10.4230/LIPIcs.STACS.2016.11</a>
</li>
<li>
<span class="authors">Nicolas Auger, Cyril Nicaud, and Carine Pivoteau</span>
<span class="title">Good Predictions Are Worth a Few Comparisons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.12">10.4230/LIPIcs.STACS.2016.12</a>
</li>
<li>
<span class="authors">Per Austrin, Petteri Kaski, Mikko Koivisto, and Jesper Nederlof</span>
<span class="title">Dense Subset Sum May Be the Hardest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.13">10.4230/LIPIcs.STACS.2016.13</a>
</li>
<li>
<span class="authors">Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, and Haitao Wang</span>
<span class="title">Computing the L1 Geodesic Diameter and Center of a Polygonal Domain</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.14">10.4230/LIPIcs.STACS.2016.14</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla</span>
<span class="title">Are Short Proofs Narrow? QBF Resolution is not Simple</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.15">10.4230/LIPIcs.STACS.2016.15</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Ragesh Jaiswal, and Amit Kumar</span>
<span class="title">Faster Algorithms for the Constrained k-Means Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.16">10.4230/LIPIcs.STACS.2016.16</a>
</li>
<li>
<span class="authors">Vittorio Bilò and Marios Mavronicolas</span>
<span class="title">A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.17">10.4230/LIPIcs.STACS.2016.17</a>
</li>
<li>
<span class="authors">Davide Bilò, Luciano Gualà, Stefano Leucci, and Guido Proietti</span>
<span class="title">Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.18">10.4230/LIPIcs.STACS.2016.18</a>
</li>
<li>
<span class="authors">Achim Blumensath, Thomas Colcombet, and Pawel Parys</span>
<span class="title">On a Fragment of AMSO and Tiling Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.19">10.4230/LIPIcs.STACS.2016.19</a>
</li>
<li>
<span class="authors">Manuel Bodirsky, Peter Jonsson, and Trung Van Pham</span>
<span class="title">The Complexity of Phylogeny Constraint Satisfaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.20">10.4230/LIPIcs.STACS.2016.20</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk, Pawel Parys, and Szymon Torunczyk</span>
<span class="title">The MSO+U Theory of (N,<) Is Undecidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.21">10.4230/LIPIcs.STACS.2016.21</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Michael Lampis, and Vangelis Th. Paschos</span>
<span class="title">Time-Approximation Trade-offs for Inapproximable Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.22">10.4230/LIPIcs.STACS.2016.22</a>
</li>
<li>
<span class="authors">Gerth Stølting Brodal</span>
<span class="title">External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.23">10.4230/LIPIcs.STACS.2016.23</a>
</li>
<li>
<span class="authors">Harry Buhrman, Michal Koucký, Bruno Loff, and Florian Speelman</span>
<span class="title">Catalytic Space: Non-determinism and Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.24">10.4230/LIPIcs.STACS.2016.24</a>
</li>
<li>
<span class="authors">Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, and Ronitt Rubinfeld</span>
<span class="title">Testing Shape Restrictions of Discrete Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.25">10.4230/LIPIcs.STACS.2016.25</a>
</li>
<li>
<span class="authors">Maurice Chandoo</span>
<span class="title">Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.26">10.4230/LIPIcs.STACS.2016.26</a>
</li>
<li>
<span class="authors">Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, and Uri Zwick</span>
<span class="title">Bottleneck Paths and Trees and Deterministic Graphical Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.27">10.4230/LIPIcs.STACS.2016.27</a>
</li>
<li>
<span class="authors">Lin Chen and Guochuan Zhang</span>
<span class="title">Packing Groups of Items into Multiple Knapsacks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.28">10.4230/LIPIcs.STACS.2016.28</a>
</li>
<li>
<span class="authors">Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, and Szymon Torunczyk</span>
<span class="title">Cost Functions Definable by Min/Max Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.29">10.4230/LIPIcs.STACS.2016.29</a>
</li>
<li>
<span class="authors">Laure Daviaud, Denis Kuperberg, and Jean-Éric Pin</span>
<span class="title">Varieties of Cost Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.30">10.4230/LIPIcs.STACS.2016.30</a>
</li>
<li>
<span class="authors">Pål Grønås Drange, Markus Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, and Somnath Sikdar</span>
<span class="title">Kernelization and Sparseness: the Case of Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.31">10.4230/LIPIcs.STACS.2016.31</a>
</li>
<li>
<span class="authors">Michael Elberfeld and Pascal Schweitzer</span>
<span class="title">Canonizing Graphs of Bounded Tree Width in Logspace</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.32">10.4230/LIPIcs.STACS.2016.32</a>
</li>
<li>
<span class="authors">Stefan Fafianie, Stefan Kratsch, and Vuong Anh Quyen</span>
<span class="title">Preprocessing Under Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.33">10.4230/LIPIcs.STACS.2016.33</a>
</li>
<li>
<span class="authors">Nathanaël Fijalkow</span>
<span class="title">Characterisation of an Algebraic Algorithm for Probabilistic Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.34">10.4230/LIPIcs.STACS.2016.34</a>
</li>
<li>
<span class="authors">Yuval Filmus, Pavel Hrubeš, and Massimo Lauria</span>
<span class="title">Semantic Versus Syntactic Cutting Planes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.35">10.4230/LIPIcs.STACS.2016.35</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr Golovach, Fahad Panolan, and Saket Saurabh</span>
<span class="title">Editing to Connected f-Degree Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.36">10.4230/LIPIcs.STACS.2016.36</a>
</li>
<li>
<span class="authors">Dimitris Fotakis, Michael Lampis, and Vangelis Th. Paschos</span>
<span class="title">Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.37">10.4230/LIPIcs.STACS.2016.37</a>
</li>
<li>
<span class="authors">Frederik Garbe and Richard Mycroft</span>
<span class="title">The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.38">10.4230/LIPIcs.STACS.2016.38</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, and Florin Manea</span>
<span class="title">Efficiently Finding All Maximal alpha-gapped Repeats</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.39">10.4230/LIPIcs.STACS.2016.39</a>
</li>
<li>
<span class="authors">Bernhard Gittenberger and Zbigniew Golebiewski</span>
<span class="title">On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.40">10.4230/LIPIcs.STACS.2016.40</a>
</li>
<li>
<span class="authors">Christoph Haase and Piotr Hofman</span>
<span class="title">Tightening the Complexity of Equivalence Problems for Commutative Grammars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.41">10.4230/LIPIcs.STACS.2016.41</a>
</li>
<li>
<span class="authors">John M. Hitchcock and Hadi Shafei</span>
<span class="title">Autoreducibility of NP-Complete Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.42">10.4230/LIPIcs.STACS.2016.42</a>
</li>
<li>
<span class="authors">Eva-Maria C. Hols and Stefan Kratsch</span>
<span class="title">A Randomized Polynomial Kernel for Subset Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.43">10.4230/LIPIcs.STACS.2016.43</a>
</li>
<li>
<span class="authors">Štepán Holub and Jeffrey Shallit</span>
<span class="title">Periods and Borders of Random Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.44">10.4230/LIPIcs.STACS.2016.44</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen</span>
<span class="title">Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.45">10.4230/LIPIcs.STACS.2016.45</a>
</li>
<li>
<span class="authors">Neeraj Kayal, Vineet Nair, and Chandan Saha</span>
<span class="title">Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.46">10.4230/LIPIcs.STACS.2016.46</a>
</li>
<li>
<span class="authors">Timo Kötzing and Martin Schirneck</span>
<span class="title">Towards an Atlas of Computational Learning Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.47">10.4230/LIPIcs.STACS.2016.47</a>
</li>
<li>
<span class="authors">Raghav Kulkarni and Supartha Podder</span>
<span class="title">Quantum Query Complexity of Subgraph Isomorphism and Homomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.48">10.4230/LIPIcs.STACS.2016.48</a>
</li>
<li>
<span class="authors">Mithilesh Kumar and Daniel Lokshtanov</span>
<span class="title">Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.49">10.4230/LIPIcs.STACS.2016.49</a>
</li>
<li>
<span class="authors">Markus Lohrey and Georg Zetzsche</span>
<span class="title">Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.50">10.4230/LIPIcs.STACS.2016.50</a>
</li>
<li>
<span class="authors">Pinyan Lu, Kuan Yang, and Chihao Zhang</span>
<span class="title">FPTAS for Hardcore and Ising Models on Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.51">10.4230/LIPIcs.STACS.2016.51</a>
</li>
<li>
<span class="authors">Arnaud Mary and Yann Strozecki</span>
<span class="title">Efficient Enumeration of Solutions Produced by Closure Operations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.52">10.4230/LIPIcs.STACS.2016.52</a>
</li>
<li>
<span class="authors">Filip Mazowiecki and Cristian Riveros</span>
<span class="title">Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.53">10.4230/LIPIcs.STACS.2016.53</a>
</li>
<li>
<span class="authors">Alexey Milovanov</span>
<span class="title">Algorithmic Statistics, Prediction and Machine Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.54">10.4230/LIPIcs.STACS.2016.54</a>
</li>
<li>
<span class="authors">Matthias Mnich and Erik Jan van Leeuwen</span>
<span class="title">Polynomial Kernels for Deletion to Classes of Acyclic Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.55">10.4230/LIPIcs.STACS.2016.55</a>
</li>
<li>
<span class="authors">Mateus de Oliveira Oliveira</span>
<span class="title">Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.56">10.4230/LIPIcs.STACS.2016.56</a>
</li>
<li>
<span class="authors">Michal Pilipczuk and Marcin Wrochna</span>
<span class="title">On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.57">10.4230/LIPIcs.STACS.2016.57</a>
</li>
<li>
<span class="authors">Harald Räcke and Richard Stotz</span>
<span class="title">Improved Approximation Algorithms for Balanced Partitioning Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2016.58">10.4230/LIPIcs.STACS.2016.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