FCT 2027 – Call for Papers

26th International Symposium on Fundamentals of Computation Theory (FCT 2027)

September 22–24, 2027 | Craiova, Romania

About FCT

The International Symposium on Fundamentals of Computation Theory (FCT) was established in 1977 as a forum for researchers interested in all aspects of theoretical computer science. FCT is a biennial conference series that brings together researchers from around the world to present and discuss recent advances in the foundations of computation.

The 26th International Symposium on Fundamentals of Computation Theory (FCT 2027) will take place in Craiova, Romania, on September 22–24, 2027.

FCT 2027 aims to provide a forum for the exchange of ideas and results across a broad range of topics in theoretical computer science, fostering interaction between different research areas and encouraging new directions in the field.

Call for Papers

We invite submissions of original research papers on all aspects of theoretical computer science, including theoretical contributions to algorithms, complexity, combinatorics, logic, formal methods, and models of computation.

We particularly welcome papers presenting novel theoretical results, new algorithmic techniques, advances in computational complexity, and rigorous mathematical foundations of computing. Theoretical contributions motivated by applications in areas such as artificial intelligence, machine learning, networks, distributed computing, and computational biology are also encouraged.

Topics of Interest

Topics of interest 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 on Words
• Complexity Theory
• Computational Biology
• Computational Geometry
• Computational Learning Theory
• Computational Social Choice
• Computability and 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

The list above is not exhaustive. Submissions addressing other topics within the broad scope of theoretical computer science are equally welcome.

---

See also: Submission Guidelines · Important Dates · Proceedings · Awards