<!DOCTYPE html>
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
FCT 2025 2nd Call for Papers<br>
<br>
==============================<br>
<br>
OVERVIEW<br>
<br>
The International Symposium on Fundamentals of Computation Theory
(FCT), has been established in 1977 as a forum for researchers
interested in all aspects of theoretical computer science. It is a
biennial series of conferences, recently held in Copenhagen
(Denmark, 2019) Athens, (Greece, 2021) and Trier (Germany, 2023).<br>
<br>
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.<br>
<br>
<a class="moz-txt-link-freetext"
href="https://fct2025.cs.uni.wroc.pl" moz-do-not-send="true">https://fct2025.cs.uni.wroc.pl</a><br>
<br>
<a class="moz-txt-link-abbreviated moz-txt-link-freetext"
href="mailto:fct2025@cs.uni.wroc.pl" moz-do-not-send="true">fct2025@cs.uni.wroc.pl</a><br>
<br>
==============================<br>
<br>
IMPORTANT DATES<br>
<br>
* May 6th, 2025: Paper submission deadline<br>
* June 30th, 2025: Author notifications<br>
* July 4th, 2025: Final papers due<br>
* September 15th-17th, 2025: FCT conference dates<br>
<br>
==============================<br>
<br>
VENUE<br>
<br>
* University of Wrocław, Institute of Computer Science, Poland<br>
<br>
==============================<br>
<br>
SUBMISSIONS<br>
<br>
We invite submissions on all topics in broadly understood
theoretical computer science.<br>
<br>
<p>Papers are to be submitted electronically through EquinOCS
submission server operated by Springer, the publisher of the
proceedings.<br>
Submission page: <a
href="https://equinocs.springernature.com/service/fct2025"
class="moz-txt-link-freetext" moz-do-not-send="true">https://equinocs.springernature.com/service/fct2025</a><br>
</p>
The accepted papers will be published in ARCoSS subseries of Lecture
Notes in Computer Science (LNCS) series.<br>
<br>
The submissions should be at most 12 pages long, including the
references and excluding a clearly marked appendix,<br>
which can be read by the reviewers and can be consulted by the
program committee.<br>
<br>
Submissions should use the LNCS style (<a
href="https://resource-cms.springernature.com/springer-cms/rest/v1/content/19238648/data/v8"
moz-do-not-send="true">LaTeX</a>, <a
href="https://resource-cms.springernature.com/springer-cms/rest/v1/content/19238706/data/v5"
moz-do-not-send="true">Word</a>).<br>
<br>
No prior publication or simultaneous submission to other conferences
nor journals are allowed;<br>
this does not include publication in preprint repositories, e.g.
arXiv, or venues without published proceedings.<br>
<br>
A Best Paper and Best Student Paper will be awarded.<br>
To qualify for considerations for Best Student Paper, all authors
must be students at the moment of submission.<br>
<br>
At least one author of accepted paper should register and present
the paper in person during the conference.<br>
<br>
Submissions of papers authored (or co-authored) by PC members are
allowed.<br>
<br>
FCT 2025 will use a single-blind reviewing process.<br>
<br>
==============================<br>
<br>
LIST OF TOPICS:<br>
(Not Exclusive)<br>
<br>
* Algorithmic Game Theory<br>
* Algorithmic Learning Theory<br>
* Algorithmic Randomness<br>
* Algorithms and Data Structures<br>
* Algorithms for Big Data<br>
* Approximation Algorithms<br>
* Automata Theory<br>
* Average-Case Analysis<br>
* Combinatorics and Graph Theory<br>
* Combinatorial Generation, Enumeration and Counting<br>
* Combinatorial Optimization<br>
* Combinatorics on Words<br>
* Complexity Theory<br>
* Computational Biology<br>
* Computational Geometry<br>
* Computational Learning Theory<br>
* Computational Social Choice<br>
* Computability, Recursion Theory<br>
* Concurrency<br>
* Data Compression<br>
* Database Theory<br>
* Descriptional Complexity<br>
* Discrete Event Systems<br>
* Discrete Optimization<br>
* Distributed, Parallel and Network Algorithms<br>
* Energy-Aware Algorithms<br>
* Error-Correcting Codes<br>
* Fine-grained Complexity<br>
* Formal Languages<br>
* Formal Specification and Verification<br>
* Foundations of Artificial Intelligence and Machine Learning<br>
* Graph Algorithms and Modelling with Graphs<br>
* Graph Drawing and Graph Labeling<br>
* Grammatical Inference<br>
* Integer and Linear Programming<br>
* Logic in Computer Science<br>
* Model-Checking<br>
* Models of Computation<br>
* Network Theory and Temporal Graphs<br>
* Online Algorithms<br>
* Parameterized Algorithms and Complexity<br>
* Probabilistic and Randomized Algorithms<br>
* Program Semantics<br>
* Quantum Algorithms<br>
* String Algorithms<br>
* Sublinear Time and Streaming Algorithms<br>
* Telecommunication Algorithms<br>
* Theorem Provers and Automated Reasoning<br>
* Voting Theory<br>
<p>==============================</p>
<p>INVITED SPEAKERS</p>
<p>* Bernhard Haeupler (ETH & INSAIT Sofia University)<br>
* Sławomir Lasota (University of Warsaw)<br>
* Inbal Talgam-Cohen (Technion)<br>
</p>
<p>==============================</p>
<br>
PROGRAM COMMITTEE<br>
<br>
* Alexander Belov (University of Latvia)<br>
* Kristóf Bérczi (Eötvös Loránd University)<br>
* Johanna Björklund (Umeå University)<br>
* Hubie Chen (King's College London)<br>
* Wojciech Czerwiński (University of Warsaw)<br>
* Christoph Dürr (CNRS & Sorbonne University)<br>
* Piotr Faliszewski (AGH University)<br>
* Maribel Fernández (King's College London)<br>
* Gabriele Fici (University of Palermo)<br>
* Celina Figueiredo (UFRJ)<br>
* Joanna Fijalkow (CNRS & LaBRI)<br>
* Moses Ganardi (MPI SWS)<br>
* Leszek Gąsieniec (University of Liverpool)<br>
* Petr Golovach (University of Bergen)<br>
* Meng He (Dalhousie University)<br>
* Mika Hirvensalo (University of Turku)<br>
* Petr Hliněný (Masaryk University)<br>
* Tomohiro I (Kyutech)<br>
* Rasmus Ibsen-Jensen (University of Liverpool)<br>
* Artur Jeż (University of Wrocław) co-chair<br>
* Marek Klonowski (Wrocław University of Science and Technology)<br>
* Anish Mukherjee (University of Liverpool)<br>
* Jan Otop (University of Wrocław) co-chair<br>
* Tatjana Petrov (University of Trieste)<br>
* Vladimir Podolskii (Tufts University)<br>
* Mahsa Shirmohammadi (CNRS & IRIF)<br>
* Oskar Skibski (University of Warsaw)<br>
* Krzysztof Sornat (AGH University)<br>
* Ugo Vaccaro (UNISA)<br>
* Armin Weiß (University of Stuttgart)<br>
* Andreas Wiese (TU Munich)<br>
* Dominik Wojtczak (University of Liverpool)<br>
<br>
We hope to see you all in Wrocław!<br>
<br>
Artur Jeż<br>
Jan Otop<br>
(Institute of Computer Science, University of Wrocław, Poland)<br>
<a class="moz-txt-link-abbreviated moz-txt-link-freetext"
href="mailto:fct2025@cs.uni.wroc.pl" moz-do-not-send="true">fct2025@cs.uni.wroc.pl</a><br>
<br>
<br>
<br>
</body>
</html>