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
2014Online Bin Packing with Advice.Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro Lpez-Ortiz
2014New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle
2014Palindrome Recognition In The Streaming Model.Petra Berenbrink, Funda Ergn, Frederik Mallmann-Trenn, Erfan Sadeqi Azer
2014Two-Page Book Embeddings of 4-Planar Graphs.Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou
2014Asymmetry of the Kolmogorov complexity of online predicting odd and even bits.Bruno Bauwens
2014Complexity classes on spatially periodic Cellular Automata.Nicolas Bacquey
2014Shapley meets Shapley.Haris Aziz, Bart de Keijzer
2014Generalized Reordering Buffer Management.Yossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron
2014Weighted Coloring in Trees.Jlio Arajo, Nicolas Nisse, Stphane Prennes
2014Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato
2014Throughput Maximization in the Speed-Scaling Setting.Eric Angel, Evripidis Bampis, Vincent Chau
2014On Symmetric Circuits and Fixed-Point Logics.Matthew Anderson, Anuj Dawar
2014Submodular Stochastic Probing on Matroids.Marek Adamczyk, Maxim Sviridenko, Justin Ward
2014Counting Homomorphisms to Cactus Graphs Modulo 2.Andreas Gbel, Leslie Ann Goldberg, David Richerby
2013Advice Lower Bounds for the Dense Model Theorem.Thomas Watson
2013Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem.Magnus Wahlstrm
2013FO^2 with one transitive relation is decidable.Wieslaw Szwast, Lidia Tendera
2013Author Index.Natacha Portier, Thomas Wilke
2013Frontmatter, Table of Contents, Preface, Workshop Organization.Natacha Portier, Thomas Wilke
2013Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2013Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings.Michal Pilipczuk
2013Model Counting for CNF Formulas of Bounded Modular Treewidth.Danil Paulusma, Friedrich Slivovsky, Stefan Szeider
2013Popular Matchings: Structure and Cheating Strategies.Meghana Nasre
2013Physarum Computations (Invited talk).Kurt Mehlhorn
2013Algorithmic Graph Structure Theory (Tutorial).Dniel Marx
801825 of 2,384← PreviousNext →

Comparable venues

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