<h2>LIPIcs, Volume 20, STACS 2013</h2>
<ul>
<li>
<span class="authors">Natacha Portier and Thomas Wilke</span>
<span class="title">LIPIcs, Volume 20, STACS'13, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013">10.4230/LIPIcs.STACS.2013</a>
</li>
<li>
<span class="authors">Natacha Portier and Thomas Wilke</span>
<span class="title">Frontmatter, Table of Contents, Preface, Workshop Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.i">10.4230/LIPIcs.STACS.2013.i</a>
</li>
<li>
<span class="authors">Kousha Etessami</span>
<span class="title">The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.1">10.4230/LIPIcs.STACS.2013.1</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Aurélie Lagoutte, and Thomassé Stéphan</span>
<span class="title">Graph coloring, communication complexity and the stubborn problem (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.3">10.4230/LIPIcs.STACS.2013.3</a>
</li>
<li>
<span class="authors">Kurt Mehlhorn</span>
<span class="title">Physarum Computations (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.5">10.4230/LIPIcs.STACS.2013.5</a>
</li>
<li>
<span class="authors">Dániel Marx</span>
<span class="title">Algorithmic Graph Structure Theory (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.7">10.4230/LIPIcs.STACS.2013.7</a>
</li>
<li>
<span class="authors">Fedor V. Fomin and Yngve Villanger</span>
<span class="title">Searching for better fill-in</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.8">10.4230/LIPIcs.STACS.2013.8</a>
</li>
<li>
<span class="authors">Andreas Björklund, Petteri Kaski, and Lukasz Kowalik</span>
<span class="title">Probably Optimal Graph Motifs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.20">10.4230/LIPIcs.STACS.2013.20</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, and Yngve Villanger</span>
<span class="title">Tight bounds for Parameterized Complexity of Cluster Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.32">10.4230/LIPIcs.STACS.2013.32</a>
</li>
<li>
<span class="authors">Albert Atserias and Sergi Oliva</span>
<span class="title">Bounded-width QBF is PSPACE-complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.44">10.4230/LIPIcs.STACS.2013.44</a>
</li>
<li>
<span class="authors">Daniel Paulusma, Friedrich Slivovsky, and Stefan Szeider</span>
<span class="title">Model Counting for CNF Formulas of Bounded Modular Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.55">10.4230/LIPIcs.STACS.2013.55</a>
</li>
<li>
<span class="authors">Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, and Stefan Szeider</span>
<span class="title">Backdoors to q-Horn</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.67">10.4230/LIPIcs.STACS.2013.67</a>
</li>
<li>
<span class="authors">Stefan Kratsch</span>
<span class="title">On Polynomial Kernels for Sparse Integer Linear Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.80">10.4230/LIPIcs.STACS.2013.80</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos</span>
<span class="title">Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.92">10.4230/LIPIcs.STACS.2013.92</a>
</li>
<li>
<span class="authors">Martijn Baartse and Klaus Meer</span>
<span class="title">The PCP theorem for NP over the reals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.104">10.4230/LIPIcs.STACS.2013.104</a>
</li>
<li>
<span class="authors">Adam Case and Jack H. Lutz</span>
<span class="title">Mutual Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.116">10.4230/LIPIcs.STACS.2013.116</a>
</li>
<li>
<span class="authors">Yoichi Iwata and Yuichi Yoshida</span>
<span class="title">Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.127">10.4230/LIPIcs.STACS.2013.127</a>
</li>
<li>
<span class="authors">Konstantin Makarychev</span>
<span class="title">Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.139">10.4230/LIPIcs.STACS.2013.139</a>
</li>
<li>
<span class="authors">Xi Chen, Martin Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, and David Richerby</span>
<span class="title">The complexity of approximating conservative counting CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.148">10.4230/LIPIcs.STACS.2013.148</a>
</li>
<li>
<span class="authors">Yuval Ishai, Eyal Kushilevitz, and Omer Strulovich</span>
<span class="title">Lossy Chains and Fractional Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.160">10.4230/LIPIcs.STACS.2013.160</a>
</li>
<li>
<span class="authors">Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M Summers, and Andrew Winslow</span>
<span class="title">Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.172">10.4230/LIPIcs.STACS.2013.172</a>
</li>
<li>
<span class="authors">Malte Darnstädt, Hans Ulrich Simon, and Balázs Szörényi</span>
<span class="title">Unlabeled Data Does Provably Help</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.185">10.4230/LIPIcs.STACS.2013.185</a>
</li>
<li>
<span class="authors">Michal Pilipczuk</span>
<span class="title">Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.197">10.4230/LIPIcs.STACS.2013.197</a>
</li>
<li>
<span class="authors">Marek Cygan, Fabrizio Grandoni, and Telikepalli Kavitha</span>
<span class="title">On Pairwise Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.209">10.4230/LIPIcs.STACS.2013.209</a>
</li>
<li>
<span class="authors">Jisu Jeong, O-joung Kwon, and Sang-il Oum</span>
<span class="title">Excluded vertex-minors for graphs of linear rank-width at most k.</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.221">10.4230/LIPIcs.STACS.2013.221</a>
</li>
<li>
<span class="authors">Artur Jez</span>
<span class="title">Recompression: a simple and powerful technique for word equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.233">10.4230/LIPIcs.STACS.2013.233</a>
</li>
<li>
<span class="authors">Tomasz Kociumaka, Jakub Radoszewski, and Wojciech Rytter</span>
<span class="title">Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.245">10.4230/LIPIcs.STACS.2013.245</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, and Catalin Tiseanu</span>
<span class="title">Finding Pseudo-repetitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.257">10.4230/LIPIcs.STACS.2013.257</a>
</li>
<li>
<span class="authors">Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, and Andrew Winslow</span>
<span class="title">Algorithms for Designing Pop-Up Cards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.269">10.4230/LIPIcs.STACS.2013.269</a>
</li>
<li>
<span class="authors">Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, and Kunihiko Sadakane</span>
<span class="title">Space-Time Trade-offs for Stack-Based Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.281">10.4230/LIPIcs.STACS.2013.281</a>
</li>
<li>
<span class="authors">Danny Z. Chen and Haitao Wang</span>
<span class="title">L_1 Shortest Path Queries among Polygonal Obstacles in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.293">10.4230/LIPIcs.STACS.2013.293</a>
</li>
<li>
<span class="authors">Manfred Kufleitner and Alexander Lauser</span>
<span class="title">Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.305">10.4230/LIPIcs.STACS.2013.305</a>
</li>
<li>
<span class="authors">Wieslaw Szwast and Lidia Tendera</span>
<span class="title">FO^2 with one transitive relation is decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.317">10.4230/LIPIcs.STACS.2013.317</a>
</li>
<li>
<span class="authors">Luc Dartois and Charles Paperman</span>
<span class="title">Two-variable first order logic with modular predicates over words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.329">10.4230/LIPIcs.STACS.2013.329</a>
</li>
<li>
<span class="authors">Magnus Wahlström</span>
<span class="title">Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.341">10.4230/LIPIcs.STACS.2013.341</a>
</li>
<li>
<span class="authors">Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, and Erik Jan van Leeuwen</span>
<span class="title">Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.353">10.4230/LIPIcs.STACS.2013.353</a>
</li>
<li>
<span class="authors">Florent Capelli, Arnaud Durand, and Stefan Mengel</span>
<span class="title">The arithmetic complexity of tensor contractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.365">10.4230/LIPIcs.STACS.2013.365</a>
</li>
<li>
<span class="authors">Edith Hemaspaandra, Lane A. Hemaspaandra, and Curtis Menton</span>
<span class="title">Search versus Decision for Election Manipulation Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.377">10.4230/LIPIcs.STACS.2013.377</a>
</li>
<li>
<span class="authors">Leah Epstein, Asaf Levin, Danny Segev, and Oren Weimann</span>
<span class="title">Improved Bounds for Online Preemptive Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.389">10.4230/LIPIcs.STACS.2013.389</a>
</li>
<li>
<span class="authors">Markus Jalsenius, Benny Porat, and Benjamin Sach</span>
<span class="title">Parameterized Matching in the Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.400">10.4230/LIPIcs.STACS.2013.400</a>
</li>
<li>
<span class="authors">Meghana Nasre</span>
<span class="title">Popular Matchings: Structure and Cheating Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.412">10.4230/LIPIcs.STACS.2013.412</a>
</li>
<li>
<span class="authors">Hartmut Klauck and Ronald de Wolf</span>
<span class="title">Fooling One-Sided Quantum Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.424">10.4230/LIPIcs.STACS.2013.424</a>
</li>
<li>
<span class="authors">Loïck Magnin and Jérémie Roland</span>
<span class="title">Explicit relation between all lower bound techniques for quantum query complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.434">10.4230/LIPIcs.STACS.2013.434</a>
</li>
<li>
<span class="authors">Andris Ambainis, Arturs Backurs, Juris Smotrovs, and Ronald de Wolf</span>
<span class="title">Optimal quantum query bounds for almost all Boolean functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.446">10.4230/LIPIcs.STACS.2013.446</a>
</li>
<li>
<span class="authors">Nathanael Francois and Frédéric Magniez</span>
<span class="title">Streaming Complexity of Checking Priority Queues</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.454">10.4230/LIPIcs.STACS.2013.454</a>
</li>
<li>
<span class="authors">Konstantin Kutzkov</span>
<span class="title">Deterministic algorithms for skewed matrix products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.466">10.4230/LIPIcs.STACS.2013.466</a>
</li>
<li>
<span class="authors">Tengyu Ma, Bo Tang, and Yajun Wang</span>
<span class="title">The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.478">10.4230/LIPIcs.STACS.2013.478</a>
</li>
<li>
<span class="authors">Emmanuel Jeandel and Pascal Vanier</span>
<span class="title">Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.490">10.4230/LIPIcs.STACS.2013.490</a>
</li>
<li>
<span class="authors">Ines Klimann</span>
<span class="title">The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.502">10.4230/LIPIcs.STACS.2013.502</a>
</li>
<li>
<span class="authors">Amir M. Ben-Amram</span>
<span class="title">Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.514">10.4230/LIPIcs.STACS.2013.514</a>
</li>
<li>
<span class="authors">Yonatan Bilu, Amit Daniely, Nati Linial, and Michael Saks</span>
<span class="title">On the practically interesting instances of MAXCUT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.526">10.4230/LIPIcs.STACS.2013.526</a>
</li>
<li>
<span class="authors">György Dósa and Jiri Sgall</span>
<span class="title">First Fit bin packing: A tight analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.538">10.4230/LIPIcs.STACS.2013.538</a>
</li>
<li>
<span class="authors">Amin Karbasi and Morteza Zadimoghaddam</span>
<span class="title">Constrained Binary Identification Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.550">10.4230/LIPIcs.STACS.2013.550</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk, Tomasz Idziaszek, and Michal Skrzypczak</span>
<span class="title">Regular languages of thin trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.562">10.4230/LIPIcs.STACS.2013.562</a>
</li>
<li>
<span class="authors">Thomas Colcombet and Laure Daviaud</span>
<span class="title">Approximate comparison of distance automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.574">10.4230/LIPIcs.STACS.2013.574</a>
</li>
<li>
<span class="authors">Martin Huschenbett</span>
<span class="title">The Rank of Tree-Automatic Linear Orderings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.586">10.4230/LIPIcs.STACS.2013.586</a>
</li>
<li>
<span class="authors">Julien Clément, Thu Hien Nguyen Thi, and Brigitte Vallée</span>
<span class="title">A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.598">10.4230/LIPIcs.STACS.2013.598</a>
</li>
<li>
<span class="authors">Mark Braverman and Gal Oshri</span>
<span class="title">Search using queries on indistinguishable items</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.610">10.4230/LIPIcs.STACS.2013.610</a>
</li>
<li>
<span class="authors">Balagopal Komarath and Jayalal M. N. Sarma</span>
<span class="title">Pebbling, Entropy and Branching Program Size Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.622">10.4230/LIPIcs.STACS.2013.622</a>
</li>
<li>
<span class="authors">Thomas Watson</span>
<span class="title">Advice Lower Bounds for the Dense Model Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.634">10.4230/LIPIcs.STACS.2013.634</a>
</li>
<li>
<span class="authors">Natacha Portier and Thomas Wilke</span>
<span class="title">Author Index</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2013.646">10.4230/LIPIcs.STACS.2013.646</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