FCT 2025: Call for Papers

The 25th International Symposium on Fundamentals of Computation Theory (FCT 2025) will be held from September 15th-17th, 2025, at the Institute of Computer Science, University of Wrocław, Poland.

FCT is a biennial series of conferences established in 1977, providing a forum for researchers interested in all aspects of theoretical computer science.

Paper Submission

Paper submission is closed. New submissions are no longer possible.

Publication

Accepted papers will be published in the Lecture Notes in Computer Science (LNCS) series, in the ARCoSS subseries. At least one author of an accepted paper should register and present the paper in person during the conference.

Awards

A Best Paper and Best Student Paper will be awarded. To qualify for the Best Student Paper consideration, all authors must be students at the moment of submission.

Important Dates

• Paper submission deadline: May 6th, 2025 (AoE)
• Author notifications: June 30th, 2025
• Final papers due: July 14th, 2025 (changed)
• FCT conference dates: September 15th-17th, 2025

Invited Speakers

• Bernhard Haeupler (ETH & INSAIT Sofia University)
• Sławomir Lasota (University of Warsaw)
• Inbal Talgam-Cohen (Technion)

Topics

Original papers on the fundamentals of computation theory are welcome, including contributions on algorithms, complexity, and formal methods. The topics include, but are not limited to:

• Algorithmic Game Theory
• Algorithmic Learning Theory
• Algorithmic Randomness
• Algorithms and Data Structures
• Algorithms for Big Data
• Approximation Algorithms
• Automata Theory
• Average-Case Analysis
• Combinatorics and Graph Theory
• Combinatorial Generation, Enumeration and Counting
• Combinatorial Optimization
• Combinatorics of Words
• Complexity Theory
• Computational Biology
• Computational Geometry
• Computational Learning Theory
• Computational Social Choice
• Computability, Recursion Theory
• Concurrency
• Data Compression
• Database Theory
• Descriptional Complexity
• Discrete Event Systems
• Discrete Optimization
• Distributed, Parallel and Network Algorithms
• Energy-Aware Algorithms
• Error-Correcting Codes
• Fine-grained Complexity
• Formal Languages
• Formal Specification and Verification
• Foundations of Artificial Intelligence and Machine Learning
• Graph Algorithms and Modelling with Graphs
• Graph Drawing and Graph Labeling
• Grammatical Inference
• Integer and Linear Programming
• Logic in Computer Science
• Model-Checking
• Models of Computation
• Network Theory and Temporal Graphs
• Online Algorithms
• Parameterized Algorithms and Complexity
• Probabilistic and Randomized Algorithms
• Program Semantics
• Quantum Algorithms
• String Algorithms
• Sublinear Time and Streaming Algorithms
• Telecommunication Algorithms
• Theorem Provers and Automated Reasoning
• Voting Theory

Program Committee

Members include Alexander Belov, Kristóf Bérczi, Johanna Björklund, Hubie Chen, Wojciech Czerwiński, Christoph Dürr, Piotr Faliszewski, Maribel Fernández, Gabriele Fici, Celina Figueiredo, Joanna Fijalkow, Moses Ganardi, Leszek Gąsieniec, Petr Golovach, Meng He, Mika Hirvensalo, Petr Hliněný, Tomohiro I, Rasmus Ibsen-Jensen, Artur Jeż (co-chair), Marek Klonowski, Anish Mukherjee, Jan Otop (co-chair), Tatjana Petrov, Vladimir Podolskii, Mahsa Shirmohammadi, Oskar Skibski, Krzysztof Sornat, Ugo Vaccaro, Armin Weiß, Andreas Wiese, and Dominik Wojtczak.

Contact

For inquiries, please email: fct2025@cs.uni.wroc.pl