STACS 2027 consists of two tracks. Track A focuses on algorithms, data structures and complexity. Track B focuses on automata, logic, semantics, and theory of programming.

Track A: Algorithm Design, Data Structures, and Complexity

Approximation algorithms
Online algorithms
Distributed/parallel algorithms
Parameterized algorithms
Randomized algorithms
Analysis of algorithms
Combinatorics of data structures
Computational geometry
Cryptography
Algorithms for machine learning
Algorithmic game theory
Quantum algorithms
Computational and structural complexity theory
Parameterized complexity
Randomness in computation



Track B: Automata, Logic, Semantics and Theory of Programming

Automata theory
Games and multi-agent systems
Algebraic and categorical methods
Models of computation
Concurrency
Timed systems
Finite model theory
Database theory
Semantics
Type systems
Program analysis
Specification and verification
Rewriting and deduction
Learning theory
Logical aspects of computability and complexity