<html><body><div style="font-family: arial, helvetica, sans-serif; font-size: 12pt; color: #000000"><div>49th International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2024 in Cochem, Germany: February 19-23, 2024, organized by the University of Trier.<br><br>Homepage: https://www.uni-trier.de/index.php?id=90670&L=2<br><br>SOFSEM has a special focus on Foundations of Computer Science and AI, in particular algorithms, AI-based methods, computational complexity, and formal models. For more information about SOFSEM, we refer to http://www.sofsem.cz/.<br><br>==================================================<br>Important Dates<br><br> * August 28th, 2023: abstract deadline (firm)<br> * September 1st, 2023: full paper deadline (firm)<br> * mid-November, 2023: author notification<br><br>==================================================<br>News<br><br> * We welcome submissions of original research in Foundations of Computer Science and AI, formatted using LNCS style: at most 14 pages (including references) plus a clearly marked appendix. Firm abstract deadline: August 28th, 2023, AoE; full papers must be submitted until September 1st, 2023, AoE. The reviewing is single-blind. The Easychair submission server is now open <https://easychair.org/conferences/directory?a=31466484> https://easychair.org/conferences/?conf=sofsem2024.<br><br> * All invited Speakers announced the prospective titles of their talks.<br><br> * SOFSEM 24 proceedings will be published in the ARCoSS subline of LNCS.<br><br> * There will be a Best Paper and a Best Student Paper Award sponsored by Springer.<br><br>==================================================<br><br>Invited Speakers<br><br> * Edith Elkind, Univ. Oxford, UK: Fairness in Multiwinner Voting<br> * Sevag Gharibian, Univ. Paderborn, Germany: Quantum algorithms and complexity theory: Does theory meet practice?<br> * Rob van Glabbeek, Univ. Edinburgh, UK & Stanford Univ., USA & UNSW, AUS: Modeling Time Qualitatively in Process Algebra and Concurrency Theory<br> * Markus L Schmid, HU Berlin, Germany: The Information Extraction Framework of Document Spanners - An Overview of Concepts, Results, and Recent Developments<br> * Sandra Zilles, Univ. Regina, Canada: Machine Teaching - A Combinatorial Approach to Machine Learning from Small Amounts of Data<br><br>==================================================<br><br>Program Chairs<br><br> * Henning Fernau, Univ. Trier, Germany<br> * Serge Gaspers, UNSW Sydney, Australia<br> * Ralf Klasing, CNRS, Univ. Bordeaux, France<br><br>==============================<br><br>List of topics:<br><br> * algorithmic game theory<br><br> * algorithmic learning theory<br><br> * approximation algorithms<br><br> * automata theory<br><br> * coding theory<br><br> * combinatorics, including polyhedral combinatorics<br><br> * complexity theory<br><br> * computational biology<br><br> * computational geometry<br><br> * computational models and computability<br><br> * computational statistics<br><br> * data compression: algorithms and theory<br><br> * database theory<br><br> * discrete structures<br><br> * distributed algorithms<br><br> * formal languages<br><br> * formal methods<br><br> * foundations of artificial intelligence<br><br> * foundations of machine learning<br><br> * games: algorithmic and complexity aspects<br><br> * grammatical inference<br><br> * graph algorithms, including applications like graph drawing<br><br> * graph theory<br><br> * information retrieval<br><br> * information theory<br><br> * kernelization algorithms<br><br> * logic in computer science<br><br> * network science<br><br> * neural networks theory<br><br> * online algorithms<br><br> * quantum algorithms and computing<br><br> * parallel computing<br><br> * parameterized algorithms<br><br> * probabilistic methods<br><br> * randomized algorithms<br><br> * reconfiguration and reoptimization<br><br> * self-organizing systems<br><br> * string algorithms<br> <br data-mce-bogus="1"></div></div></body></html>