The following pages link to Dimitri Watel (Q346488):
Displaying 14 items.
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Parameterized complexity and approximability of coverability problems in weighted Petri nets (Q1662545) (← links)
- Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
- A polynomial algorithm for deciding the validity of an electrical distribution tree (Q2122795) (← links)
- Optimisation of electrical network configuration: complexity and algorithms for ring topologies (Q2227500) (← links)
- The Maximum Matrix Contraction Problem (Q2835698) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Directed Steiner Tree with Branching Constraint (Q2920465) (← links)
- A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
- Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network (Q5119373) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
- Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies (Q6497049) (← links)
