Skip to Main content
Number of documents




Journal articles1 document

Conference papers4 documents

  • 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⟩
  • 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. 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⟩
  • Axel Moinet, Benoit Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni. Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. 2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Oct 2017, Rome, Italy. ⟨10.1109/WiMOB.2017.8115791⟩. ⟨hal-01715916⟩

Book sections1 document

  • Nader Mbarek, Wahabou Abdou, Benoit Darties. Autonomic Computing and VANETs: Simulation of a QoS-based Communication Model. Benoit Hilt ; Marion Berbineau ; Alexey Vinel; Alain Pirovano. Networking simulation for intelligent transportation systems, ISTE Ltd/John Wiley and Sons Inc, Chapitre 10, 2017, 978-1-84821-853-6. ⟨hal-01515785⟩

Preprints, Working Papers, ...1 document

  • Benoit Darties, Nicolas Gastineau, Olivier Togni. Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees. 2017. ⟨hal-01476364⟩