STACS 2025: Call for Papers

The 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025) is planned to take place from March 4th to March 7th, 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.

Submission Topics

Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Topics include, but are not limited to:

Track A. Algorithms, Data Structures and Complexity

• Design of parallel algorithms
• Distributed algorithms
• Approximation 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
• 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

Important Dates

All times are Anywhere on Earth (AoE, UTC-12).

• Submission deadline: September 26, 2024
• Feedback to authors: November 15, 2024
• Rebuttal: November 21, 2024
• Author Notification: December 16, 2024
• Camera-ready version: mid-January 2025
• Pre-conference workshop: March 03-04, 2025
• Conference: March 04-07, 2025

Submissions

Format of Submissions

• Submissions should be made through EasyChair: https://easychair.org/conferences/?conf=stacs2025
• Authors are invited to submit an extended abstract or a full paper with at most 15 pages (excluding title page, references, and appendix).
• The title page should contain the title and abstract only; no author information.
• The LIPIcs style file is mandatory; no changes to font size or page geometry are permitted. Refer to LIPIcs author instructions.
• Submissions after the deadline or not adhering to the format risk rejection.
• Submissions should be made to appropriate tracks; PCs reserve the right to reassign papers.
• Extended abstracts should include a succinct statement of issues, motivation, summary of main results, and significance explanation.
• Simultaneous submission to other conferences with published proceedings or journals is not allowed.

Double-blind Reviewing

STACS 2025 employs a lightweight double-blind reviewing process: submissions should not reveal author identity. Essential references should not be omitted or anonymized. Authors may disseminate drafts of their papers (e.g., on the web, arXiv, talks).

Conflicts of Interest

Authors will be invited to list persons with a Conflict of Interest (COI) based on specific categories (family, mentor/mentee, affiliation, etc.). Authors can contact PC chairs for clarification or unlisted conflicts.

Rebuttal

There will be a rebuttal period for authors to respond to reviews.

Conference

At least one author of each accepted paper is expected to register. Remote presentation options will be offered.

Proceedings

Accepted papers will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series, ensuring perennial, free electronic access. Authors retain rights. The final camera-ready version should follow LIPIcs guidelines, with a limit of 18 pages (excluding bibliography and front pages). Appendices from the initial submission should not be included unless suggested by reviewers. Proceedings papers can link to full versions published elsewhere.

Code of Conduct

STACS is committed to a respectful forum, free from violence, discrimination, or harassment. Attendees must agree to the Code of Conduct. Reporting mechanisms are available through SafeToC advocates and conference chairs.