Dimitri Watel

According to our database, Dimitri Watel authored at least 22 papers between 2013 and 2025.

Collaborative distances:

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

2025

Correcting a Graph Into a Linegraph Minimizing Hamming Distance Edition Is NP-Complete and FPT by Treewidth.

Dominique Barth, Dimitri Watel, Marc-Antoine Weisser

J. Graph Algorithms Appl., 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

Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

2024

Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies.

Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser

J. Glob. Optim., May, 2024

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth.

Julien Baste, Dimitri Watel

Theor. Comput. Sci., 2024

The no-meet matroid.

Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel

Discret. Appl. Math., 2024

Maximal Line Digraphs.

Quentin Japhet, Dimitri Watel, Dominique Barth, Marc-Antoine Weisser

CoRR, 2024

Maximizing Minimum Cycle Bases Intersection.

Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth

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

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., 2022

A graph-database approach to assess the impact of demand-responsive services on public transit accessibility.

Cathia Le Hasif, Andrea Araldo, Stefania Dumbrava, Dimitri Watel

Proceedings of the 15th ACM SIGSPATIAL International Workshop on Computational Transportation Science, 2022

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., 2021

2020

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network.

Wilfried Joseph Ehounou, Dominique Barth, Arnaud De Moissac, Dimitri Watel, Marc-Antoine Weisser

J. Graph Algorithms Appl., 2020

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., 2018

A new graph modelisation for molecule similarity.

Stéfi Nouleho, Dominique Barth, Franck Quessette, Marc-Antoine Weisser, Dimitri Watel, Olivier David

CoRR, 2018

2017

Adaptive Network Flow with k-Arc Destruction.

Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau

CoRR, 2017

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets.

Dimitri Watel, Marc-Antoine Weisser, Dominique Barth

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2017

2016

Directed Steiner trees with diffusion costs.

Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth

J. Comb. Optim., 2016

A practical greedy approximation for the directed Steiner tree problem.

Dimitri Watel, Marc-Antoine Weisser

J. Comb. Optim., 2016

The Maximum Matrix Contraction Problem.

Dimitri Watel, Pierre-Louis Poirion

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

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., 2015

2014

Approximation de l'arborescence de Steiner. (Approximation of the Directed Steiner Tree Problem).

Dimitri Watel

PhD thesis, 2014

Directed Steiner Tree with Branching Constraint.

Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Steiner Problems with Limited Number of Branching Nodes.

Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth

Proceedings of the Structural Information and Communication Complexity, 2013