LIPIcs, Volume 1, STACS 2008

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