EDBT 2026 Demo / reviewers in the wild / expert
Dimitri Watel
dblp:137/4694
· DBLP profile ↗
14ranked-venue papers
7as first author
7since 2021 · last 2025
0000-0003-4365-1092ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 12 · 5 first-author · 7 since 2021Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Polymorphic Cycle Basis in a Sequence of Graphs to Analyze the Structural Evolution of a Molecular Dynamic Trajectory
Ylène Aboulfath, Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser |
SEA | 4 |
| 2024 | Maximizing Minimum Cycle Bases Intersection
Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth |
IWOCA | 2 |
| 2024 | The no-meet matroid
Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto 0001, Dimitri Watel |
Discret. Appl. Math. | 5 |
| 2024 | Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies
Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser |
J. Glob. Optim. | 3 |
| 2024 | An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
Julien Baste, Dimitri Watel |
Theor. Comput. Sci. | 2 |
| 2022 | A polynomial algorithm for deciding the validity of an electrical distribution tree
Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser |
Inf. Process. Lett. | 3 |
| 2021 | Optimisation of electrical network configuration: Complexity and algorithms for ring topologies
Dominique Barth, Thierry Mautor, Arnaud De Moissac, Dimitri Watel, Marc-Antoine Weisser |
Theor. Comput. Sci. | 4 |
| 2018 | Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
Dimitri Watel, Alain Faye |
Theor. Comput. Sci. | 1 |
| 2017 | Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets
Dimitri Watel, Marc-Antoine Weisser, Dominique Barth |
Petri Nets | 1 |
| 2016 | The Maximum Matrix Contraction Problem
Dimitri Watel, Pierre-Louis Poirion |
ISCO | 1 |
| 2015 | An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes
Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth |
Inf. Process. Lett. | 1 |
| 2014 | A Practical Greedy Approximation for the Directed Steiner Tree Problem
Dimitri Watel, Marc-Antoine Weisser |
COCOA | 1 |
| 2014 | Directed Steiner Tree with Branching Constraint
Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth |
COCOON | 1 |
| 2013 | Steiner Problems with Limited Number of Branching Nodes
Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth |
SIROCCO | 1 |