Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Maël Dumas
Observed name:
Dumas, Maël
Institution:
University of Warsaw
Observed institutions:
Université d'Orléans,
Institut National des Sciences Appliquées Centre Val de Loire,
Laboratoire d'Informatique Fondamentale d'Orléans,
University of Warsaw
ORCID:
0009-0004-8906-9801
Observed ORCID:
0009-0004-8906-9801
OpenAlex ID:
A5011202184
On Graphs Coverable by \({k}\) Shortest Paths
2024
·
Maël Dumas
, Florent Foucaud
, et al.
·
SIAM Journal on Discrete Mathematics
·
18
PDF
Induced minor models. I. Structural properties and algorithmic consequences
2025
·
Nicolas Bousquet
, Clément Dallard
, et al.
·
Journal of Computer and System Sciences
·
13
Detecting $$K_{2,3}$$ as an Induced Minor
2024
·
Clément Dallard
, Maël Dumas
, et al.
·
Lecture notes in computer science
·
11
PDF
A Cubic Vertex-Kernel for Trivially Perfect Editing
2022
·
Maël Dumas
, Anthony Perez
, et al.
·
Algorithmica
·
10
PDF
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
2025
·
Maël Dumas
, Anthony Perez
, et al.
·
Discrete Mathematics & Theoretical Computer Science
·
5
PDF
An Improved Kernelization Algorithm for Trivially Perfect Editing
2023
·
Dumas, Maël
, Perez, Anthony
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
Variants of Merge-Width and Applications
2026
·
Drabik, Karolina
, Dumas, Maël
, et al.
·
arXiv (Cornell University)
·
4
PDF
Polynomial Kernels for Strictly Chordal Edge Modification Problems
2021
·
Dumas, Maël
, Perez, Anthony
, et al.
·
HAL
·
4
Polynomial Kernels for Strictly Chordal Edge Modification Problems
2021
·
Dumas, Maël
, Perez, Anthony
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
Sufficient Conditions for Polynomial-Time Detection of Induced Minors
2025
·
Clément Dallard
, Maël Dumas
, et al.
·
Lecture notes in computer science
·
3
Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
2025
·
Dallard, Clément
, Dumas, Maël
, et al.
·
arXiv (Cornell University)
·
3
PDF
Flips and Merge-Width in Sparse Graphs
2026
·
Drabik, Karolina
, Dumas, Maël
, et al.
·
arXiv (Cornell University)
·
2
PDF
Invitation to torso parameters of annotated graphs
2026
·
Dumas, Maël
, Hodor, Jędrzej
, et al.
·
arXiv (Cornell University)
·
1
PDF
Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width
2026
·
Bonnet, Édouard
, Dumas, Maël
, et al.
·
arXiv (Cornell University)
·
1
PDF
Well-Quasi-Ordered Classes of Bounded Clique-Width
2026
·
Dumas, Maël
, Lopez, Aliaume
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
1
PDF
An improved kernelization algorithm for Trivially Perfect Editing
2023
·
Dumas, Maël
, Perez, Anthony
·
arXiv (Cornell University)
·
1
PDF
Almost Linear 3-Spanners of Temporal Cliques
2026
·
Baligacs, Julia
, Bilò, Davide
, et al.
·
arXiv (Cornell University)
PDF
Constant-factor approximation of maximum distance-2 independent set in graphs of bounded merge-width
2026
·
Dumas, Maël
·
arXiv (Cornell University)
PDF
Modification et couverture de graphes : Approches paramétrées
2023
·
Maël Dumas
·
theses.fr (ABES)
PDF
Show more works
View as search
Works count:
19
Citation count:
86
H-index:
5
I10-index:
4
Year
Topic
Type