<h2>LIPIcs, Volume 9, STACS 2011</h2>
<ul>
<li>
<span class="authors">Thomas Schwentick and Christoph Dürr</span>
<span class="title">LIPIcs, Volume 9, STACS'11, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011">10.4230/LIPIcs.STACS.2011</a>
</li>
<li>
<span class="authors">Thomas Schwentick and Christoph Dürr</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.i">10.4230/LIPIcs.STACS.2011.i</a>
</li>
<li>
<span class="authors">Susanne Albers</span>
<span class="title">Algorithms for Dynamic Speed Scaling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.1">10.4230/LIPIcs.STACS.2011.1</a>
</li>
<li>
<span class="authors">Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, and Evgenij Thorstensen</span>
<span class="title">Structural Decomposition Methods and What They are Good For</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.12">10.4230/LIPIcs.STACS.2011.12</a>
</li>
<li>
<span class="authors">Hubert Comon-Lundh and Véronique Cortier</span>
<span class="title">How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.29">10.4230/LIPIcs.STACS.2011.29</a>
</li>
<li>
<span class="authors">Saverio Caminiti, Irene Finocchi, and Emanuele G. Fusco</span>
<span class="title">Local dependency dynamic programming in the presence of memory faults</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.45">10.4230/LIPIcs.STACS.2011.45</a>
</li>
<li>
<span class="authors">George Giakkoupis</span>
<span class="title">Tight bounds for rumor spreading in graphs of a given conductance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.57">10.4230/LIPIcs.STACS.2011.57</a>
</li>
<li>
<span class="authors">Liah Kor, Amos Korman, and David Peleg</span>
<span class="title">Tight Bounds For Distributed MST Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.69">10.4230/LIPIcs.STACS.2011.69</a>
</li>
<li>
<span class="authors">Luc Segoufin and Szymon Torunczyk</span>
<span class="title">Automata based verification over linearly ordered data domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.81">10.4230/LIPIcs.STACS.2011.81</a>
</li>
<li>
<span class="authors">Diego Figueira and Luc Segoufin</span>
<span class="title">Bottom-up automata on data trees and vertical XPath</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.93">10.4230/LIPIcs.STACS.2011.93</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk</span>
<span class="title">Data Monoids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.105">10.4230/LIPIcs.STACS.2011.105</a>
</li>
<li>
<span class="authors">Haim Kaplan and Yahav Nussbaum</span>
<span class="title">Minimum s-t cut in undirected planar graphs when the source and the sink are close</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.117">10.4230/LIPIcs.STACS.2011.117</a>
</li>
<li>
<span class="authors">Petr Kolman and Christian Scheideler</span>
<span class="title">Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.129">10.4230/LIPIcs.STACS.2011.129</a>
</li>
<li>
<span class="authors">Jiun-Jie Wang and Xin He</span>
<span class="title">Compact Visibility Representation of Plane Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.141">10.4230/LIPIcs.STACS.2011.141</a>
</li>
<li>
<span class="authors">Jeremie Chalopin, Shantanu Das, Yann Disser, Matus Mihalak, and Peter Widmayer</span>
<span class="title">Telling convex from reflex allows to map a polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.153">10.4230/LIPIcs.STACS.2011.153</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch</span>
<span class="title">Cross-Composition: A New Technique for Kernelization Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.165">10.4230/LIPIcs.STACS.2011.165</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Hans L. Bodlaender</span>
<span class="title">Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.177">10.4230/LIPIcs.STACS.2011.177</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh</span>
<span class="title">Hitting forbidden minors: Approximation and Kernelization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.189">10.4230/LIPIcs.STACS.2011.189</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, and Scott M. Summers</span>
<span class="title">Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.201">10.4230/LIPIcs.STACS.2011.201</a>
</li>
<li>
<span class="authors">Dominik D. Freydenberger, Hossein Nevisi, and Daniel Reidenbach</span>
<span class="title">Weakly Unambiguous Morphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.213">10.4230/LIPIcs.STACS.2011.213</a>
</li>
<li>
<span class="authors">Francine Blanchet-Sadri and John Lensmire</span>
<span class="title">On Minimal Sturmian Partial Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.225">10.4230/LIPIcs.STACS.2011.225</a>
</li>
<li>
<span class="authors">Timon Hertli, Robin A. Moser, and Dominik Scheder</span>
<span class="title">Improving PPSZ for 3-SAT using Critical Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.237">10.4230/LIPIcs.STACS.2011.237</a>
</li>
<li>
<span class="authors">Heng Guo, Sangxia Huang, Pinyan Lu, and Mingji Xia</span>
<span class="title">The Complexity of Weighted Boolean #CSP Modulo k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.249">10.4230/LIPIcs.STACS.2011.249</a>
</li>
<li>
<span class="authors">Martin Dyer and David Richerby</span>
<span class="title">The #CSP Dichotomy is Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.261">10.4230/LIPIcs.STACS.2011.261</a>
</li>
<li>
<span class="authors">Alex Borelllo, Gaetan Richard, and Veronique Terrier</span>
<span class="title">A speed-up of oblivious multi-head finite automata by cellular automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.273">10.4230/LIPIcs.STACS.2011.273</a>
</li>
<li>
<span class="authors">Nazim Fates</span>
<span class="title">Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.284">10.4230/LIPIcs.STACS.2011.284</a>
</li>
<li>
<span class="authors">Ana Busic, Jean Mairesse, and Irene Marcovici</span>
<span class="title">Probabilistic cellular automata, invariant measures, and perfect sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.296">10.4230/LIPIcs.STACS.2011.296</a>
</li>
<li>
<span class="authors">Marcel R. Ackermann, Johannes Bloemer, Daniel Kuntze, and Christian Sohler</span>
<span class="title">Analysis of Agglomerative Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.308">10.4230/LIPIcs.STACS.2011.308</a>
</li>
<li>
<span class="authors">John Case and Timo Koetzing</span>
<span class="title">Measuring Learning Complexity with Criteria Epitomizers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.320">10.4230/LIPIcs.STACS.2011.320</a>
</li>
<li>
<span class="authors">Howard Karloff, Flip Korn, Konstantin Makarychev, and Yuval Rabani</span>
<span class="title">On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.332">10.4230/LIPIcs.STACS.2011.332</a>
</li>
<li>
<span class="authors">Balder ten Cate and Luc Segoufin</span>
<span class="title">Unary negation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.344">10.4230/LIPIcs.STACS.2011.344</a>
</li>
<li>
<span class="authors">Jakub Kallas, Manfred Kufleitner, and Alexander Lauser</span>
<span class="title">First-order Fragments with Successor over Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.356">10.4230/LIPIcs.STACS.2011.356</a>
</li>
<li>
<span class="authors">Martin Mundhenk and Felix Weiß</span>
<span class="title">The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.368">10.4230/LIPIcs.STACS.2011.368</a>
</li>
<li>
<span class="authors">Alejandro Lopez-Ortiz and Claude-Guy Quimper</span>
<span class="title">A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.380">10.4230/LIPIcs.STACS.2011.380</a>
</li>
<li>
<span class="authors">Sze-Hang Chan, Tak-Wah Lam, and Lap-Kei Lee</span>
<span class="title">Scheduling for Weighted Flow Time and Energy with Rejection Penalty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.392">10.4230/LIPIcs.STACS.2011.392</a>
</li>
<li>
<span class="authors">Robert Ganian, Petr Hlineny, and Jan Obdrzalek</span>
<span class="title">Clique-width: When Hard Does Not Mean Impossible</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.404">10.4230/LIPIcs.STACS.2011.404</a>
</li>
<li>
<span class="authors">Dariusz Dereniowski</span>
<span class="title">From Pathwidth to Connected Pathwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.416">10.4230/LIPIcs.STACS.2011.416</a>
</li>
<li>
<span class="authors">Andrew McGregor, Atri Rudra, and Steve Uurtamo</span>
<span class="title">Polynomial Fitting of Data Streams with Applications to Codeword Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.428">10.4230/LIPIcs.STACS.2011.428</a>
</li>
<li>
<span class="authors">Jonathan A. Kelner and Alex Levin</span>
<span class="title">Spectral Sparsification in the Semi-Streaming Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.440">10.4230/LIPIcs.STACS.2011.440</a>
</li>
<li>
<span class="authors">Laurent Bienvenu, Wolfgang Merkle, and Andre Nies</span>
<span class="title">Solovay functions and K-triviality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.452">10.4230/LIPIcs.STACS.2011.452</a>
</li>
<li>
<span class="authors">Andrey Yu. Rumyantsev</span>
<span class="title">Everywhere complex sequences and the probabilistic method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.464">10.4230/LIPIcs.STACS.2011.464</a>
</li>
<li>
<span class="authors">Magnus M. Halldorsson, Boaz Patt-Shamir, and Dror Rawitz</span>
<span class="title">Online Scheduling with Interval Conflicts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.472">10.4230/LIPIcs.STACS.2011.472</a>
</li>
<li>
<span class="authors">Christian E.J. Eggermont, Alexander Schrijver, and Gerhard J. Woeginger</span>
<span class="title">Analysis of multi-stage open shop processing systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.484">10.4230/LIPIcs.STACS.2011.484</a>
</li>
<li>
<span class="authors">Stefan Gulan</span>
<span class="title">Graphs Encoded by Regular Expressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.495">10.4230/LIPIcs.STACS.2011.495</a>
</li>
<li>
<span class="authors">Dominik D. Freydenberger</span>
<span class="title">Extended Regular Expressions: Succinctness and Decidability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.507">10.4230/LIPIcs.STACS.2011.507</a>
</li>
<li>
<span class="authors">Maxim Babenko and Alexey Gusakov</span>
<span class="title">New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.519">10.4230/LIPIcs.STACS.2011.519</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Falk Hueffner, Pascal Lenzner, Carsten Moldenhauer, and Alexander Souza</span>
<span class="title">Balanced Interval Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.531">10.4230/LIPIcs.STACS.2011.531</a>
</li>
<li>
<span class="authors">Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, and Natacha Portier</span>
<span class="title">Symmetric Determinantal Representation of Weakly-Skew Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.543">10.4230/LIPIcs.STACS.2011.543</a>
</li>
<li>
<span class="authors">Markus Blaeser and Christian Engels</span>
<span class="title">Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.555">10.4230/LIPIcs.STACS.2011.555</a>
</li>
<li>
<span class="authors">Youming Qiao, Jayalal Sarma M.N., and Bangsheng Tang</span>
<span class="title">On Isomorphism Testing of Groups with Normal Hall Subgroups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.567">10.4230/LIPIcs.STACS.2011.567</a>
</li>
<li>
<span class="authors">Samir Datta, Raghav Kulkarni, Raghunath Tewari, and N. Variyam Vinodchandran</span>
<span class="title">Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.579">10.4230/LIPIcs.STACS.2011.579</a>
</li>
<li>
<span class="authors">George B. Mertzios</span>
<span class="title">The Recognition of Triangle Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.591">10.4230/LIPIcs.STACS.2011.591</a>
</li>
<li>
<span class="authors">Pawel Parys</span>
<span class="title">Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.603">10.4230/LIPIcs.STACS.2011.603</a>
</li>
<li>
<span class="authors">Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, and Mihalis Yannakakis</span>
<span class="title">Temporal Synthesis for Bounded Systems and Environments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.615">10.4230/LIPIcs.STACS.2011.615</a>
</li>
<li>
<span class="authors">Denis Kuperberg</span>
<span class="title">Linear temporal logic for regular cost functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.627">10.4230/LIPIcs.STACS.2011.627</a>
</li>
<li>
<span class="authors">Adrian Dumitrescu, Andre Schulz, Adam Sheffer, and Csaba D. Toth</span>
<span class="title">Bounds on the maximum multiplicity of some common geometric graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.637">10.4230/LIPIcs.STACS.2011.637</a>
</li>
<li>
<span class="authors">Christian Knauer, Hans Raj Tiwary, and Daniel Werner</span>
<span class="title">On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.649">10.4230/LIPIcs.STACS.2011.649</a>
</li>
<li>
<span class="authors">Andrew M. Childs and Robin Kothari</span>
<span class="title">Quantum query complexity of minor-closed graph properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.661">10.4230/LIPIcs.STACS.2011.661</a>
</li>
<li>
<span class="authors">Anna Gal and Andrew Mills</span>
<span class="title">Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.673">10.4230/LIPIcs.STACS.2011.673</a>
</li>
<li>
<span class="authors">Thomas Schwentick and Christoph Dürr</span>
<span class="title">Index of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2011.685">10.4230/LIPIcs.STACS.2011.685</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