Maël Dumas

According to our database, Maël Dumas authored at least 14 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Variants of Merge-Width and Applications.

Karolina Drabik, Maël Dumas, Colin Geniet, Jakub Nowakowski, Michal Pilipczuk, Szymon Torunczyk

CoRR, February, 2026

Flips and Merge-Width in Sparse Graphs.

Karolina Drabik, Maël Dumas, Nikolas Mählmann, Wojciech Przybyszewski, Szymon Torunczyk

CoRR, February, 2026

Well-quasi-ordered classes of bounded clique-width.

Maël Dumas, Aliaume Lopez

CoRR, January, 2026

Induced minor models. I. Structural properties and algorithmic consequences.

Nicolas Bousquet, Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon

J. Comput. Syst. Sci., 2026

2025

Polynomial kernels for edge modification problems towards block and strictly chordal graphs.

Maël Dumas, Anthony Perez, Mathis Rocton, Ioan Todinca

Discret. Math. Theor. Comput. Sci., 2025

Sufficient Conditions for Polynomial-Time Detection of Induced Minors.

Clément Dallard, Maël Dumas, Claire Hilaire, Anthony Perez

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

2024

On Graphs Coverable by <i>k</i> Shortest Paths.

Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca

SIAM J. Discret. Math., 2024

Detecting K_{2, 3} as an induced minor.

Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon

CoRR, 2024

Detecting K_2,3 as an Induced Minor.

Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

Modification et couverture de graphes: Approches paramétrées. (Graph modification and covering: Parameterized approaches).

Maël Dumas

PhD thesis, 2023

An Improved Kernelization Algorithm for Trivially Perfect Editing.

Maël Dumas, Anthony Perez

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

On Graphs Coverable by k Shortest Paths.

Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

A Cubic Vertex-Kernel for Trivially Perfect Editing.

Maël Dumas, Anthony Perez, Ioan Todinca

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Polynomial Kernels for Strictly Chordal Edge Modification Problems.

Maël Dumas, Anthony Perez, Ioan Todinca

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021