LIRMM  Université de Montpellier CNRS 

Ignasi Sau - Supervised students



07/2024-08/2025 Guilherme C. M. Gomes Postdoc (funded by a European MSCA grant) Parameterized complexity and kernelization for enumeration




11/2023-10/2024 Raul Lopes Postdoc (funded by ANR ELiT) Efficient algorithms on directed graphs




01/2023-12/2026 Eric Brandwein Ph.D, co-supervised with Flavia Bonomo-Braberman from Universidad de Buenos Aires, Argentina Thinness and related graph parameters




09/2022-08/2025 Laure Morelle (web) Ph.D, co-supervised with Dimitrios M. Thilikos Optimizing the efficiency of meta-algorithmic techniques for graph modification problems




03/2022-08/2022 Laure Morelle M2 internship, co-supervised with Dimitrios M. Thilikos Efficient FPT algorithms for graph modification problems to minor-closed graph classes




10/2020-09/2023 Giannos Stamoulis Ph.D, co-supervised with Dimitrios M. Thilikos Algorithmic meta-theorems for graph modification problems




02/2020-06/2020 Nour Karnib M2 internship, co-supervised 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, co-supervised with Dimitrios M. Thilikos Treewidth: algorithmic, combinatorial and practical aspects




10/2012-07/2016 Valentin Garnero Ph.D, co-supervised 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


Last updated: October 2, 2019 back to Home