Giannos Stamoulis, who defended his thesis in December 2023, has just been named winner of the Graphes “Charles Delorme” thesis prize for his thesis “Logic and Algorithms for Graph Minors”, supervised by Ignasi Sau and Dimitrios Thilikos in the AlGCo team.
The “Charles Delorme” Graphes Thesis Prize is an annual award created in 2016 by the family of Charles Delorme to honor his memory and work, which wishes to reward an excellent thesis in Graphes (theory and algorithmics) each year.
Giannos’s thesis work lies at the intersection of logic, algorithmics and graph theory. The thesis proposes a meta-algorithmic framework capitalizing on the algorithmic consequences of “Graph Minors”, the seminal series of papers by Robertson and Seymour dealing with graph minors. Its main perspective consists in the proof of algorithmic meta-theorems, which provide general mathematical conditions (logical and combinatorial) enabling the automatic derivation of efficient algorithms. The main algorithmic meta-theorems demonstrated in this thesis concern logics between first-order logic and second-order monadic logic, including large families of routing and graph modification problems.
Read more : https://gtgraphes.labri.fr/pmwiki/pmwiki.php/PrixTheseDelorme/PrixTheseDelorme
Contacte : giannos.stamoulis@lirmm.fr
