Skip to content

International Symposium on Theoretical Aspects of Computer Science

STACS

A

CORE rank

CORE rank (raw)

A

Fields of research

Theory of Computation

Papers indexed

2,384

1984–2026

Papers per year

198482 peak2026

STACS papers

2,384 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2010Decidability of the Interval Temporal Logic ABB over the Natural Numbers.Angelo Montanari, Gabriele Puppis, Pietro Sala, Guido Sciavicco
2010The Recognition of Tolerance and Bounded Tolerance Graphs.George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010Online Correlation Clustering.Claire Mathieu, Ocan Sankur, Warren Schudy
2010Treewidth Reduction for Constrained Separation and Bipartization Problems.Dniel Marx, Barry O'Sullivan, Igor Razgon
2010Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science.Jean-Yves Marion, Thomas Schwentick
2010Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science.Jean-Yves Marion, Thomas Schwentick
2010Is Ramsey's Theorem omega-automatic?.Dietrich Kuske
2010Holant Problems for Regular Graphs with Complex Edge Functions.Michael Kowalczyk, Jin-yi Cai
2010Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs.Neelesh Khanna, Surender Baswana
2010Collapsible Pushdown Graphs of Level 2 are Tree-Automatic.Alexander Kartzow
2010On Equations over Sets of Integers.Artur Jez, Alexander Okhotin
2010Randomized Algorithm for Agreeable Deadlines Packet Scheduling.Lukasz Jez
2010Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion.Maurice J. Jansen
2010On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity.Edward A. Hirsch, Dmitry Itsykson
2010Revisiting the Rice Theorem of Cellular Automata.Pierre Guillon, Gatan Richard
2010Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses.Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
2010Evolving Multialgebras Unify All Usual Sequential Computation Models.Serge Grigorieff, Pierre Valarcher
2010Branching-time Model Checking of One-counter Processes.Stefan Gller, Markus Lohrey
2010An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem.Franois Le Gall
2010Inseparability and Strong Hypotheses for Disjoint NP Pairs.Lance Fortnow, Jack H. Lutz, Elvira Mayordomo
2010Finding Induced Subgraphs via Minimal Triangulations.Fedor V. Fomin, Yngve Villanger
2010The k-in-a-path Problem for Claw-free Graphs.Jir Fiala, Marcin Kaminski, Bernard Lidick, Danil Paulusma
2010Computing Least Fixed Points of Probabilistic Systems of Polynomials.Javier Esparza, Andreas Gaiser, Stefan Kiefer
2010Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.Leah Epstein, Asaf Levin, Julin Mestre, Danny Segev
2010The Complexity of the List Homomorphism Problem for Graphs.Lszl Egri, Andrei A. Krokhin, Benot Larose, Pascal Tesson
1,0011,025 of 2,384← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.