Benoît Darties

Orcid: 0000-0002-9492-8613

According to our database1, Benoît Darties authored at least 30 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Complexity and inapproximability results for balanced connected subgraph problem.
Theor. Comput. Sci., 2021

2020
Proof of usage: user-centric consensus for data provision and exchange.
Ann. des Télécommunications, 2020

Proof of Experience: empowering Proof of Work protocol with miner previous work.
Proceedings of the 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services, 2020

2019
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Complexity and lowers bounds for Power Edge Set Problem.
J. Discrete Algorithms, 2018

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees.
Discret. Appl. Math., 2018

BATMAN : plate-forme blockchain pour l'authentification et la confiance dans les WSNs.
CoRR, 2018

2017
Completely independent spanning trees in some regular graphs.
Discret. Appl. Math., 2017

Blockchain based trust & authentication for decentralized sensor networks.
CoRR, 2017

Bounds and approximation results for scheduling coupled-tasks with compatibility constraints.
CoRR, 2017

Completely independent spanning trees for enhancing the robustness in ad-hoc Networks.
Proceedings of the 13th IEEE International Conference on Wireless and Mobile Computing, 2017

Improved Complexity for Power Edge Set Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

New Insights for Power Edge Set Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Some complexity and approximation results for coupled-tasks scheduling problem according to topology.
RAIRO Oper. Res., 2016

2015
An autonomic message dissemination protocol for Vehicular Ad hoc Networks: a density and priority levels aware approach.
Wirel. Networks, 2015

Priority levels based multi-hop broadcasting method for vehicular ad hoc networks.
Ann. des Télécommunications, 2015

2014
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

A novel multi-hop broadcasting method for VANETs based on autonomic computing paradigm.
Proceedings of the Fourth International Conference on Communications and Networking, 2014

Approximation algorithm for constrained coupled-tasks scheduling problem.
Proceedings of the International Conference on Control, 2014

2012
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph.
Algorithmic Oper. Res., 2012

2011
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor.
J. Sched., 2011

Capacity and Energy-Consumption Optimization for the Cluster-Tree Topology in IEEE 802.15.4.
IEEE Commun. Lett., 2011

2009
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network.
Proceedings of the 5th IEEE International Conference on Wireless and Mobile Computing, 2009

A divide-and-conquer scheme for assigning roles in multi-channel wireless mesh networks.
Proceedings of the 34th Annual IEEE Conference on Local Computer Networks, 2009

Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks.
Proceedings of the 18th International Conference on Computer Communications and Networks, 2009

2008
The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Request Satisfaction Problem in Synchronous Radio Networks.
Proceedings of the Ad-hoc, Mobile and Wireless Networks, 7th International Conference, 2008

2007
Problèmes algorithmiques et de complexité dans les réseaux sans fil. (Algorithmic and Complexity Problems in wireless Networks).
PhD thesis, 2007

2005
Original Broadcasting Technique in Radio Networks.
Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, 2005


  Loading...