Original Broadcasting Technique in Radio Networks. - Benoît Darties (CoNEXT, 2005)

Problèmes algorithmiques et de complexité dans les réseaux sans fil. (Algorithmic and Complexity Problems in wireless Networks). - Benoît Darties (2007)

Request Satisfaction Problem in Synchronous Radio Networks. - Benoît Darties; Sylvain Durand; Jérôme Palaysi (ADHOC-NOW, 2008)

The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. - Olivier Cogis; Benoît Darties; Sylvain Durand; Jean-Claude König; Geneviève Simonet (IFIP TCS, 2008)

Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks. - Fabrice Theoleyre; Benoît Darties; Andrzej Duda (ICCCN, 2009)

A divide-and-conquer scheme for assigning roles in multi-channel wireless mesh networks. - Benoît Darties; Fabrice Theoleyre; Andrzej Duda (LCN, 2009)

A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network. - Benoît Darties; Fabrice Theoleyre; Andrzej Duda (WiMob, 2009)

Capacity and Energy-Consumption Optimization for the Cluster-Tree Topology in IEEE 802.15.4. - Fabrice Theoleyre; Benoît Darties (IEEE Commun. Lett., 2011)

Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. - Gilles Simonin; Benoît Darties; Rodolphe Giroudeau; Jean-Claude König (J. Sched., 2011)

Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. - Gilles Simonin; Rodolphe Giroudeau; Benoît Darties; Jean-Claude König (Algorithmic Oper. Res., 2012)

Approximation algorithm for constrained coupled-tasks scheduling problem. - Gilles Simonin; Benoît Darties; Jean-Claude König; Rodolphe Giroudeau (CoDIT, 2014)

A novel multi-hop broadcasting method for VANETs based on autonomic computing paradigm. - Wahabou Abdou; Benoît Darties; Nader Mbarek (COMNET, 2014)

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. - Benoît Darties; Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König (ISCO, 2014)

Priority levels based multi-hop broadcasting method for vehicular ad hoc networks. - Wahabou Abdou; Benoît Darties; Nader Mbarek (Ann. des Télécommunications, 2015)

An autonomic message dissemination protocol for Vehicular Ad hoc Networks: a density and priority levels aware approach. - Wahabou Abdou; Benoît Darties; Nader Mbarek (Wirel. Networks, 2015)

Some complexity and approximation results for coupled-tasks scheduling problem according to topology. - Benoît Darties; Rodolphe Giroudeau; Jean-Claude König; Gilles Simonin (RAIRO Oper. Res., 2016)

New Insights for Power Edge Set Problem. - Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (COCOA (1), 2017)

Improved Complexity for Power Edge Set Problem. - Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (IWOCA, 2017)

Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. - Axel Moinet; Benoît Darties; Nicolas Gastineau; Jean-Luc Baril; Olivier Togni (WiMob, 2017)

Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. - Rodolphe Giroudeau; Jean-Claude König; Benoît Darties; Gilles Simonin (CoRR, 2017)

Blockchain based trust & authentication for decentralized sensor networks. - Axel Moinet; Benoît Darties; Jean-Luc Baril (CoRR, 2017)

Completely independent spanning trees in some regular graphs. - Benoît Darties; Nicolas Gastineau; Olivier Togni (Discret. Appl. Math., 2017)

BATMAN : plate-forme blockchain pour l'authentification et la confiance dans les WSNs. - Axel Moinet; Benoît Darties; Jean-Luc Baril (CoRR, 2018)

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees. - Benoît Darties; Nicolas Gastineau; Olivier Togni (Discret. Appl. Math., 2018)

Complexity and lowers bounds for Power Edge Set Problem. - Benoît Darties; Nicolas Champseix; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (J. Discrete Algorithms, 2018)

The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. - Benoît Darties; Rodolphe Giroudeau; Jean-Claude König; Valentin Pollet (COCOA, 2019)

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. - Pierre Cazals; Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (IWOCA, 2019)

Proof of Experience: empowering Proof of Work protocol with miner previous work. - Samuel Masseport; Benoît Darties; Rodolphe Giroudeau; Jorick Lartigau (BRAINS, 2020)

Proof of usage: user-centric consensus for data provision and exchange. - Samuel Masseport; Jorick Lartigau; Benoît Darties; Rodolphe Giroudeau (Ann. des Télécommunications, 2020)

Complexity and inapproximability results for balanced connected subgraph problem. - Timothée Martinod; Valentin Pollet; Benoît Darties; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2021)

Indoor Navigation: Navmesh Applied to Indoor Graph Creation. - Maxime Callico; Rodolphe Giroudeau; Benoît Darties; Jean Carrière (ICORES, 2025)