4 - 7 March 2025, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS'25), Jena, Germany
STACS 2025 will consist of two tracks, A and B. Track A focuses on algorithms, data structures and complexity, while track B focuses on automata, logic, semantics, and theory of programming.
The conference includes talks by invited speakers Daniel Dadush (CWI Amsterdam), Anupam Das (University of Birmingham) and Susanna F. de Rezende (Lund University), and a tutorial by Albert Atserias (UPC Barcelona) on "Proof complexity and its relations to SAT solving".
Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science.
Submissions should be made through EasyChair. Authors are invited to submit an extended abstract or a full paper with at most 15 pages; this page limit excludes the title page, the references sect ion, and a possible appendix. In preparation of submissions, the usage of the LIPIcs style file is mandatory; no changes to font size, page geometry, etc. are permitted. Submissions should be made to appropriate tracks. Simultaneous submission to other conferences with published proceedings or to journals is not allowed.