Winner of an honourable mention in the 2024 Gilles Kahn Thesis Prize, awarded jointly with Mathieu Even for their work on federated learning, particularly on private data, Giannos Stamoulis is honoured in an article published in the online journal CNRS Sciences Informatiques.
The article reviews the work he carried out in his thesis entitled ‘Logics and Algorithms for Graph Minors’, prepared at the Montpellier Laboratory of Computer Science, Robotics and Microelectronics (LIRMM – CNRS / University of Montpellier).
In this thesis, Giannos Stamoulis focuses on the design of efficient algorithms for problems related to graph minors, based on the minor theory developed by Neil Robertson and Paul Seymour. This approach, at the crossroads of logic and algorithmics, allows us to explore the relationships between structure and complexity in graphs, opening up new perspectives in graph theory.
The full article can be read on the CNRS Sciences Informatiques website, which highlights the background and results of this distinguished research.
Giannos Stamoulis. Logics and algorithms for graph minors. 2023.
