Papers presenting original research on all aspects of theoretical computer science are sought. Typical, but not exclusive, topics of interest are:

    Track A
    Algorithms, Complexity and Games

        Algorithmic and Complexity Aspects of Network Economics
        Algorithmic Aspects of Biological and Physical Systems
        Algorithmic Aspects of Networks and Networking
        Algorithmic Aspects of Security and Privacy
        Algorithmic Game Theory and Mechanism Design
        Approximation and Online Algorithms
        Combinatorial Optimization
        Combinatorics in Computer Science
        Computational Complexity
        Computational Geometry
        Computational Learning Theory
        Cryptography
        Data Structures
        Design and Analysis of Algorithms
        Distributed and Mobile Computing
        Foundations of Machine Learning
        Graph Mining and Network Analysis
        Parallel and External Memory Computing
        Parameterized Complexity
        Quantum Computing
        Randomness in Computation
        Sublinear Time and Streaming Algorithms
        Theoretical Foundations of Algorithmic Fairness 

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

        Algebraic and Categorical Models of Computation
        Automata, Logic, and Games
        Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
        Formal and Logical Aspects of Learning
        Formal and Logical Aspects of Security and Privacy
        Logic in Computer Science and Theorem Proving
        Models of Computation: Complexity and Computability
        Models of Concurrent, Distributed, and Mobile Systems
        Models of Reactive, Hybrid, and Stochastic Systems
        Principles and Semantics of Programming Languages
        Program Analysis, Verification, and Synthesis
        Type Systems and Typed Calculi