25th International Symposium on Fundamentals of Computation Theory
(FCT 2025)
Home
FCT, the International Symposium on Fundamentals of Computation Theory, was established in 1977 as a forum for researchers interested in all aspects of theoretical computer science; it is a biennial series of conferences.
The 25th International Symposium on Fundamentals of Computation Theory, FCT 2025 will be held on September 15th-17th, at the Institute of Computer Science, University of Wrocław, Poland.
Paper Submission
Papers are to be submitted electronically through EquinOCS submission server.
The submissions should be at most 12 pages long, including the references and excluding a clearly marked appendix. Submission should use the LNCS style.
No prior publication nor simultaneous submission to other conferences nor journals are allowed.
More details about the submission can be found here.
Important dates
May 6th, 2025 (AoE): Paper submission deadline
June 30th, 2025: Author notifications
July 4th, 2025 (AoE): Final papers due
September 15th-17th, 2025: FCT conference dates
Program Committee
Alexander Belov (University of Latvia)
Kristóf Bérczi (Eötvös Loránd University)
Johanna Björklund (Umeå University)
Hubie Chen (King's College London)
Wojciech Czerwiński (University of Warsaw)
Christoph Dürr (CNRS & Sorbonne University)
Piotr Faliszewski (AGH University)
Maribel Fernández (King's College London)
Gabriele Fici (University of Palermo)
Celina Figueiredo (UFRJ)
Joanna Fijalkow (CNRS & LaBRI)
Moses Ganardi (MPI SWS)
Leszek Gąsieniec (University of Liverpool)
Petr Golovach (University of Bergen)
Meng He (Dalhousie University)
Mika Hirvensalo (University of Turku)
Petr Hliněný (Masaryk University)
Tomohiro I (Kyutech)
Rasmus Ibsen-Jensen (University of Liverpool)
Artur Jeż (University of Wrocław) co-chair
Marek Klonowski (Wrocław University of Science and Technology)
Anish Mukherjee (University of Liverpool)
Jan Otop (University of Wrocław) co-chair
Tatjana Petrov (University of Trieste)
Vladimir Podolskii (Tufts University)
Mahsa Shirmohammadi (CNRS & IRIF)
Oskar Skibski (University of Warsaw)
Krzysztof Sornat (AGH University)
Ugo Vaccaro (UNISA)
Armin Weiß (University of Stuttgart)
Andreas Wiese (TU Munich)
Dominik Wojtczak (University of Liverpool)
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 can be expanded below.
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
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
Partners
