STACS A

60 papers

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