<h2>LIPIcs, Volume 25, STACS 2014</h2>
<ul>
<li>
<span class="authors">Ernst W. Mayr and Natacha Portier</span>
<span class="title">LIPIcs, Volume 25, STACS'14, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014">10.4230/LIPIcs.STACS.2014</a>
</li>
<li>
<span class="authors">Ernst W. Mayr and Natacha Portier</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.i">10.4230/LIPIcs.STACS.2014.i</a>
</li>
<li>
<span class="authors">Javier Esparza</span>
<span class="title">Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.1">10.4230/LIPIcs.STACS.2014.1</a>
</li>
<li>
<span class="authors">Peter Bro Miltersen</span>
<span class="title">Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.11">10.4230/LIPIcs.STACS.2014.11</a>
</li>
<li>
<span class="authors">Luc Segoufin</span>
<span class="title">A glimpse on constant delay enumeration (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.13">10.4230/LIPIcs.STACS.2014.13</a>
</li>
<li>
<span class="authors">Neeraj Kayal</span>
<span class="title">Arithmetic Circuit Complexity (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.28">10.4230/LIPIcs.STACS.2014.28</a>
</li>
<li>
<span class="authors">Marek Adamczyk, Maxim Sviridenko, and Justin Ward</span>
<span class="title">Submodular Stochastic Probing on Matroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.29">10.4230/LIPIcs.STACS.2014.29</a>
</li>
<li>
<span class="authors">Matthew Anderson and Anuj Dawar</span>
<span class="title">On Symmetric Circuits and Fixed-Point Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.41">10.4230/LIPIcs.STACS.2014.41</a>
</li>
<li>
<span class="authors">Eric Angel, Evripidis Bampis, and Vincent Chau</span>
<span class="title">Throughput Maximization in the Speed-Scaling Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.53">10.4230/LIPIcs.STACS.2014.53</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Neal Barcelo, Mario Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato</span>
<span class="title">Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.63">10.4230/LIPIcs.STACS.2014.63</a>
</li>
<li>
<span class="authors">Julio Araujo, Nicolas Nisse, and Stéphane Pérennes</span>
<span class="title">Weighted Coloring in Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.75">10.4230/LIPIcs.STACS.2014.75</a>
</li>
<li>
<span class="authors">Yossi Azar, Matthias Englert, Iftah Gamzu, and Eytan Kidron</span>
<span class="title">Generalized Reordering Buffer Management</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.87">10.4230/LIPIcs.STACS.2014.87</a>
</li>
<li>
<span class="authors">Haris Aziz and Bart de Keijzer</span>
<span class="title">Shapley meets Shapley</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.99">10.4230/LIPIcs.STACS.2014.99</a>
</li>
<li>
<span class="authors">Nicolas Bacquey</span>
<span class="title">Complexity classes on spatially periodic Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.112">10.4230/LIPIcs.STACS.2014.112</a>
</li>
<li>
<span class="authors">Bruno Bauwens</span>
<span class="title">Asymmetry of the Kolmogorov complexity of online predicting odd and even bits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.125">10.4230/LIPIcs.STACS.2014.125</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Martin Gronemann, and Chrysanthi N. Raftopoulou</span>
<span class="title">Two-Page Book Embeddings of 4-Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.137">10.4230/LIPIcs.STACS.2014.137</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, and Erfan Sadeqi Azer</span>
<span class="title">Palindrome Recognition In The Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.149">10.4230/LIPIcs.STACS.2014.149</a>
</li>
<li>
<span class="authors">Francine Blanchet-Sadri, Michelle Bodnar, and Benjamin De Winkle</span>
<span class="title">New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.162">10.4230/LIPIcs.STACS.2014.162</a>
</li>
<li>
<span class="authors">Joan Boyar, Shahin Kamali, Kim S. Larsen, and Alejandro López-Ortiz</span>
<span class="title">Online Bin Packing with Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.174">10.4230/LIPIcs.STACS.2014.174</a>
</li>
<li>
<span class="authors">Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, and He Sun</span>
<span class="title">Balls into bins via local search: cover time and maximum load</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.187">10.4230/LIPIcs.STACS.2014.187</a>
</li>
<li>
<span class="authors">Véronique Bruyère, Emmanuel Filiot, Mickael Randour, and Jean-François Raskin</span>
<span class="title">Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.199">10.4230/LIPIcs.STACS.2014.199</a>
</li>
<li>
<span class="authors">Yixin Cao and Dániel Marx</span>
<span class="title">Chordal Editing is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.214">10.4230/LIPIcs.STACS.2014.214</a>
</li>
<li>
<span class="authors">Jian-Jia Chen, Mong-Jen Kao, D.T. Lee, Ignaz Rutter, and Dorothea Wagner</span>
<span class="title">Online Dynamic Power Management with Hard Real-Time Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.226">10.4230/LIPIcs.STACS.2014.226</a>
</li>
<li>
<span class="authors">Suryajith Chillara and Partha Mukhopadhyay</span>
<span class="title">Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.239">10.4230/LIPIcs.STACS.2014.239</a>
</li>
<li>
<span class="authors">Marek Cygan and Tomasz Kociumaka</span>
<span class="title">Constant Factor Approximation for Capacitated k-Center with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.251">10.4230/LIPIcs.STACS.2014.251</a>
</li>
<li>
<span class="authors">Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, and Przemyslaw Uznanski</span>
<span class="title">Bounds on the Cover Time of Parallel Rotor Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.263">10.4230/LIPIcs.STACS.2014.263</a>
</li>
<li>
<span class="authors">Yann Disser, Max Klimm, Nicole Megow, and Sebastian Stiller</span>
<span class="title">Packing a Knapsack of Unknown Capacity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.276">10.4230/LIPIcs.STACS.2014.276</a>
</li>
<li>
<span class="authors">Pal Gronas Drange, Fedor V. Fomin, Michal Pilipczuk, and Yngve Villanger</span>
<span class="title">Exploring Subexponential Parameterized Complexity of Completion Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.288">10.4230/LIPIcs.STACS.2014.288</a>
</li>
<li>
<span class="authors">Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, and Marc Vinyals</span>
<span class="title">From Small Space to Small Width in Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.300">10.4230/LIPIcs.STACS.2014.300</a>
</li>
<li>
<span class="authors">Valentin Garnero, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos</span>
<span class="title">Explicit Linear Kernels via Dynamic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.312">10.4230/LIPIcs.STACS.2014.312</a>
</li>
<li>
<span class="authors">Dmitry Gavinsky and Pavel Pudlák</span>
<span class="title">Partition Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.325">10.4230/LIPIcs.STACS.2014.325</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Florin Manea, and Dirk Nowotka</span>
<span class="title">Testing Generalised Freeness of Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.337">10.4230/LIPIcs.STACS.2014.337</a>
</li>
<li>
<span class="authors">Andreas Göbel, Leslie Ann Goldberg, and David Richerby</span>
<span class="title">Counting Homomorphisms to Cactus Graphs Modulo 2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.350">10.4230/LIPIcs.STACS.2014.350</a>
</li>
<li>
<span class="authors">Mathieu Hoyrup</span>
<span class="title">Irreversible computable functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.362">10.4230/LIPIcs.STACS.2014.362</a>
</li>
<li>
<span class="authors">Martin Huschenbett and Manfred Kufleitner</span>
<span class="title">Ehrenfeucht-Fraïssé Games on Omega-Terms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.374">10.4230/LIPIcs.STACS.2014.374</a>
</li>
<li>
<span class="authors">Tomohiro I, Juha Kärkkäinen, and Dominik Kempa</span>
<span class="title">Faster Sparse Suffix Sorting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.386">10.4230/LIPIcs.STACS.2014.386</a>
</li>
<li>
<span class="authors">Gábor Ivanyos, Marek Karpinski, Youming Qiao, and Miklos Santha</span>
<span class="title">Generalized Wong sequences and their applications to Edmonds' problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.397">10.4230/LIPIcs.STACS.2014.397</a>
</li>
<li>
<span class="authors">Kazuo Iwama and Atsuki Nagao</span>
<span class="title">Read-Once Branching Programs for Tree Evaluation Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.409">10.4230/LIPIcs.STACS.2014.409</a>
</li>
<li>
<span class="authors">Emmanuel Jeandel</span>
<span class="title">Computability of the entropy of one-tape Turing machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.421">10.4230/LIPIcs.STACS.2014.421</a>
</li>
<li>
<span class="authors">Tomas Jelinek, Marcus Klaas, and Guido Schäfer</span>
<span class="title">Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.433">10.4230/LIPIcs.STACS.2014.433</a>
</li>
<li>
<span class="authors">Artur Jez and Markus Lohrey</span>
<span class="title">Approximation of smallest linear tree grammar</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.445">10.4230/LIPIcs.STACS.2014.445</a>
</li>
<li>
<span class="authors">Ken-ichi Kawarabayashi and Mikkel Thorup</span>
<span class="title">Coloring 3-colorable graphs with o(n^{1/5}) colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.458">10.4230/LIPIcs.STACS.2014.458</a>
</li>
<li>
<span class="authors">Dennis Komm, Rastislav Královic, Richard Královic, and Tobias Mömke</span>
<span class="title">Randomized Online Algorithms with High Probability Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.470">10.4230/LIPIcs.STACS.2014.470</a>
</li>
<li>
<span class="authors">Robin Kothari</span>
<span class="title">An optimal quantum algorithm for the oracle identification problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.482">10.4230/LIPIcs.STACS.2014.482</a>
</li>
<li>
<span class="authors">Timo Kötzing</span>
<span class="title">A Solution to Wiehagen's Thesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.494">10.4230/LIPIcs.STACS.2014.494</a>
</li>
<li>
<span class="authors">Moshe Lewenstein, Yakov Nekrich, and Jeffrey Scott Vitter</span>
<span class="title">Space-Efficient String Indexing for Wildcard Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.506">10.4230/LIPIcs.STACS.2014.506</a>
</li>
<li>
<span class="authors">Diego Figueira and Leonid Libkin</span>
<span class="title">Synchronizing Relations on Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.518">10.4230/LIPIcs.STACS.2014.518</a>
</li>
<li>
<span class="authors">Markus Lohrey and Georg Zetzsche</span>
<span class="title">On Boolean closed full trios and rational Kripke frames</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.530">10.4230/LIPIcs.STACS.2014.530</a>
</li>
<li>
<span class="authors">Dániel Marx and Michal Pilipczuk</span>
<span class="title">Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.542">10.4230/LIPIcs.STACS.2014.542</a>
</li>
<li>
<span class="authors">John C. Mitchell and Joe Zimmerman</span>
<span class="title">Data-Oblivious Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.554">10.4230/LIPIcs.STACS.2014.554</a>
</li>
<li>
<span class="authors">Benoit Monin</span>
<span class="title">Higher randomness and forcing with closed sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.566">10.4230/LIPIcs.STACS.2014.566</a>
</li>
<li>
<span class="authors">Nabil H. Mustafa and Saurabh Ray</span>
<span class="title">Near-Optimal Generalisations of a Theorem of Macbeath</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.578">10.4230/LIPIcs.STACS.2014.578</a>
</li>
<li>
<span class="authors">Dung T. Nguyen and Alan L. Selman</span>
<span class="title">Non-autoreducible Sets for NEXP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.590">10.4230/LIPIcs.STACS.2014.590</a>
</li>
<li>
<span class="authors">André Nies</span>
<span class="title">Differentiability of polynomial time computable functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.602">10.4230/LIPIcs.STACS.2014.602</a>
</li>
<li>
<span class="authors">Adeline Pierrot and Dominique Rossin</span>
<span class="title">2-Stack Sorting is polynomial</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.614">10.4230/LIPIcs.STACS.2014.614</a>
</li>
<li>
<span class="authors">Michele Scquizzato and Francesco Silvestri</span>
<span class="title">Communication Lower Bounds for Distributed-Memory Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.627">10.4230/LIPIcs.STACS.2014.627</a>
</li>
<li>
<span class="authors">Martin Skutella, Maxim Sviridenko, and Marc Uetz</span>
<span class="title">Stochastic Scheduling on Unrelated Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.639">10.4230/LIPIcs.STACS.2014.639</a>
</li>
<li>
<span class="authors">Hannes Uppman</span>
<span class="title">Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.651">10.4230/LIPIcs.STACS.2014.651</a>
</li>
<li>
<span class="authors">Thomas Watson</span>
<span class="title">The Complexity of Deciding Statistical Properties of Samplable Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.663">10.4230/LIPIcs.STACS.2014.663</a>
</li>
<li>
<span class="authors">Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda</span>
<span class="title">Faster Compact On-Line Lempel-Ziv Factorization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2014.675">10.4230/LIPIcs.STACS.2014.675</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