- Enseignant-e: Arnaud Casteigts
- Enseignant-e: Himika Das
- Enseignant-e: Matteo De Francesco
The goal of this course is to cover a variety of topics in graph theory from an algorithmic perspective, ranging from fundamental well-known algorithms (e.g. spanning trees, maximum matching, planarity testing, graph coloring, maximum cliques) to more trendy topics like parameterized complexity, temporal graphs, distributed local algorithms, and probabilistic algorithms.