<h2>LIPIcs, Volume 5, STACS 2010</h2>
<ul>
<li>
<span class="authors">Jean-Yves Marion and Thomas Schwentick</span>
<span class="title">LIPIcs, Volume 5, STACS'10, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010">10.4230/LIPIcs.STACS.2010</a>
</li>
<li>
<span class="authors">Jean-Yves Marion and Thomas Schwentick</span>
<span class="title">Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2439">10.4230/LIPIcs.STACS.2010.2439</a>
</li>
<li>
<span class="authors">Jean-Yves Marion and Thomas Schwentick</span>
<span class="title">Table of Contents -- 27th International Symposium on Theoretical Aspects of Computer Science</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2505">10.4230/LIPIcs.STACS.2010.2505</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk</span>
<span class="title">Beyond omega-Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2440">10.4230/LIPIcs.STACS.2010.2440</a>
</li>
<li>
<span class="authors">Rolf Niedermeier</span>
<span class="title">Reflections on Multivariate Algorithmics and Problem Parameterization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2495">10.4230/LIPIcs.STACS.2010.2495</a>
</li>
<li>
<span class="authors">Jacques Stern</span>
<span class="title">Mathematics, Cryptology, Security</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2441">10.4230/LIPIcs.STACS.2010.2441</a>
</li>
<li>
<span class="authors">Anna Adamaszek and Michal Adamaszek</span>
<span class="title">Large-Girth Roots of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2442">10.4230/LIPIcs.STACS.2010.2442</a>
</li>
<li>
<span class="authors">Xavier Allamigeon, Stéphane Gaubert, and Éric Goubault</span>
<span class="title">The Tropical Double Description Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2443">10.4230/LIPIcs.STACS.2010.2443</a>
</li>
<li>
<span class="authors">Vikraman Arvind and Srikanth Srinivasan</span>
<span class="title">The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2444">10.4230/LIPIcs.STACS.2010.2444</a>
</li>
<li>
<span class="authors">László Babai, Anandam Banerjee, Raghav Kulkarni, and Vipul Naik</span>
<span class="title">Evasiveness and the Distribution of Prime Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2445">10.4230/LIPIcs.STACS.2010.2445</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, and Dariusz R. Kowalski</span>
<span class="title">Dynamic Sharing of a Multiple Access Channel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2446">10.4230/LIPIcs.STACS.2010.2446</a>
</li>
<li>
<span class="authors">Andreas Björklund</span>
<span class="title">Exact Covers via Determinants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2447">10.4230/LIPIcs.STACS.2010.2447</a>
</li>
<li>
<span class="authors">Felix Brandt, Felix Fischer, and Markus Holzer</span>
<span class="title">On Iterated Dominance, Matrix Elimination, and Matched Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2448">10.4230/LIPIcs.STACS.2010.2448</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, and Rafail Ostrovsky</span>
<span class="title">AMS Without 4-Wise Independence on Product Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2449">10.4230/LIPIcs.STACS.2010.2449</a>
</li>
<li>
<span class="authors">Sergey Bravyi, Aram W. Harrow, and Avinatan Hassidim</span>
<span class="title">Quantum Algorithms for Testing Properties of Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2450">10.4230/LIPIcs.STACS.2010.2450</a>
</li>
<li>
<span class="authors">Nader H. Bshouty and Hanna Mazzawi</span>
<span class="title">Optimal Query Complexity for Reconstructing Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2496">10.4230/LIPIcs.STACS.2010.2496</a>
</li>
<li>
<span class="authors">Julien Cervelle, Enrico Formenti, and Pierre Guillon</span>
<span class="title">Ultimate Traces of Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2451">10.4230/LIPIcs.STACS.2010.2451</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Eldar Fischer, Oded Lachish, and Raphael Yuster</span>
<span class="title">Two-phase Algorithms for the Parametric Shortest Path Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2452">10.4230/LIPIcs.STACS.2010.2452</a>
</li>
<li>
<span class="authors">Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting</span>
<span class="title">Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2453">10.4230/LIPIcs.STACS.2010.2453</a>
</li>
<li>
<span class="authors">Shiri Chechik and David Peleg</span>
<span class="title">Robust Fault Tolerant Uncapacitated Facility Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2454">10.4230/LIPIcs.STACS.2010.2454</a>
</li>
<li>
<span class="authors">Victor Chen, Elena Grigorescu, and Ronald de Wolf</span>
<span class="title">Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2455">10.4230/LIPIcs.STACS.2010.2455</a>
</li>
<li>
<span class="authors">Bireswar Das, Samir Datta, and Prajakta Nimbhorkar</span>
<span class="title">Log-space Algorithms for Paths and Matchings in k-trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2456">10.4230/LIPIcs.STACS.2010.2456</a>
</li>
<li>
<span class="authors">Bireswar Das, Jacobo Torán, and Fabian Wagner</span>
<span class="title">Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2457">10.4230/LIPIcs.STACS.2010.2457</a>
</li>
<li>
<span class="authors">Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, and Mark de Berg</span>
<span class="title">The Traveling Salesman Problem under Squared Euclidean Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2458">10.4230/LIPIcs.STACS.2010.2458</a>
</li>
<li>
<span class="authors">Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh</span>
<span class="title">Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2459">10.4230/LIPIcs.STACS.2010.2459</a>
</li>
<li>
<span class="authors">Frederic Dorn</span>
<span class="title">Planar Subgraph Isomorphism Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2460">10.4230/LIPIcs.STACS.2010.2460</a>
</li>
<li>
<span class="authors">David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, and Damien Woods</span>
<span class="title">Intrinsic Universality in Self-Assembly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2461">10.4230/LIPIcs.STACS.2010.2461</a>
</li>
<li>
<span class="authors">Paul Dütting, Monika Henzinger, and Ingmar Weber</span>
<span class="title">Sponsored Search, Market Equilibria, and the Hungarian Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2463">10.4230/LIPIcs.STACS.2010.2463</a>
</li>
<li>
<span class="authors">Adrian Dumitrescu and Minghui Jiang</span>
<span class="title">Dispersion in Unit Disks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2464">10.4230/LIPIcs.STACS.2010.2464</a>
</li>
<li>
<span class="authors">Adrian Dumitrescu and Csaba D. Tóth</span>
<span class="title">Long Non-crossing Configurations in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2465">10.4230/LIPIcs.STACS.2010.2465</a>
</li>
<li>
<span class="authors">Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, and David Richerby</span>
<span class="title">The Complexity of Approximating Bounded-Degree Boolean #CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2466">10.4230/LIPIcs.STACS.2010.2466</a>
</li>
<li>
<span class="authors">László Egri, Andrei Krokhin, Benoit Larose, and Pascal Tesson</span>
<span class="title">The Complexity of the List Homomorphism Problem for Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2467">10.4230/LIPIcs.STACS.2010.2467</a>
</li>
<li>
<span class="authors">Leah Epstein, Asaf Levin, Julián Mestre, and Danny Segev</span>
<span class="title">Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2476">10.4230/LIPIcs.STACS.2010.2476</a>
</li>
<li>
<span class="authors">Javier Esparza, Andreas Gaiser, and Stefan Kiefer</span>
<span class="title">Computing Least Fixed Points of Probabilistic Systems of Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2468">10.4230/LIPIcs.STACS.2010.2468</a>
</li>
<li>
<span class="authors">Jiri Fiala, Marcin Kaminski, Bernard Lidický, and Daniël Paulusma</span>
<span class="title">The k-in-a-path Problem for Claw-free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2469">10.4230/LIPIcs.STACS.2010.2469</a>
</li>
<li>
<span class="authors">Fedor V. Fomin and Yngve Villanger</span>
<span class="title">Finding Induced Subgraphs via Minimal Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2470">10.4230/LIPIcs.STACS.2010.2470</a>
</li>
<li>
<span class="authors">Lance Fortnow, Jack H. Lutz, and Elvira Mayordomo</span>
<span class="title">Inseparability and Strong Hypotheses for Disjoint NP Pairs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2471">10.4230/LIPIcs.STACS.2010.2471</a>
</li>
<li>
<span class="authors">Stefan Göller and Markus Lohrey</span>
<span class="title">Branching-time Model Checking of One-counter Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2472">10.4230/LIPIcs.STACS.2010.2472</a>
</li>
<li>
<span class="authors">Serge Grigorieff and Pierre Valarcher</span>
<span class="title">Evolving Multialgebras Unify All Usual Sequential Computation Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2473">10.4230/LIPIcs.STACS.2010.2473</a>
</li>
<li>
<span class="authors">Xiaoyang Gu, John M. Hitchcock, and Aduri Pavan</span>
<span class="title">Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2462">10.4230/LIPIcs.STACS.2010.2462</a>
</li>
<li>
<span class="authors">Pierre Guillon and Gaétan Richard</span>
<span class="title">Revisiting the Rice Theorem of Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2474">10.4230/LIPIcs.STACS.2010.2474</a>
</li>
<li>
<span class="authors">Edward A. Hirsch and Dmitry Itsykson</span>
<span class="title">On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2475">10.4230/LIPIcs.STACS.2010.2475</a>
</li>
<li>
<span class="authors">Maurice Jansen</span>
<span class="title">Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2477">10.4230/LIPIcs.STACS.2010.2477</a>
</li>
<li>
<span class="authors">Artur Jez and Alexander Okhotin</span>
<span class="title">On Equations over Sets of Integers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2478">10.4230/LIPIcs.STACS.2010.2478</a>
</li>
<li>
<span class="authors">Lukasz Jez</span>
<span class="title">Randomized Algorithm for Agreeable Deadlines Packet Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2479">10.4230/LIPIcs.STACS.2010.2479</a>
</li>
<li>
<span class="authors">Alexander Kartzow</span>
<span class="title">Collapsible Pushdown Graphs of Level 2 are Tree-Automatic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2480">10.4230/LIPIcs.STACS.2010.2480</a>
</li>
<li>
<span class="authors">Neelesh Khanna and Surender Baswana</span>
<span class="title">Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2481">10.4230/LIPIcs.STACS.2010.2481</a>
</li>
<li>
<span class="authors">Michael Kowalczyk and Jin-Yi Cai</span>
<span class="title">Holant Problems for Regular Graphs with Complex Edge Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2482">10.4230/LIPIcs.STACS.2010.2482</a>
</li>
<li>
<span class="authors">Dietrich Kuske</span>
<span class="title">Is Ramsey's Theorem omega-automatic?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2483">10.4230/LIPIcs.STACS.2010.2483</a>
</li>
<li>
<span class="authors">François Le Gall</span>
<span class="title">An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2484">10.4230/LIPIcs.STACS.2010.2484</a>
</li>
<li>
<span class="authors">Dániel Marx, Barry O'Sullivan, and Igor Razgon</span>
<span class="title">Treewidth Reduction for Constrained Separation and Bipartization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2485">10.4230/LIPIcs.STACS.2010.2485</a>
</li>
<li>
<span class="authors">Claire Mathieu, Ocan Sankur, and Warren Schudy</span>
<span class="title">Online Correlation Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2486">10.4230/LIPIcs.STACS.2010.2486</a>
</li>
<li>
<span class="authors">George B. Mertzios, Ignasi Sau, and Shmuel Zaks</span>
<span class="title">The Recognition of Tolerance and Bounded Tolerance Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2487">10.4230/LIPIcs.STACS.2010.2487</a>
</li>
<li>
<span class="authors">Angelo Montanari, Gabriele Puppis, Pietro Sala, and Guido Sciavicco</span>
<span class="title">Decidability of the Interval Temporal Logic ABB over the Natural Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2488">10.4230/LIPIcs.STACS.2010.2488</a>
</li>
<li>
<span class="authors">David Peleg and Liam Roditty</span>
<span class="title">Relaxed Spanners for Directed Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2489">10.4230/LIPIcs.STACS.2010.2489</a>
</li>
<li>
<span class="authors">Dominik Scheder</span>
<span class="title">Unsatisfiable Linear CNF Formulas Are Large and Complex</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2490">10.4230/LIPIcs.STACS.2010.2490</a>
</li>
<li>
<span class="authors">Jens M. Schmidt</span>
<span class="title">Construction Sequences and Certifying 3-Connectedness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2491">10.4230/LIPIcs.STACS.2010.2491</a>
</li>
<li>
<span class="authors">Lutz Schröder and Dirk Pattinson</span>
<span class="title">Named Models in Coalgebraic Hybrid Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2492">10.4230/LIPIcs.STACS.2010.2492</a>
</li>
<li>
<span class="authors">Rustem Takhanov</span>
<span class="title">A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2493">10.4230/LIPIcs.STACS.2010.2493</a>
</li>
<li>
<span class="authors">Ryan Williams</span>
<span class="title">Alternation-Trading Proofs, Linear Programming, and Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2010.2494">10.4230/LIPIcs.STACS.2010.2494</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