Steiner Problems with Limited Number of Branching Nodes. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (SIROCCO, 2013)

Directed Steiner Tree with Branching Constraint. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (COCOON, 2014)

Approximation de l'arborescence de Steiner. (Approximation of the Directed Steiner Tree Problem). - Dimitri Watel (2014)

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)

The Maximum Matrix Contraction Problem. - Dimitri Watel; Pierre-Louis Poirion (ISCO, 2016)

A practical greedy approximation for the directed Steiner tree problem. - Dimitri Watel; Marc-Antoine Weisser (J. Comb. Optim., 2016)

Directed Steiner trees with diffusion costs. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (J. Comb. Optim., 2016)

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets. - Dimitri Watel; Marc-Antoine Weisser; Dominique Barth (Petri Nets, 2017)

Adaptive Network Flow with k-Arc Destruction. - Thomas Ridremont; Dimitri Watel; Pierre-Louis Poirion; Christophe Picouleau (CoRR, 2017)

A new graph modelisation for molecule similarity. - Stéfi Nouleho; Dominique Barth; Franck Quessette; Marc-Antoine Weisser; Dimitri Watel; Olivier David 003 (CoRR, 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)

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)

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)

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 (IWCTS@SIGSPATIAL, 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)

Maximizing Minimum Cycle Bases Intersection. - Ylène Aboulfath; Dimitri Watel; Marc-Antoine Weisser; Thierry Mautor; Dominique Barth (IWOCA, 2024)

Maximal Line Digraphs. - Quentin Japhet; Dimitri Watel; Dominique Barth; Marc-Antoine Weisser (CoRR, 2024)

The no-meet matroid. - Walid Ben-Ameur; Natalia Kushik; Alessandro Maddaloni; José Neto 001; Dimitri Watel (Discret. Appl. Math., 2024)

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. - Julien Baste; Dimitri Watel (Theor. Comput. Sci., 2024)

Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies. - Dominique Barth; Thierry Mautor; Dimitri Watel; Marc-Antoine Weisser (J. Glob. Optim., 2024)

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, 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)