Darties, Benoit
236  results:
Search for persons X
?
2

Proof of Experience: empowering Proof of Work protocol with..:

, In: 2020 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS),
 
?
3

The Balanced Connected Subgraph Problem: Complexity Results..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,
 
?
4

Power Edge Set and Zero Forcing Set Remain Difficult in Cub..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Cazals, Pierre ; Darties, Benoit ; Chateau, Annie.. - p. 122-135 , 2019
 
?
 
?
8

Priority levels based multi-hop broadcasting method for veh..:

Abdou, Wahabou ; Darties, Benoît ; Mbarek, Nader
annals of telecommunications - annales des télécommunications.  70 (2015)  7-8 - p. 359-368 , 2015
 
?
10

A Restricted-Weakly Connected Dominating Set for Role Assig..:

, In: 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications,
 
?
11

Original Broadcasting Technique in Radio Networks:

, In: Proceedings of the 2005 ACM conference on Emerging network experiment and technology,
Darties, Benoît - p. 238-239 , 2005
 
?
12

The mv-decomposition: definition and application to the dis..:

, In: Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008; IFIP International Federation for Information Processing,
 
?
13

Complexity and inapproximability results for balanced conne..:

Martinod, Timothée ; Pollet, Valentin ; Darties, Benoit..
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2021.07.010.  , 2021
 
?
14

Complexity and inapproximability results for balanced conne..:

Martinod, Timothée ; Pollet, Valentin ; Darties, Benoit..
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2021.07.010.  , 2021
 
?
15

Complexity and inapproximability results for balanced conne..:

Martinod, Timothée ; Pollet, Valentin ; Darties, Benoit..
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2021.07.010.  , 2021
 
1-15