Polynomial Kernels for Strictly Chordal Edge Modification Problems. - Maël Dumas; Anthony Perez 001; Ioan Todinca (IPEC, 2021)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (ISAAC, 2022)

An Improved Kernelization Algorithm for Trivially Perfect Editing. - Maël Dumas; Anthony Perez 001 (IPEC, 2023)

Modification et couverture de graphes: Approches paramétrées. (Graph modification and covering: Parameterized approaches). - Maël Dumas (2023)

A Cubic Vertex-Kernel for Trivially Perfect Editing. - Maël Dumas; Anthony Perez 001; Ioan Todinca (Algorithmica, 2023)

Detecting K2,3 as an Induced Minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (IWOCA, 2024)

Detecting K2, 3 as an induced minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (CoRR, 2024)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (SIAM J. Discret. Math., 2024)

Sufficient Conditions for Polynomial-Time Detection of Induced Minors. - Clément Dallard; Maël Dumas; Claire Hilaire; Anthony Perez 001 (SOFSEM (1), 2025)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs. - Maël Dumas; Anthony Perez 001; Mathis Rocton; Ioan Todinca (Discret. Math. Theor. Comput. Sci., 2025)