default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenoît Darties
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j11]Timothée Martinod, Valentin Pollet, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Complexity and inapproximability results for balanced connected subgraph problem. Theor. Comput. Sci. 886: 69-83 (2021)- 2020
- [j10]Samuel Masseport, Jorick Lartigau, Benoît Darties, Rodolphe Giroudeau:
Proof of usage: user-centric consensus for data provision and exchange. Ann. des Télécommunications 75(3-4): 153-162 (2020) - [c16]Samuel Masseport, Benoît Darties, Rodolphe Giroudeau, Jorick Lartigau:
Proof of Experience: empowering Proof of Work protocol with miner previous work. BRAINS 2020: 57-58
2010 – 2019
- 2019
- [c15]Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. COCOA 2019: 449-460 - [c14]Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. IWOCA 2019: 122-135 - [e1]Benoît Darties, Michael Poss:
Proceedings of the 9th International Network Optimization Conference, INOC 2019, Avignon, France, June 12-14, 2019. OpenProceedings.org 2019, ISBN 978-3-89318-079-0 [contents] - 2018
- [j9]Benoît Darties, Nicolas Gastineau, Olivier Togni:
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees. Discret. Appl. Math. 236: 124-136 (2018) - [j8]Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms 52-53: 70-91 (2018) - [i9]Axel Moinet, Benoît Darties, Jean-Luc Baril:
BATMAN : plate-forme blockchain pour l'authentification et la confiance dans les WSNs. CoRR abs/1804.00610 (2018) - 2017
- [j7]Benoît Darties, Nicolas Gastineau, Olivier Togni
:
Completely independent spanning trees in some regular graphs. Discret. Appl. Math. 217: 163-174 (2017) - [c13]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Insights for Power Edge Set Problem. COCOA (1) 2017: 180-194 - [c12]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Improved Complexity for Power Edge Set Problem. IWOCA 2017: 128-141 - [c11]Axel Moinet, Benoît Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni:
Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. WiMob 2017: 63-70 - [i8]Benoît Darties, Nicolas Gastineau, Olivier Togni:
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees. CoRR abs/1702.08289 (2017) - [i7]Axel Moinet, Benoît Darties, Jean-Luc Baril:
Blockchain based trust & authentication for decentralized sensor networks. CoRR abs/1706.01730 (2017) - [i6]Wahabou Abdou, Benoît Darties, Nader Mbarek:
Priority Levels Based Multi-hop Broadcasting Method for Vehicular Ad hoc Networks. CoRR abs/1706.02198 (2017) - [i5]Rodolphe Giroudeau, Jean-Claude König, Benoît Darties, Gilles Simonin:
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. CoRR abs/1706.02200 (2017) - [i4]Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. CoRR abs/1706.02202 (2017) - [i3]Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin:
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. CoRR abs/1706.02214 (2017) - 2016
- [j6]Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin:
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO Oper. Res. 50(4-5): 781-795 (2016) - 2015
- [j5]Wahabou Abdou, Benoît Darties, Nader Mbarek:
Priority levels based multi-hop broadcasting method for vehicular ad hoc networks. Ann. des Télécommunications 70(7-8): 359-368 (2015) - [j4]Wahabou Abdou, Benoît Darties, Nader Mbarek:
An autonomic message dissemination protocol for Vehicular Ad hoc Networks: a density and priority levels aware approach. Wirel. Networks 21(3): 1001-1014 (2015) - 2014
- [c10]Gilles Simonin, Benoît Darties, Jean-Claude König, Rodolphe Giroudeau:
Approximation algorithm for constrained coupled-tasks scheduling problem. CoDIT 2014: 110-112 - [c9]Wahabou Abdou, Benoît Darties, Nader Mbarek:
A novel multi-hop broadcasting method for VANETs based on autonomic computing paradigm. COMNET 2014: 1-5 - [c8]Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO 2014: 161-172 - [i2]Benoît Darties, Nicolas Gastineau, Olivier Togni:
Completely Independent Spanning Trees in Some Regular Graphs. CoRR abs/1409.6002 (2014) - 2012
- [j3]Gilles Simonin, Rodolphe Giroudeau, Benoît Darties, Jean-Claude König:
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. Algorithmic Oper. Res. 7(1): 1-12 (2012) - 2011
- [j2]Fabrice Theoleyre, Benoît Darties:
Capacity and Energy-Consumption Optimization for the Cluster-Tree Topology in IEEE 802.15.4. IEEE Commun. Lett. 15(8): 816-818 (2011) - [j1]Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Sched. 14(5): 501-509 (2011) - [c7]Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoît Darties:
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. ICAPS 2011
2000 – 2009
- 2009
- [c6]Fabrice Theoleyre, Benoît Darties, Andrzej Duda:
Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks. ICCCN 2009: 1-6 - [c5]Benoît Darties, Fabrice Theoleyre, Andrzej Duda:
A divide-and-conquer scheme for assigning roles in multi-channel wireless mesh networks. LCN 2009: 277-280 - [c4]Benoît Darties, Fabrice Theoleyre, Andrzej Duda:
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network. WiMob 2009: 167-172 - [i1]Benoît Darties, Fabrice Theoleyre, Andrzej Duda:
A Divide-and-Conquer Scheme for Assigning Roles in Multi-Channel Wireless Mesh Networks. CoRR abs/0907.0649 (2009) - 2008
- [c3]Benoît Darties, Sylvain Durand, Jérôme Palaysi:
Request Satisfaction Problem in Synchronous Radio Networks. ADHOC-NOW 2008: 451-462 - [c2]Olivier Cogis, Benoît Darties, Sylvain Durand, Jean-Claude König, Geneviève Simonet:
The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. IFIP TCS 2008: 115-126 - 2007
- [b1]Benoît Darties:
Problèmes algorithmiques et de complexité dans les réseaux sans fil. (Algorithmic and Complexity Problems in wireless Networks). Montpellier 2 University, France, 2007 - 2005
- [c1]Benoît Darties:
Original Broadcasting Technique in Radio Networks. CoNEXT 2005: 238-239
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
