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⟩

Benoit Darties, Nicolas Gastineau, Olivier Togni. Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees. Discrete Applied Mathematics, Elsevier, 2018, 236, pp.124-136. ⟨10.1016/j.dam.2017.11.018⟩. ⟨hal-01715892⟩

Axel Moinet, Benoit Darties, Jean-Luc Baril. De l'existence d'arbres couvrants complètement disjoints dans les réseaux sans fil. ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France. ⟨hal-01784041⟩