Maël Dumas

e-mail : mdumas@mimuw.edu.pl

Current position

• Postdoc at the Faculty of Mathematics, Informatics and Mechanics of University of Warsaw, part of ERC project BOBR, led by Michał Pilipczuk.

Previous Positions

• 2024 - 2025: Postdoc at the Faculty of Mathematics, Informatics and Mechanics of University of Warsaw, part of ERC project BUKA, led by Szymon Toruńczyk.
• 2023 - 2024: Research and teaching assistant at University of Orléans, LIFO.
• 2020 - 2023: PhD student at University of Orléans, LIFO.

PhD thesis

• Graph modification and covering: Parameterized approaches (manuscript, slides, both in french)
• Supervisors : Ioan Todinca and Anthony Perez
• At University of Orléans, LIFO, team GAMoC (Graphs, Algorithms and Models of Computation)
• Started in October 2020, defended on December 15th 2023

Research Interest

• Graph theory: graph parameters, graph modification
• Parameterized complexity: FPT algorithms, polynomial kernels

Publications

Journals

• Polynomial kernels for edge modification problems towards block and strictly chordal graphs
  Maël Dumas, Anthony Perez, Mathis Rocton, Ioan Todinca. Discrete Mathematics & Theoretical Computer Science, 2025.
• On Graphs Coverable by k Shortest Paths
  Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca. SIAM Journal on Discrete Mathematics, 2024 (arXiv)
• A Cubic Vertex-Kernel for Trivially Perfect Editing
  Maël Dumas, Anthony Perez, Ioan Todinca. Algorithmica, 2023 (arXiv)

Conference proceedings

• Sufficient conditions for polynomial-time detection of induced minors
  Clément Dallard, Maël Dumas, Claire Hilaire, Anthony Perez. SOFSEM 2025 (arXiv)
• Detecting K_2,3 as an induced minor
  Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon. IWOCA 2024 (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

• Induced Minor Models. I. Structural Properties and Algorithmic Consequences
  Nicolas Bousquet, Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon.

Talks

Meetings & Seminars

• Sufficient conditions for polynomial-time detection of induced minors (slides)
  SOFSEM 2025, Bratislava, Slovakia.
  Journées Graphes et Algorithmes 2024, Dijon, France, November 2024.
•  
• On graphs coverable by k shortest paths (slides)
  Theoretical Computer Science Seminar Jagiellonian University, Krakow, Poland, December 2024.
  Algorithms seminar, Institute of Informatics, University of Warsaw, Poland, October 2024.
  Mathematical Research Seminar, Famnit, Koper, Slovenia, October 2023.
  Séminaires "Optimisation combinatoire, algorithmique", LAMSADE, Paris, February 2023.
  ISAAC 2022, Seoul, South Korea.
  Journées Graphes et Algorithmes 2022, Paris, November 2022.
  Journées informatique en Région Centre-Val de Loire 2022, Orléans, October 2022.
•  
• An improved kernelization algorithm for Trivially Perfect Editing (slides)
  IPEC 2023, Amsterdam, the Netherlands.
  
•  
• A Cubic Vertex-Kernel for Trivially Perfect Editing
  Journées Graphes et Algorithmes 2021, Online, November 2021.
  MFCS 2021, Tallinn, Estonia.
  
•  
• Polynomial kernels for strictly chordal edge modification problems
  IPEC 2021, Online.
  

Teachings

• 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