of Computer Science
February 9–13, 2026, Kraków, Poland
Poster Deadline: December 1, 2025 AoE
Poster Notification: December 8, 2025
Poster Camery-Ready: December 15, 2025
If you have some late-breaking or preliminary results, or want to give
your Ph.D. students a first chance to participate in a conference,
consider submitting (via Easychair) a 2-page abstract (LNCS style,
including references). Additionally, you can (but you don't have to)
upload a draft of the poster itself, in order to get feedback from
members of the program committee.
Poster abstracts will appear in the conference proceedings (LNCS) but
will not be considered properly reviewed publications, so full papers
can later be submitted to other conferences.
Posters must be presented in the poster session of the conference.
Early registration fees will be ~500 EUR (full) and ~400 EUR (student),
including lunches. Affordable accommodation (~55 EUR single, ~66 EUR
double room per night) in the immediate vicinity of the conference
location is available.
Submission page: https://easychair.org/conferences/?conf=sofsem2026
--
Invited Speakers
* Jarosław Błasiok, ETH Zurich, CH
* Jarosław Byrka, University of Wrocław, PL
* Sandra Kiefer, University of Oxford, UK
* Linda Kleist, Potsdam University, DE
* Jukka Suomela, Aalto University, FI
* Philip Wadler, University of Edinburgh, UK
Tradition
SOFSEM is an annual winter conference devoted to the theory and
practice of computer science. The conference traditionally focuses on
the latest results and developments of fundamental research in
computer science (informatics), inspired by the algorithmic challenges
of our time. SOFSEM has a long tradition as a high-quality research
conference, and a venue where researchers from academia and industry
in all stages of their career can share their insights.
Topics
The program committee encourages submission of original research
papers in all areas of foundations of computer science and artificial
intelligence, including e.g.
– algorithm engineering,
– algorithms and data structures,
– theory of machine learning and data science,
– automata, languages, rewriting systems,
– combinatorial optimization,
– combinatorics on words,
– computability, decidability, models of computation,
– computational complexity,
– computational geometry,
– cryptography and security,
– logic in computer science,
– games and online algorithms,
– graph drawing,
– graph algorithms,
– mathematical programming,
– network science,
– parallel and distributed computing,
– parameterized complexity,
– probabilistic and analytic methods in computer science,
– quantum computing,
– robotics,
and other relevant theory topics in computing and AI.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
