Maël Dumas
e-mail : mael.dumas[at]univ-orleans.fr
Current Position
- Temporary research and teaching assistant
- At University of Orléans, LIFO, team GAMoC (Graphs, Algorithms and Models of Computation).
- Started in October 2023
PhD thesis
Research Interest
- Graph theory: edge modification, path covering, induced minor testing
- Parameterized complexity: FPT algorithms, polynomial kernels
Publications
Journals
Conference proceedings
- Detecting K_2,3 as an induced minor
Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon. IWOCA 2024 (accepted) (arXiv)
-
An improved kernelization algorithm for Trivially Perfect Editing
Maël Dumas, Anthony Perez. IPEC 2023.
-
On graphs coverable by k shortest paths
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca. ISAAC 2022.
-
Polynomial Kernels for Strictly Chordal Edge Modification Problems
Maël Dumas, Anthony Perez, Ioan Todinca. IPEC 2021.
-
A Cubic Vertex-Kernel for Trivially Perfect Editing
Maël Dumas, Anthony Perez, Ioan Todinca. MFCS 2021.
Pre-publications
Talks
Meetings & Seminars
-
On graphs coverable by k shortest paths (slides)
Mathematical Research Seminar, Famnit, Koper, Slovenia, October 2023.
Séminaires "Optimisation combinatoire, algorithmique", LAMSADE, Paris, February 2023.
Journées Graphes et Algorithmes 2022, Paris, November 2022.
Journées informatique en Région Centre-Val de Loire 2022, Orléans, October 2022.
-
A Cubic Vertex-Kernel for Trivially Perfect Editing
Journées Graphes et Algorithmes 2021, Online, November 2021.
Teachings
Université d'Orléans :
-
2023-2024 :
- TD & TP Analyse des Algorithmes, M1
- TD Calculabilité et Complexité, M1
- TD & TP Cryptographie et sécurité, M1
- TD Recherche Opérationelle, L3
- TD & TP algorithmique et combinatoire des structures discrètes, L2
- TD Architecture des Ordinateurs, L1
-
2022-2023 :
- TD & TP Analyse des Algorithmes, M1
- TD Calculabilité et Complexité, M1
- TD Recherche Opérationelle, L3
-
2021-2022 :
- TD & TP Algorithme et Programmation 2, L1
- TD Calculabilité et Complexité, M1
-
2020-2021 :
- TD & TP Algorithme et Programmation 2, L1
- TD Logique, L1