Publications

Benoit Darties, Nicolas Champseix, Annie Château, 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〉

Benoit Darties, Annie Château, Rodolphe Giroudeau, Mathias Weller. Improved Complexity for Power Edge Set Problem. IWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. 28th International Workshop on Combinatorial Algorithms, 2017, 〈https://carma.newcastle.edu.au/meetings/iwoca/〉. 〈hal-01715909〉

Benoit Darties, Annie Château, Rodolphe Giroudeau, Mathias Weller. New Insights for Power Edge Set Problem. X. Gao; H. Du; M. Han. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. Springer, 11th International Conference on Combinatorial Optimization and Applications, LNCS (10627), pp.180-194, 2017, Part I. 〈10.1007/978-3-319-71150-8_17〉. 〈lirmm-01672895〉

Annie Château, 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. 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 2017. 〈hal-01516931〉