I am a member of the OC Team of the CEDRIC. My main area of research is Operations research. Particularly, I study the complexity, the parameterized complexity and/or the approximability of practical and theoretical combinatorial optimization problems (mostly graph problems) whose fields may vary from Telecommunication networks, transportation networks, chemistry, ...
I mostly work on the following problems. Click for more information.
|
[WWBB15b]
|
D. Watel, M.-A. Weisser, C. Bentz, and D. Barth.
An FPT algorithm in polynomial space for the directed steiner tree
problem with limited number of diffusing nodes.
Information Processing Letters, 115(2):275 -- 279, 2015.
[ DOI |
http ]
|
|
[WWBB15a]
|
D. Watel, M.-A. Weisser, C. Bentz, and D. Barth.
Directed steiner trees with diffusion costs.
Journal of Combinatorial Optimization (Version longue de
[WWBB14]), pages 1--18, 2015.
[ DOI |
http ]
|
|
[WW16]
|
Dimitri Watel and Marc-Antoine Weisser.
A practical greedy approximation for the directed steiner tree
problem.
Journal of Combinatorial Optimization (Version longue de
[WW14b]), 32(4):1327--1370, 2016.
[ DOI |
http ]
|
|
[WF18]
|
D. Watel and A. Faye.
Taxi-sharing: Parameterized complexity and approximability of the
dial-a-ride problem with money as an incentive.
Theoretical Computer Science, 745:202 -- 223, 2018.
[ DOI |
http ]
|
|
[IBD+19]
|
S. Nouleho Ilemo, D. Barth, O. David, F. Quessette, M.-A. Weisser, and
D. Watel.
Improving graphs of cycles approach to structural similarity of
molecules.
PLOS ONE, 14(12):1--25, 12 2019.
[ DOI |
http ]
|
|
[EBdM+20]
|
W. Ehounou, D. Barth, A. de Moissac, D. Watel, and M.-A. Weisser.
Minimizing the hamming distance between a graph and a line-graph to
discover the topology of an electrical network.
Journal of Graph Algorithms and Applications, 24(3):133--153,
2020.
[ DOI ]
|
|
[BMM+21]
|
D. Barth, A. De Moissac, T. Mautor, D. Watel, and M.-A. Weisser.
Optimisation of electrical network configuration: Complexity and
algorithms for ring topologies.
TCS, 859:162--173, 2021.
[ DOI |
http ]
|
|
[BMWW22]
|
D. Barth, T. Mautor, D. Watel, and M.A. Weisser.
A polynomial algorithm for deciding the validity of an electrical
distribution tree.
IPL, 176:106249, 2022.
[ DOI |
http ]
|
|
[BAKM+22]
|
W. Ben-Ameur, N. Kushik, A. Maddaloni, J. Neto, and D. Watel.
The no-meet matroid.
Discrete Applied Mathematics, 2022.
[ DOI |
http ]
|
|
[BMWW23]
|
Dominique Barth, Thierry Mautor, Dimitri Watel, and Marc-Antoine Weisser.
Configuring an heterogeneous smartgrid network: complexity and
approximations for tree topologies.
Journal of Global Optimization, pages 1--35, 2023.
|
|
[BW24]
|
Julien Baste and Dimitri Watel.
An fpt algorithm for node-disjoint subtrees problems parameterized by
treewidth.
Theoretical Computer Science, 990:114406, 2024.
[ DOI |
http ]
|
|
[WWBB13]
|
D. Watel, M.-A. Weisser, C. Bentz, and D. Barth.
Steiner problems with limited number of branching nodes.
In Structural Information and Communication Complexity - 20th
International Colloquium, SIROCCO 2013, rang B, 41.8%, Ischia, Italy, July
1-3, 2013, Revised Selected Papers, pages 310--321, 2013.
[ DOI |
http ]
|
|
[WWBB14]
|
D. Watel, M.-A. Weisser, C. Bentz, and D. Barth.
Directed steiner tree with branching constraint.
In Computing and Combinatorics - 20th International Conference,
COCOON 2014, Rang A, 46.4%, Atlanta, GA, USA, August 4-6, 2014.
Proceedings, pages 263--275, 2014.
[ DOI |
http ]
|
|
[WW14b]
|
D. Watel and M.-A. Weisser.
A practical greedy approximation for the directed steiner tree
problem.
In Combinatorial Optimization and Applications - 8th
International Conference, COCOA 2014, rang B, 42.1%, Wailea, Maui, HI,
USA, December 19-21, 2014, Proceedings, pages 200--215, 2014.
[ DOI |
http ]
|
|
[WW14a]
|
D. Watel and M.-A. Weisser.
Le problème de l'arborescence de Steiner dans les réseaux
tout-optiques.
In ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les
Aspects Algorithmiques des Télécommunications, pages 1--4, Le
Bois-Plage-en-Ré, France, June 2014.
[ http |
.pdf ]
|
|
[WP16]
|
D. Watel and P.-L. Poirion.
The maximum matrix contraction problem.
In Combinatorial Optimization - 4th International Symposium,
ISCO 38.7% Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected
Papers, pages 426--438, 2016.
[ DOI |
http ]
|
|
[WWB17]
|
D. Watel, M.-A. Weisser, and D. Barth.
Parameterized complexity and approximability of coverability problems
in weighted petri nets.
In Wil van der Aalst and Eike Best, editors, Application and
Theory of Petri Nets and Concurrency PETRI NET, 48.5%, pages 330--349,
Cham, 2017. Springer International Publishing.
[ DOI |
http ]
|
|
[HADW22]
|
C. Le Hasif, A. Araldo, S. Dumbrava, and D. Watel.
A graph-database approach to assess the impact of demand-responsive
services on public transit accessibility.
In Andy Berres, Kuldeep R. Kurte, and Haowen Xu, editors,
Proceedings of the 15th ACM SIGSPATIAL International Workshop on
Computational Transportation Science, IWCTS 2022, Seattle, Washington, 1
November 2022, pages 2:1--2:4. ACM, 2022.
[ DOI |
http ]
|
|
[Wat13]
|
D. Watel.
Steiner Problems with Limited Number of Branching nodes, Juillet
2013.
Invited talk at EURO 2013 session, stream Graphs and Networks.
|
|
[Wat15]
|
D. Watel.
A Practical Greedy Approximation for the Directed Steiner Tree
Problem, Juillet 2015.
Invited talk at EURO 2015 session, stream Graphs and Networks.
|
|
[FW16]
|
A. Faye and D. Watel.
Mutualisation de taxis avec partage de coût : modélisation,
complexité et linéarisation du problème, Février 2016.
ROADEF, Session Mobilité urbaine.
|
|
[FW17]
|
A. Faye and D. Watel.
Mutualisation de taxis avec partage de coût : complexité
paramétrée et heuristique par un problème de stables, Février 2017.
ROADEF, Session Mobilité urbaine.
|
|
[RWPP17]
|
T. Ridremont, D. Watel, P.-L. Poirion, and C. Picouleau.
Flot adaptatif maximum pour la destruction de k arcs, Février 2017.
ROADEF.
|
|
[GLF+17]
|
E. Gladkikh, A. Lambert, A. Faye, D. Watel, and M.-C. Costa.
Optimisation du maillage électrique du parc éoliennes off-shore –
projet Stationis, Février 2017.
ROADEF.
|
|
[RWPP18a]
|
T. Ridremont, D. Watel, P.-L. Poirion, and C. Picouleau.
Flot adaptatif maximum pour la destruction de k arcs, Février 2018.
ROADEF.
|
|
[RWPP18b]
|
T. Ridremont, D. Watel, P.-L. Poirion, and C. Picouleau.
Flot adaptatif maximum pour la destruction de k arcs, Septembre 2018.
OR.
|
|
[MW19]
|
M. Merabet and D. Watel.
Noyaux, heuristique et algorithme exact pour le problème
généralisé de recherche d'arbre couvrant ayant un minimum de sommets de
k-branchement, Février 2019.
ROADEF.
|
|
[BMW+19]
|
D. Barth, T. Mautor, M.-A. Weisser, A. de Moissac, and D. Watel.
Complexités de la configuration et de l'optimisation d'un réseau de
distribution électrique., 2019.
ROADEF.
|
|
[MW20a]
|
M. Merabet and D. Watel.
Une nouvelle formulation PLNE pour le problème de recherche d'arbre
couvrant ayant un mininmum de sommets de k-branchement, Février 2020.
ROADEF.
|
|
[MW20b]
|
M. Merabet and D. Watel.
Complexité paramétrée des problèmes d'arbres couvrant avec des
contraintes locales, Février 2020.
ROADEF.
|
|
[AW22]
|
Y. Aboulfath and D. Watel.
Maximiser l'intersection de bases de cycles minimum dans un ensemble
de graphes dynamiques, Février 2022.
ROADEF.
|
|
[FKW22]
|
A. Faye, H. Kim, and D. Watel.
On the complexity of the data-driven Wasserstein distributionally
robust binary problem, Février 2022.
ROADEF.
|
|
[BWW22]
|
D. Barth, M.-A. Weisser, and D. Watel.
Distance dédition minimum à un linegraph, Février 2022.
ROADEF.
|
|
[BW22]
|
J. Baste and D. Watel.
An FPT algorithm for node-disjoint subtrees problems parameterized by
treewidth, Juillet 2022.
ICGT.
|
|
[BAKM+23]
|
W. Ben-Ameur, N. Kushik, A. Maddaloni, J. Neto, and D. Watel.
Le matroïde No-meet, Février 2023.
ROADEF.
|
