Publications

Benoit Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Complexity and lowers bounds for Power Edge Set Problem. Journal of Discrete Algorithms, Elsevier, 2018, 52-53, pp.70-91. ⟨10.1016/j.jda.2018.11.006⟩. ⟨lirmm-01950398⟩

Pierre Cazals, Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. 30th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2019, Pisa, Italy. pp.122-135, ⟨10.1007/978-3-030-25005-8_11⟩. ⟨hal-02359076⟩

Annie Chateau, Benoit Darties, Rodolphe Giroudeau, Mathias Weller. Surveiller un réseau électrique en plaçant des dispositifs sur ses liens : un problème difficile. AlgoTel: Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France. ⟨hal-01516931⟩

Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Improved Complexity for Power Edge Set Problem. IWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.128-141, ⟨10.1007/978-3-319-78825-8_11⟩. ⟨hal-01715909⟩

Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. New Insights for Power Edge Set Problem. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.180-194, ⟨10.1007/978-3-319-71150-8_17⟩. ⟨lirmm-01672895⟩