FCT 2025: Call for Papers

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

FCT is a biennial conference established in 1977, serving as a forum for researchers interested in all aspects of theoretical computer science.

Invited Speakers

• Bernhard Haeupler (ETH & INSAIT Sofia University) - Graph Decompositions and Length-Constrained Expanders
• Sławomir Lasota (University of Warsaw) - Reachability in extensions of Petri net
• Inbal Talgam-Cohen (Technion) - Algorithmic Contract Design: Recent Progress

Topics

We welcome original papers on the fundamentals of computation theory including contributions on algorithms, complexity and formal methods.

The (not exclusive) list of topics includes:

• 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

Important Dates

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

Steering Committee

• Bogdan Chlebus, University of Colorado, US
• Marek Karpiński (chair), University of Bonn, Germany
• Andrzej Lingas, Lund University, Sweden
• Miklos Santha, CNRS and University Paris Diderot, France
• Eli Upfal, Brown University, US

Local Organizers

• Artur Jeż
• Jan Otop

Contact

fct2025@cs.uni.wroc.pl