LIPIcs, Volume 5, STACS 2010

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