The 42nd International Symposium on Theoretical Aspects of Computer Science is planned to take place from March 04 to March 07, 2025 in Jena, Germany.

STACS 2025 will consist of two tracks. Track A focuses on algorithms, data structures and complexity. Track B focuses on automata, logic, semantics, and theory of programming. Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include:

Track A. Algorithms, Data Structures and Complexity

    Design of parallel algorithms
    Distributed algorithm
    Approximation algorithms
    Parameterised algorithms
    Randomised 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
    Parameterised 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

These lists are not exhaustive. In particular, both tracks also welcome submissions about current challenges.