Abstract is missing.
- Table of Contents - 27th International Symposium on Theoretical Aspects of Computer ScienceJean-Yves Marion, Thomas Schwentick. 7-10 [doi]
- Beyond omega-Regular LanguagesMikolaj Bojanczyk. 11-16 [doi]
- Reflections on Multivariate Algorithmics and Problem ParameterizationRolf Niedermeier. 17-32 [doi]
- Mathematics, Cryptology, SecurityJacques Stern. 33-34 [doi]
- Large-Girth Roots of GraphsAnna Adamaszek, Michal Adamaszek. 35-46 [doi]
- The Tropical Double Description MethodXavier Allamigeon, Stephane Gaubert, Eric Goubault. 47-58 [doi]
- The Remote Point Problem, Small Bias Spaces, and Expanding Generator SetsVikraman Arvind, Srikanth Srinivasan. 59-70 [doi]
- Evasiveness and the Distribution of Prime NumbersLászló Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik. 71-82 [doi]
- Dynamic Sharing of a Multiple Access ChannelMarcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski. 83-94 [doi]
- Exact Covers via DeterminantsAndreas Björklund. 95-106 [doi]
- On Iterated Dominance, Matrix Elimination, and Matched PathsFelix Brandt, Markus Holzer, Felix A. Fischer. 107-118 [doi]
- AMS Without 4-Wise Independence on Product DomainsVladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky. 119-130 [doi]
- Quantum Algorithms for Testing Properties of DistributionsSergey Bravyi, Aram Wettroth Harrow, Avinatan Hassidim. 131-142 [doi]
- Optimal Query Complexity for Reconstructing HypergraphsNader H. Bshouty, Hanna Mazzawi. 143-154 [doi]
- Ultimate Traces of Cellular AutomataJulien Cervelle, Enrico Formenti, Pierre Guillon. 155-166 [doi]
- Two-phase Algorithms for the Parametric Shortest Path ProblemSourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster. 167-178 [doi]
- Continuous Monitoring of Distributed Data Streams over a Time-based Sliding WindowHo-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting. 179-190 [doi]
- Robust Fault Tolerant Uncapacitated Facility LocationShiri Chechik, David Peleg. 191-202 [doi]
- Efficient and Error-Correcting Data Structures for Membership and Polynomial EvaluationVictor Chen, Elena Grigorescu, Ronald de Wolf. 203-214 [doi]
- Log-space Algorithms for Paths and Matchings in k-treesBireswar Das, Samir Datta, Prajakta Nimbhorkar. 215-226 [doi]
- Restricted Space Algorithms for Isomorphism on Bounded Treewidth GraphsBireswar Das, Jacobo Torán, Fabian Wagner. 227-238 [doi]
- The Traveling Salesman Problem under Squared Euclidean DistancesFred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg. 239-250 [doi]
- Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed GraphsFrederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh. 251-262 [doi]
- Planar Subgraph Isomorphism RevisitedFrederic Dorn. 263-274 [doi]
- Intrinsic Universality in Self-AssemblyDavid Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods. 275-286 [doi]
- Sponsored Search, Market Equilibria, and the Hungarian MethodPaul Dütting, Monika Henzinger, Ingmar Weber. 287-298 [doi]
- Dispersion in Unit DisksAdrian Dumitrescu, Minghui Jiang. 299-310 [doi]
- Long Non-crossing Configurations in the PlaneAdrian Dumitrescu, Csaba D. Tóth. 311-322 [doi]
- The Complexity of Approximating Bounded-Degree Boolean #CSPMartin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby. 323-334 [doi]
- The Complexity of the List Homomorphism Problem for GraphsLászló Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson. 335-346 [doi]
- Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming ModelLeah Epstein, Asaf Levin, Julián Mestre, Danny Segev. 347-358 [doi]
- Computing Least Fixed Points of Probabilistic Systems of PolynomialsJavier Esparza, Andreas Gaiser, Stefan Kiefer. 359-370 [doi]
- The k-in-a-path Problem for Claw-free GraphsJirà Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma. 371-382 [doi]
- Finding Induced Subgraphs via Minimal TriangulationsFedor V. Fomin, Yngve Villanger. 383-394 [doi]
- Inseparability and Strong Hypotheses for Disjoint NP PairsLance Fortnow, Jack H. Lutz, Elvira Mayordomo. 395-404 [doi]
- Branching-time Model Checking of One-counter ProcessesStefan Göller, Markus Lohrey. 405-416 [doi]
- Evolving Multialgebras Unify All Usual Sequential Computation ModelsSerge Grigorieff, Pierre Valarcher. 417-428 [doi]
- Collapsing and Separating Completeness Notions under Average-Case and Worst-Case HypothesesXiaoyang Gu, John M. Hitchcock, Aduri Pavan. 429-440 [doi]
- Revisiting the Rice Theorem of Cellular AutomataPierre Guillon, Gaétan Richard. 441-452 [doi]
- On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof ComplexityEdward A. Hirsch, Dmitry Itsykson. 453-464 [doi]
- Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix CompletionMaurice Jansen. 465-476 [doi]
- On Equations over Sets of IntegersArtur Jez, Alexander Okhotin. 477-488 [doi]
- Collapsible Pushdown Graphs of Level 2 are Tree-AutomaticAlexander Kartzow. 501-512 [doi]
- Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted GraphsNeelesh Khanna, Surender Baswana. 513-524 [doi]
- Holant Problems for Regular Graphs with Complex Edge FunctionsMichael Kowalczyk, Jin-yi Cai. 525-536 [doi]
- Is Ramsey s Theorem omega-automatic?Dietrich Kuske. 537-548 [doi]
- An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism ProblemFrançois Le Gall. 549-560 [doi]
- Treewidth Reduction for Constrained Separation and Bipartization ProblemsDániel Marx, Barry O Sullivan, Igor Razgon. 561-572 [doi]
- Online Correlation ClusteringClaire Mathieu, Ocan Sankur, Warren Schudy. 573-584 [doi]
- The Recognition of Tolerance and Bounded Tolerance GraphsGeorge B. Mertzios, Ignasi Sau, Shmuel Zaks. 585-596 [doi]
- Decidability of the Interval Temporal Logic ABB over the Natural NumbersAngelo Montanari, Pietro Sala, Guido Sciavicco. 597-608 [doi]
- Relaxed Spanners for Directed Disk GraphsDavid Peleg, Liam Roditty. 609-620 [doi]
- Unsatisfiable Linear CNF Formulas Are Large and ComplexDominik Scheder. 621-632 [doi]
- Construction Sequences and Certifying 3-ConnectednessJens M. Schmidt. 633-644 [doi]
- Named Models in Coalgebraic Hybrid LogicLutz Schröder, Dirk Pattinson. 645-656 [doi]
- A Dichotomy Theorem for the General Minimum Cost Homomorphism ProblemRustem Takhanov. 657-668 [doi]
- Alternation-Trading Proofs, Linear Programming, and Lower BoundsRyan Williams. 669-680 [doi]