| 10/2020-09/2023
| Giannos Stamoulis
| Ph.D, together with Dimitrios M. Thilikos
| Algorithmic meta-theorems for graph modification problems
|
|
|
|
|
|
|
|
|
|
|
02/2020-06/2020
| Nour Karnib
| M2 internship, together with Marin Bougeret
| Bridge-depth: combinatorial and algorithmic properties
|
|
|
|
|
|
|
|
|
|
|
09/2018-08/2019
| Raul Lopes
| Ph.D internship
| Relaxations of the Directed Disjoint Paths problem
|
|
|
|
|
|
|
|
|
|
|
09/2018-02/2019
| Guilherme C. M. Gomes
| Ph.D internship
| Complexity of finding cuts of bounded degree
|
|
|
|
|
|
|
|
|
|
|
09/2014-09/2017
| Julien Baste
| Ph.D, together with Dimitrios M. Thilikos
| Treewidth: algorithmic, combinatorial and practical aspects
|
|
|
|
|
|
|
|
|
|
|
10/2012-07/2016
| Valentin Garnero
| Ph.D, together with Christophe Paul
| (Méta)-noyaux constructifs et linéaires dans les graphes peu denses
|
|
|
|
|
|
|
|
|
|
|
02/2014-07/2014
| Henri Perret du Cray
| M2 internship
| FPT algorithms and kernels on graphs without induced subgraphs
|
|
|
|
|
|
|
|
|
|
|
02/2013-07/2013
| Julien Baste
| M2 internship
| The role of planarity in connectivity problems parameterized by treewidth
|
|
|
|
|
|
|
|
|
|
|
03/2012-08/2012
| Valentin Garnero
| M2 internship
| Polynomial kernels for variants of domination problems on planar graphs
|