<h2>LIPIcs, Volume 30, STACS 2015</h2>
<ul>
<li>
<span class="authors">Ernst W. Mayr and Nicolas Ollinger</span>
<span class="title">LIPIcs, Volume 30, STACS'15, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015">10.4230/LIPIcs.STACS.2015</a>
</li>
<li>
<span class="authors">Ernst W. Mayr and Nicolas Ollinger</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.i">10.4230/LIPIcs.STACS.2015.i</a>
</li>
<li>
<span class="authors">Sanjeev Arora</span>
<span class="title">Overcoming Intractability in Unsupervised Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.1">10.4230/LIPIcs.STACS.2015.1</a>
</li>
<li>
<span class="authors">Manuel Bodirsky</span>
<span class="title">The Complexity of Constraint Satisfaction Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.2">10.4230/LIPIcs.STACS.2015.2</a>
</li>
<li>
<span class="authors">Peter Sanders</span>
<span class="title">Parallel Algorithms Reconsidered (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.10">10.4230/LIPIcs.STACS.2015.10</a>
</li>
<li>
<span class="authors">Felix Brandt</span>
<span class="title">Computational Social Choice (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.19">10.4230/LIPIcs.STACS.2015.19</a>
</li>
<li>
<span class="authors">Paul W. Goldberg</span>
<span class="title">Algorithmic Game Theory (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.20">10.4230/LIPIcs.STACS.2015.20</a>
</li>
<li>
<span class="authors">Eric Allender, Dhiraj Holden, and Valentine Kabanets</span>
<span class="title">The Minimum Oracle Circuit Size Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.21">10.4230/LIPIcs.STACS.2015.21</a>
</li>
<li>
<span class="authors">Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, and Sebastian Siebertz</span>
<span class="title">Graph Searching Games and Width Measures for Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.34">10.4230/LIPIcs.STACS.2015.34</a>
</li>
<li>
<span class="authors">Per Austrin, Petteri Kaski, Mikko Koivisto, and Jesper Nederlof</span>
<span class="title">Subset Sum in the Absence of Concentration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.48">10.4230/LIPIcs.STACS.2015.48</a>
</li>
<li>
<span class="authors">Martin Avanzini and Ugo Dal Lago</span>
<span class="title">On Sharing, Memoization, and Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.62">10.4230/LIPIcs.STACS.2015.62</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff, Leroy Chew, and Mikolás Janota</span>
<span class="title">Proof Complexity of Resolution-based QBF Calculi</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.76">10.4230/LIPIcs.STACS.2015.76</a>
</li>
<li>
<span class="authors">Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, and Martin Starnberger</span>
<span class="title">Welfare Maximization with Friends-of-Friends Network Externalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.90">10.4230/LIPIcs.STACS.2015.90</a>
</li>
<li>
<span class="authors">Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino</span>
<span class="title">Markov Decision Processes and Stochastic Games with Total Effective Payoff</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.103">10.4230/LIPIcs.STACS.2015.103</a>
</li>
<li>
<span class="authors">Joan Boyar, Lene M. Favrholdt, Christian Kudahl, and Jesper W. Mikkelsen</span>
<span class="title">Advice Complexity for a Class of Online Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.116">10.4230/LIPIcs.STACS.2015.116</a>
</li>
<li>
<span class="authors">Vasco Brattka, Guido Gherardi, and Rupert Hölzl</span>
<span class="title">Las Vegas Computability and Algorithmic Randomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.130">10.4230/LIPIcs.STACS.2015.130</a>
</li>
<li>
<span class="authors">Johann Brault-Baron, Florent Capelli, and Stefan Mengel</span>
<span class="title">Understanding Model Counting for beta-acyclic CNF-formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.143">10.4230/LIPIcs.STACS.2015.143</a>
</li>
<li>
<span class="authors">Karl Bringmann, Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen</span>
<span class="title">Parameterized Complexity Dichotomy for Steiner Multicut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.157">10.4230/LIPIcs.STACS.2015.157</a>
</li>
<li>
<span class="authors">Tobias Brunsch, Anna Großwendt, and Heiko Röglin</span>
<span class="title">Solving Totally Unimodular LPs with the Shadow Vertex Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.171">10.4230/LIPIcs.STACS.2015.171</a>
</li>
<li>
<span class="authors">Norbert Bus, Shashwat Garg, Nabil H. Mustafa, and Saurabh Ray</span>
<span class="title">Improved Local Search for Geometric Hitting Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.184">10.4230/LIPIcs.STACS.2015.184</a>
</li>
<li>
<span class="authors">Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, and Manuel Wettstein</span>
<span class="title">Arc Diagrams, Flip Distances, and Hamiltonian Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.197">10.4230/LIPIcs.STACS.2015.197</a>
</li>
<li>
<span class="authors">Pablo Castro, Cecilia Kilmurray, and Nir Piterman</span>
<span class="title">Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.211">10.4230/LIPIcs.STACS.2015.211</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay and Sagnik Mukhopadhyay</span>
<span class="title">Tribes Is Hard in the Message Passing Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.224">10.4230/LIPIcs.STACS.2015.224</a>
</li>
<li>
<span class="authors">Markus Chimani and Joachim Spoerhase</span>
<span class="title">Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.238">10.4230/LIPIcs.STACS.2015.238</a>
</li>
<li>
<span class="authors">Thomas Colcombet and Amaldev Manuel</span>
<span class="title">Combinatorial Expressions and Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.249">10.4230/LIPIcs.STACS.2015.249</a>
</li>
<li>
<span class="authors">Martin Delacourt and Benjamin Hellouin de Ménibus</span>
<span class="title">Construction of mu-Limit Sets of Two-dimensional Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.262">10.4230/LIPIcs.STACS.2015.262</a>
</li>
<li>
<span class="authors">Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, and Girish Varma</span>
<span class="title">Derandomized Graph Product Results Using the Low Degree Long Code</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.275">10.4230/LIPIcs.STACS.2015.275</a>
</li>
<li>
<span class="authors">Amr Elmasry, Torben Hagerup, and Frank Kammer</span>
<span class="title">Space-efficient Basic Graph Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.288">10.4230/LIPIcs.STACS.2015.288</a>
</li>
<li>
<span class="authors">Henning Fernau, Florin Manea, Robert Mercas, and Markus L. Schmid</span>
<span class="title">Pattern Matching with Variables: Fast Algorithms and New Hardness Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.302">10.4230/LIPIcs.STACS.2015.302</a>
</li>
<li>
<span class="authors">Takuro Fukunaga</span>
<span class="title">Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.316">10.4230/LIPIcs.STACS.2015.316</a>
</li>
<li>
<span class="authors">Esther Galby, Joël Ouaknine, and James Worrell</span>
<span class="title">On Matrix Powering in Low Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.329">10.4230/LIPIcs.STACS.2015.329</a>
</li>
<li>
<span class="authors">Bernd Gärtner and Antonis Thomas</span>
<span class="title">The Complexity of Recognizing Unique Sink Orientations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.341">10.4230/LIPIcs.STACS.2015.341</a>
</li>
<li>
<span class="authors">Archontia C. Giannopoulou and George B. Mertzios</span>
<span class="title">New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.354">10.4230/LIPIcs.STACS.2015.354</a>
</li>
<li>
<span class="authors">Anaël Grandjean and Victor Poupet</span>
<span class="title">Comparing 1D and 2D Real Time on Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.367">10.4230/LIPIcs.STACS.2015.367</a>
</li>
<li>
<span class="authors">Dima Grigoriev and Vladimir V. Podolskii</span>
<span class="title">Tropical Effective Primary and Dual Nullstellens"atze</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.379">10.4230/LIPIcs.STACS.2015.379</a>
</li>
<li>
<span class="authors">Jan Hazla and Thomas Holenstein</span>
<span class="title">Upper Tail Estimates with Combinatorial Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.392">10.4230/LIPIcs.STACS.2015.392</a>
</li>
<li>
<span class="authors">Andrew V. Goldberg, Haim Kaplan, Sagi Hed, and Robert E. Tarjan</span>
<span class="title">Minimum Cost Flows in Graphs with Unit Capacities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.406">10.4230/LIPIcs.STACS.2015.406</a>
</li>
<li>
<span class="authors">Rupert Hölzl, Sanjay Jain, and Frank Stephan</span>
<span class="title">Inductive Inference and Reverse Mathematics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.420">10.4230/LIPIcs.STACS.2015.420</a>
</li>
<li>
<span class="authors">Jacob Holm and Eva Rotenberg</span>
<span class="title">Dynamic Planar Embeddings of Dynamic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.434">10.4230/LIPIcs.STACS.2015.434</a>
</li>
<li>
<span class="authors">Mathieu Hoyrup and Cristóbal Rojas</span>
<span class="title">On the Information Carried by Programs about the Objects They Compute</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.447">10.4230/LIPIcs.STACS.2015.447</a>
</li>
<li>
<span class="authors">Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, and Qin Zhang</span>
<span class="title">Communication Complexity of Approximate Matching in Distributed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.460">10.4230/LIPIcs.STACS.2015.460</a>
</li>
<li>
<span class="authors">Sungjin Im, Benjamin Moseley, and Kirk Pruhs</span>
<span class="title">Stochastic Scheduling of Heavy-tailed Jobs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.474">10.4230/LIPIcs.STACS.2015.474</a>
</li>
<li>
<span class="authors">Jesper Jansson, Zhaoxian Li, and Wing-Kin Sung</span>
<span class="title">On Finding the Adams Consensus Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.487">10.4230/LIPIcs.STACS.2015.487</a>
</li>
<li>
<span class="authors">Iyad Kanj and Ge Xia</span>
<span class="title">Flip Distance Is in FPT Time O(n+ k * c^k)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.500">10.4230/LIPIcs.STACS.2015.500</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">New Pairwise Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.513">10.4230/LIPIcs.STACS.2015.513</a>
</li>
<li>
<span class="authors">Neeraj Kayal and Chandan Saha</span>
<span class="title">Multi-k-ic Depth Three Circuit Lower Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.527">10.4230/LIPIcs.STACS.2015.527</a>
</li>
<li>
<span class="authors">Pavel Klavík and Peter Zeman</span>
<span class="title">Automorphism Groups of Geometrically Represented Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.540">10.4230/LIPIcs.STACS.2015.540</a>
</li>
<li>
<span class="authors">Philip N. Klein, Claire Mathieu, and Hang Zhou</span>
<span class="title">Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.554">10.4230/LIPIcs.STACS.2015.554</a>
</li>
<li>
<span class="authors">Stavros G. Kolliopoulos and Yannis Moysoglou</span>
<span class="title">Extended Formulation Lower Bounds via Hypergraph Coloring?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.568">10.4230/LIPIcs.STACS.2015.568</a>
</li>
<li>
<span class="authors">Dmitry Kosolobov</span>
<span class="title">Lempel-Ziv Factorization May Be Harder Than Computing All Runs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.582">10.4230/LIPIcs.STACS.2015.582</a>
</li>
<li>
<span class="authors">Andreas Krebs, Klaus-Jörn Lange, and Michael Ludwig</span>
<span class="title">Visibly Counter Languages and Constant Depth Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.594">10.4230/LIPIcs.STACS.2015.594</a>
</li>
<li>
<span class="authors">Jakub Lacki and Piotr Sankowski</span>
<span class="title">Optimal Decremental Connectivity in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.608">10.4230/LIPIcs.STACS.2015.608</a>
</li>
<li>
<span class="authors">Angsheng Li and Pan Peng</span>
<span class="title">Testing Small Set Expansion in General Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.622">10.4230/LIPIcs.STACS.2015.622</a>
</li>
<li>
<span class="authors">Alejandro López-Ortiz, Marc P. Renault, and Adi Rosén</span>
<span class="title">Paid Exchanges are Worth the Price</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.636">10.4230/LIPIcs.STACS.2015.636</a>
</li>
<li>
<span class="authors">Turlough Neary</span>
<span class="title">Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.649">10.4230/LIPIcs.STACS.2015.649</a>
</li>
<li>
<span class="authors">Thomas Place and Marc Zeitoun</span>
<span class="title">Separation and the Successor Relation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.662">10.4230/LIPIcs.STACS.2015.662</a>
</li>
<li>
<span class="authors">Andreas Schmid and Jens M. Schmidt</span>
<span class="title">Computing 2-Walks in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.676">10.4230/LIPIcs.STACS.2015.676</a>
</li>
<li>
<span class="authors">Pascal Schweitzer</span>
<span class="title">Towards an Isomorphism Dichotomy for Hereditary Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.689">10.4230/LIPIcs.STACS.2015.689</a>
</li>
<li>
<span class="authors">Till Tantau</span>
<span class="title">Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.703">10.4230/LIPIcs.STACS.2015.703</a>
</li>
<li>
<span class="authors">Shai Vardi</span>
<span class="title">The Returning Secretary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.716">10.4230/LIPIcs.STACS.2015.716</a>
</li>
<li>
<span class="authors">Marcin Wrochna</span>
<span class="title">Homomorphism Reconfiguration via Homotopy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.730">10.4230/LIPIcs.STACS.2015.730</a>
</li>
<li>
<span class="authors">Georg Zetzsche</span>
<span class="title">Computing Downward Closures for Stacked Counter Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2015.743">10.4230/LIPIcs.STACS.2015.743</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