<h2>LIPIcs, Volume 1, STACS 2008</h2>
<ul>
<li>
<span class="authors">Susanne Albers and Pascal Weil</span>
<span class="title">LIPIcs, Volume 1, STACS'08, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008">10.4230/LIPIcs.STACS.2008</a>
</li>
<li>
<span class="authors">Susanne Albers and Pascal Weil</span>
<span class="title">Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1378">10.4230/LIPIcs.STACS.2008.1378</a>
</li>
<li>
<span class="authors">Susanne Albers and Pascal Weil</span>
<span class="title">Preface -- 25th International Symposium on Theoretical Aspects of Computer Science</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1326">10.4230/LIPIcs.STACS.2008.1326</a>
</li>
<li>
<span class="authors">Maxime Crochemore and Lucian Ilie</span>
<span class="title">Understanding Maximal Repetitions in Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1344">10.4230/LIPIcs.STACS.2008.1344</a>
</li>
<li>
<span class="authors">Thomas Schwentick</span>
<span class="title">A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1325">10.4230/LIPIcs.STACS.2008.1325</a>
</li>
<li>
<span class="authors">Mihalis Yannakakis</span>
<span class="title">Equilibria, Fixed Points, and Complexity Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1311">10.4230/LIPIcs.STACS.2008.1311</a>
</li>
<li>
<span class="authors">Pilar Albert, Elvira Mayordomo, Philip Moser, and Sylvain Perifel</span>
<span class="title">Pushdown Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1332">10.4230/LIPIcs.STACS.2008.1332</a>
</li>
<li>
<span class="authors">Andris Ambainis</span>
<span class="title">Quantum search with variable times</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1333">10.4230/LIPIcs.STACS.2008.1333</a>
</li>
<li>
<span class="authors">Alexis Ballier, Bruno Durand, and Emmanuel Jeandal</span>
<span class="title">Structural aspects of tilings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1334">10.4230/LIPIcs.STACS.2008.1334</a>
</li>
<li>
<span class="authors">Laurent Bienvenu, Andrej Muchnik, Alexander Shen, and Nikolay Veraschagin</span>
<span class="title">Limit complexities revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1335">10.4230/LIPIcs.STACS.2008.1335</a>
</li>
<li>
<span class="authors">Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto</span>
<span class="title">Trimmed Moebius Inversion and Graphs of Bounded Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1336">10.4230/LIPIcs.STACS.2008.1336</a>
</li>
<li>
<span class="authors">Markus Bläser and Christian Hoffmann</span>
<span class="title">On the Complexity of the Interlace Polynomial</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1337">10.4230/LIPIcs.STACS.2008.1337</a>
</li>
<li>
<span class="authors">Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, and Leen Stougie</span>
<span class="title">Minimizing Flow Time in the Wireless Gathering Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1338">10.4230/LIPIcs.STACS.2008.1338</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, and James Worrell</span>
<span class="title">On Termination for Faulty Channel Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1339">10.4230/LIPIcs.STACS.2008.1339</a>
</li>
<li>
<span class="authors">Patrick Briest, Martin Hoefer, and Piotr Krysta</span>
<span class="title">Stackelberg Network Pricing Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1340">10.4230/LIPIcs.STACS.2008.1340</a>
</li>
<li>
<span class="authors">Joshua Brody and Amit Chakrabarti</span>
<span class="title">Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1341">10.4230/LIPIcs.STACS.2008.1341</a>
</li>
<li>
<span class="authors">Venkatesan T. Chakaravarthy and Sambuddha Roy</span>
<span class="title">Finding Irrefutable Certificates for S_2^p via Arthur and Merlin</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1342">10.4230/LIPIcs.STACS.2008.1342</a>
</li>
<li>
<span class="authors">Chao Chen and Daniel Freedman</span>
<span class="title">Quantifying Homology Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1343">10.4230/LIPIcs.STACS.2008.1343</a>
</li>
<li>
<span class="authors">Éric Colin de Verdiére and Alexander Schrijver</span>
<span class="title">Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1347">10.4230/LIPIcs.STACS.2008.1347</a>
</li>
<li>
<span class="authors">Carola Wenk and Atlas F. Cook</span>
<span class="title">Geodesic Fréchet Distance Inside a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1330">10.4230/LIPIcs.STACS.2008.1330</a>
</li>
<li>
<span class="authors">Costas S. Iliopoulos, Maxime Crochemore, Marcin Kubica, M. Sohel Rahman, and Tomasz Walen</span>
<span class="title">Improved Algorithms for the Range Next Value Problem and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1359">10.4230/LIPIcs.STACS.2008.1359</a>
</li>
<li>
<span class="authors">Mirela Damian, Robin Flatland, Joseph O'Rourke, and Suneeta Ramaswani</span>
<span class="title">Connecting Polygonizations via Stretches and Twangs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1345">10.4230/LIPIcs.STACS.2008.1345</a>
</li>
<li>
<span class="authors">Samir Datta, Raghav Kulkarni, and Sambuddha Roy</span>
<span class="title">Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1346">10.4230/LIPIcs.STACS.2008.1346</a>
</li>
<li>
<span class="authors">Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, and Philipp Woelfel</span>
<span class="title">Tight Bounds for Blind Search on the Integers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1348">10.4230/LIPIcs.STACS.2008.1348</a>
</li>
<li>
<span class="authors">Jean-Francois Dufourd</span>
<span class="title">Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1349">10.4230/LIPIcs.STACS.2008.1349</a>
</li>
<li>
<span class="authors">Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff</span>
<span class="title">Trimming of Graphs, with Application to Point Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1350">10.4230/LIPIcs.STACS.2008.1350</a>
</li>
<li>
<span class="authors">Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihal'ák, and Rajeev Raman</span>
<span class="title">Computing Minimum Spanning Trees with Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1358">10.4230/LIPIcs.STACS.2008.1358</a>
</li>
<li>
<span class="authors">Javier Esparza, Stefan Kiefer, and Michael Luttenberger</span>
<span class="title">Convergence Thresholds of Newton's Method for Monotone Polynomial Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1351">10.4230/LIPIcs.STACS.2008.1351</a>
</li>
<li>
<span class="authors">Diana Fischer, Erich Grädel, and Lukasz Kaiser</span>
<span class="title">Model Checking Games for the Quantitative µ-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1352">10.4230/LIPIcs.STACS.2008.1352</a>
</li>
<li>
<span class="authors">Tobias Ganzow and Sasha Rubin</span>
<span class="title">Order-Invariant MSO is Stronger than Counting MSO in the Finite</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1353">10.4230/LIPIcs.STACS.2008.1353</a>
</li>
<li>
<span class="authors">Wouter Gelade and Frank Neven</span>
<span class="title">Succinctness of the Complement and Intersection of Regular Expressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1354">10.4230/LIPIcs.STACS.2008.1354</a>
</li>
<li>
<span class="authors">Christian Glasser, Heinz Schmitz, and Victor Selivanov</span>
<span class="title">Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1355">10.4230/LIPIcs.STACS.2008.1355</a>
</li>
<li>
<span class="authors">Edith Hemaspaandra and Henning Schnoor</span>
<span class="title">On the Complexity of Elementary Modal Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1356">10.4230/LIPIcs.STACS.2008.1356</a>
</li>
<li>
<span class="authors">Viet Tung Hoang and Wing-Kin Sung</span>
<span class="title">Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1357">10.4230/LIPIcs.STACS.2008.1357</a>
</li>
<li>
<span class="authors">Alexander Okhotin and Artur Jez</span>
<span class="title">Complexity of solutions of equations over sets of natural numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1319">10.4230/LIPIcs.STACS.2008.1319</a>
</li>
<li>
<span class="authors">Lukasz Kaiser, Sasha Rubin, and Vince Bárány</span>
<span class="title">Cardinality and counting quantifiers on omega-automatic structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1360">10.4230/LIPIcs.STACS.2008.1360</a>
</li>
<li>
<span class="authors">Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, and Marcus Schaefer</span>
<span class="title">On the Induced Matching Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1361">10.4230/LIPIcs.STACS.2008.1361</a>
</li>
<li>
<span class="authors">Ljubomir Perkovic and Iyad A. Kanj</span>
<span class="title">On Geometric Spanners of Euclidean and Unit Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1320">10.4230/LIPIcs.STACS.2008.1320</a>
</li>
<li>
<span class="authors">Jui-Yi Kao, Jeffrey Shallit, and Zhi Xu</span>
<span class="title">The Frobenius Problem in a Free Monoid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1362">10.4230/LIPIcs.STACS.2008.1362</a>
</li>
<li>
<span class="authors">Jeff Kinne and Dieter van Melkebeek</span>
<span class="title">Space Hierarchy Results for Randomized Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1363">10.4230/LIPIcs.STACS.2008.1363</a>
</li>
<li>
<span class="authors">Felix Klaedtke</span>
<span class="title">Ehrenfeucht-Fraissé Goes Automatic for Real Addition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1364">10.4230/LIPIcs.STACS.2008.1364</a>
</li>
<li>
<span class="authors">Arist Kojevnikov and Sergey I. Nikolenko</span>
<span class="title">New Combinatorial Complete One-Way Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1365">10.4230/LIPIcs.STACS.2008.1365</a>
</li>
<li>
<span class="authors">Dietrich Kuske</span>
<span class="title">Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1366">10.4230/LIPIcs.STACS.2008.1366</a>
</li>
<li>
<span class="authors">Sören Lauen</span>
<span class="title">Geometric Set Cover and Hitting Sets for Polytopes in R³</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1367">10.4230/LIPIcs.STACS.2008.1367</a>
</li>
<li>
<span class="authors">Angsheng Li and Mingji Xia</span>
<span class="title">A Theory for Valiant's Matchcircuits (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1368">10.4230/LIPIcs.STACS.2008.1368</a>
</li>
<li>
<span class="authors">Zvi Lotker, Boaz Patt-Shamir, and Dror Rawitz</span>
<span class="title">Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1331">10.4230/LIPIcs.STACS.2008.1331</a>
</li>
<li>
<span class="authors">Shachar Lovett</span>
<span class="title">Lower bounds for adaptive linearity tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1313">10.4230/LIPIcs.STACS.2008.1313</a>
</li>
<li>
<span class="authors">Julián Mestre</span>
<span class="title">Lagrangian Relaxation and Partial Cover (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1315">10.4230/LIPIcs.STACS.2008.1315</a>
</li>
<li>
<span class="authors">Pinyan Lu and Changyuan Yu</span>
<span class="title">An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1314">10.4230/LIPIcs.STACS.2008.1314</a>
</li>
<li>
<span class="authors">Ulrich Meyer</span>
<span class="title">On Dynamic Breadth-First Search in External-Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1316">10.4230/LIPIcs.STACS.2008.1316</a>
</li>
<li>
<span class="authors">Marni Mishna and Mike Zabrocki</span>
<span class="title">Analytic aspects of the shuffle product</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1317">10.4230/LIPIcs.STACS.2008.1317</a>
</li>
<li>
<span class="authors">Filip Murlak</span>
<span class="title">Weak index versus Borel rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1318">10.4230/LIPIcs.STACS.2008.1318</a>
</li>
<li>
<span class="authors">Jean-Eric Pin and Pedro V. Silva</span>
<span class="title">A Mahler's theorem for functions from words to integers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1321">10.4230/LIPIcs.STACS.2008.1321</a>
</li>
<li>
<span class="authors">Bill Rosgen</span>
<span class="title">Distinguishing Short Quantum Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1322">10.4230/LIPIcs.STACS.2008.1322</a>
</li>
<li>
<span class="authors">Chandan Saha</span>
<span class="title">Factoring Polynomials over Finite Fields using Balance Test</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1323">10.4230/LIPIcs.STACS.2008.1323</a>
</li>
<li>
<span class="authors">Jacques Sakarovitch and Rodrigo de Souza</span>
<span class="title">On the decomposition of k-valued rational relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1324">10.4230/LIPIcs.STACS.2008.1324</a>
</li>
<li>
<span class="authors">Thomas Thierauf and Fabian Wagner</span>
<span class="title">The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1327">10.4230/LIPIcs.STACS.2008.1327</a>
</li>
<li>
<span class="authors">Antti Valmari and Petri Lehtinen</span>
<span class="title">Efficient Minimization of DFAs with Partial Transition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1328">10.4230/LIPIcs.STACS.2008.1328</a>
</li>
<li>
<span class="authors">Johan M. M. van Rooij and Hans L. Bodlaender</span>
<span class="title">Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1329">10.4230/LIPIcs.STACS.2008.1329</a>
</li>
<li>
<span class="authors">Mariano Zelke</span>
<span class="title">Weighted Matching in the Semi-Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2008.1312">10.4230/LIPIcs.STACS.2008.1312</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