Dimitri Watel

Available identifiers

Publication	Date of Publication	Type
The no-meet matroid	2024-06-20	Paper
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies	2024-05-06	Paper
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth	2024-02-20	Paper
A polynomial algorithm for deciding the validity of an electrical distribution tree	2022-04-07	Paper
Optimisation of electrical network configuration: complexity and algorithms for ring topologies	2021-02-15	Paper
Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network	2020-09-04	Paper
Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive	2018-09-24	Paper
Parameterized complexity and approximability of coverability problems in weighted Petri nets	2018-08-20	Paper
Adaptive Network Flow with $k$-Arc Destruction	2017-11-02	Paper
The Maximum Matrix Contraction Problem	2016-11-30	Paper
Directed Steiner trees with diffusion costs	2016-11-29	Paper
A practical greedy approximation for the directed Steiner tree problem	2016-11-29	Paper
A Practical Greedy Approximation for the Directed Steiner Tree Problem	2015-09-11	Paper
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes	2014-12-09	Paper
Directed Steiner Tree with Branching Constraint	2014-09-26	Paper
Steiner Problems with Limited Number of Branching Nodes	2013-12-17	Paper

This page was built for person: Dimitri Watel