25th Max Planck Advanced Course on the Foundations of Computer Science

The goal of this year's ADFOCS is to educate people with a TCS background on recent advances in graph decomposition techniques and their use in designing efficient algorithms. The focus of the summer school will be on the following topics:

• Structure theory for graph classes with forbidden induced subgraphs and designing efficient algorithms on such graphs (Maria Chudnovsky)
• Structural Sparsity and efficient algorithms for First-Order model checking (Michał Pilipczuk)
• Expander decompositions and their variants, and their applications to design (near) linear-time algorithms (Thatchaphol Saranurak)

This summer school has an international scope, and its goal is to bring together leading researchers with international participants at the graduate level and above.

No special knowledge is necessary to attend this course.

Please do not hesitate to contact us for any questions via email to adfocs@mpi-inf.mpg.de.

Following a one-week break after ADFOCS, the 2025 edition of Highlights of Logic, Games and Automata also takes place at the Saarland University in Saarbrücken, Germany (01–05 Sep).

Highlights of Logic, Games and Automata is an annual conference that offers a wide picture of the latest research in the fields of algorithmic model theory, automata theory, databases, games for logic and verification, logic, and verification (the format of the confernce is comparable to HALG). If you are interested in any of these research areas, you may want to stay in Saarbrücken for both events.