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
2005Centrality Measures Based on Current Flow.Ulrik Brandes, Daniel Fleischer
2005Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages.Mireille Bousquet-Mlou
2005Approximate Range Mode and Range Median Queries.Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
2005The Core of a Countably Categorical Structure.Manuel Bodirsky
2005On Nash Equilibria in Non-cooperative All-Optical Networks.Vittorio Bil, Michele Flammini, Luca Moscardelli
2005Improved Algorithms for Dynamic Page Migration.Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzeniowski
2005The Variable Hierarchy of the -Calculus Is Strict.Dietmar Berwanger, Giacomo Lenzi
2005On Weighted Balls-into-Bins Games.Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell A. Martin
2005Regular Tree Languages Definable in FO.Michael Benedikt, Luc Segoufin
2005All-Pairs Nearly 2-Approximate Shortest-Paths in O(nSurender Baswana, Vishrut Goyal, Sandeep Sen
2005Speed Scaling to Manage Temperature.Nikhil Bansal, Kirk Pruhs
2005The Complexity of Solving Linear Equations over a Finite Ring.Vikraman Arvind, T. C. Vijayaraghavan
2005Truthful Approximation Mechanisms for Scheduling Selfish Related Machines.Nir Andelman, Yossi Azar, Motti Sorani
2005Information Theory in Property Testing and Monotonicity Testing in Higher Dimension.Nir Ailon, Bernard Chazelle
2005Automorphisms of Finite Rings and Applications to Complexity of Problems.Manindra Agrawal, Nitin Saxena
2004On Visibility Representation of Plane Graphs.Huaming Zhang, Xin He
2004Lattices with Many Cycles Are Dense.Mrten Trolin
2004Solving the 2-Disjoint Paths Problem in Nearly Linear Time.Torsten Tholey
2004A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.Till Tantau
2004The Expected Competitive Ratio for Weighted Completion Time Scheduling.Alexander Souza, Angelika Steger
2004The Complexity of Satisfiability Problems over Finite Lattices.Bernhard Schwarz
2004Topology Matters: Smoothed Competitiveness of Metrical Task Systems.Guido Schfer, Naveen Sivadasan
2004A Discontinuity in Pattern Inference.Daniel Reidenbach
2004Worst Case Performance of an Approximation Algorithm for Asymmetric TSP.Anna Palbom
2004Active Context-Free Games.Anca Muscholl, Thomas Schwentick, Luc Segoufin
1,3261,350 of 2,384← PreviousNext →

Comparable venues

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