معرفی
Christian Laforest is a Professor of computer science at Université Clermont Auvergne, affiliated with Clermont-Auvergne INP. He conducts research at LIMOS (French laboratory of computer science; associated with CNRS, UMR 6158) and teaches at ISIMA (French graduate engineering school focused on computing and applications).
His primary research interests include:
- Graph algorithms and theory (vertex cover, independent dominating set, Steiner tree)
- Discrete optimization
- Approximation algorithms (worst case and average case analysis)
- Online algorithms and adaptive algorithms
- Random algorithms
- Multicriteria optimization/approximation
- Distributed algorithms
Professor Laforest's publication record reveals a consistent focus on theoretical computer science with practical applications in network design. His recent work has explored domination problems, vertex cover algorithms, and independent domination set problems across various graph structures. He has made significant contributions to approximation algorithms, particularly in worst-case and average-case analyses, as well as online algorithms that must make decisions without complete future information. His research methodology often involves using Maple for algorithm testing and theoretical calculations on graphs.
His notable scientific achievements include:
- Prix Tangente du meilleur article 2015 for "Sur les algorithmes en ligne"
- Article primé en 2014 for "Sur les algorithmes d'approximation"
Professor Laforest has supervised numerous PhD students throughout his career, including Alexis Irlande, Christian Destré, Fabien Baille, Nicolas Thibault, François Delbot, Romain Campigotto, Raksmey Phan, Benjamin Momège, and Alexis Cornet. His research has been supported by various projects funded by CNRS, RNRT, and the French ANR, including Multipoints, AcTAM, ROM, ROM-EO, ALGOL, TODO, and SHAMAN. He is also active in scientific vulgarization through magazine articles, a published book on graph theory, and a dedicated YouTube channel.
