Get started
Author

Dimitri Watel

Observed name: Watel, Dimitri
Observed institutions: Supélec, Conservatoire National des Arts et Métiers, Centre National de la Recherche Scientifique, Université de Versailles Saint-Quentin-en-Yvelines, École Nationale Supérieure d’Informatique pour l’Industrie et l’Entreprise, Institut Polytechnique de Paris, Centre d'études et de recherche en informatique et communications, Télécom SudParis, Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
ORCID: 0000-0003-4365-1092
Observed ORCID: 0000-0003-4365-1092
OpenAlex ID: A5086817354
A practical greedy approximation for the directed Steiner tree problem
2016 · Dimitri Watel, Marc-Antoine Weisser · Journal of Combinatorial Optimization · 21
A Practical Greedy Approximation for the Directed Steiner Tree Problem
2014 · Dimitri Watel, Marc-Antoine Weisser · Lecture notes in computer science · 19
Improving graphs of cycles approach to structural similarity of molecules
2019 · Stefi Nouleho Ilemo, Dominique Barth, et al. · PLoS ONE · 16
PDF
Steiner Problems with Limited Number of Branching Nodes
2013 · Dimitri Watel, Marc-Antoine Weisser, et al. · Lecture notes in computer science · 11
Optimisation of electrical network configuration: Complexity and algorithms for ring topologies
2021 · Dominique Barth, Thierry Mautor, et al. · Theoretical Computer Science · 8
Directed Steiner trees with diffusion costs
2015 · Dimitri Watel, Marc-Antoine Weisser, et al. · Journal of Combinatorial Optimization · 8
A graph-database approach to assess the impact of demand-responsive services on public transit accessibility
2022 · Cathia Le Hasif, Andrea Araldo, et al. · ACM SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS) · 7
PDF
Directed Steiner Tree with Branching Constraint
2014 · Dimitri Watel, Marc-Antoine Weisser, et al. · Lecture notes in computer science · 6
The no-meet matroid
2022 · Walid Ben-Ameur, Natalia Kushik, et al. · Discrete Applied Mathematics · 5
PDF
A new graph modelisation for molecule similarity
2018 · Nouleho, Stéfi, Barth, Dominique, et al. · arXiv (Cornell University) · 5
PDF
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies
2023 · Dominique Barth, Thierry Mautor, et al. · Journal of Global Optimization · 4
PDF
Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
2018 · Dimitri Watel, Alain Faye · Theoretical Computer Science · 4
PDF
An Fpt Algorithm for Node-Disjoint Subtrees Problems Parameterized by Treewidth
2022 · Julien Baste, Dimitri Watel · SSRN Electronic Journal · 3
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets
2017 · Dimitri Watel, Marc-Antoine Weisser, et al. · Lecture notes in computer science · 3
Maximizing Minimum Cycle Bases Intersection
2024 · Ylène Aboulfath, Dimitri Watel, et al. · Lecture notes in computer science · 2
PDF
A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem
2016 · Watel, Dimitri, Weisser, Marc-Antoine · HAL · 2
Maximal Line Digraphs
2026 · Quentin Japhet, Dimitri Watel, et al. · Journal of Graph Theory · 1
PDF
On the complexity of the data-driven Wasserstein distributionally robust binary problem
2022 · Kim, Hyoseok, Watel, Dimitri, et al. · HAL · 1
A polynomial algorithm for deciding the validity of an electrical distribution tree
2022 · Dominique Barth, Thierry Mautor, et al. · Information Processing Letters · 1
PDF
Approximation de l'arborescence de Steiner
2014 · Dimitri Watel · theses.fr (ABES) · 1
PDF
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes
2014 · Dimitri Watel, Marc-Antoine Weisser, et al. · Information Processing Letters · 1
Circuit Design Problems in Binary Polynomial Quantum Optimization
2026 · Laplace Mermoud, Dylan, Watel, Dimitri, et al. · HAL
Graph determination problem from knowledge of its subgraphs
2026 · Zens, Coralie, Barth, Dominique, et al. · arXiv (Cornell University)
PDF
Circuit Design Problems in Binary Polynomial Quantum Optimization
2026 · Mermoud, Dylan Laplace, Watel, Dimitri, et al. · arXiv (Cornell University)
PDF
Graph reconstruction from queries on triples (Extended abstract)
2025 · Galliot, Florian, La, Hoang, et al. · HAL
PDF
Works count: 40
Citation count: 130
H-index: 7
I10-index: 4
Year
Topic
Type