Number of documents

52

Publications


Journal articles9 documents

  • 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⟩
  • 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. Completely independent spanning trees in some regular graphs. Discrete Applied Mathematics, Elsevier, 2017, 217, pp.163 - 174. ⟨http://www.sciencedirect.com/science/article/pii/S0166218X16303997⟩. ⟨10.1016/j.dam.2016.09.007⟩. ⟨hal-01469367⟩
  • Benoit Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin. Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO - Operations Research, EDP Sciences, 2016, 50, pp.781-795. ⟨10.1051/ro/2016034⟩. ⟨hal-01533981⟩
  • Wahabou Abdou, Benoit Darties, Nader Mbarek. Priority Levels Based Multi-hop Broadcasting Method for Vehicular Ad hoc Networks. Annals of Telecommunications - annales des télécommunications, Springer, 2015, pp.1-10. ⟨10.1007/s12243-015-0456-9⟩. ⟨hal-01129873⟩
  • Wahabou Abdou, Benoit Darties, Nader Mbarek. An autonomic message dissemination protocol for Vehicular Ad hoc Networks: a density and priority levels aware approach. Wireless Networks, Springer Verlag, 2014, 20 (8), ⟨http://link.springer.com/⟩. ⟨10.1007/s11276-014-0831-x⟩. ⟨hal-01081283⟩
  • Rodolphe Giroudeau, Benoit Darties, Jean-Claude König, Gilles Simonin. Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. Algorithmic Operations Research, Preeminent Academic Facets, 2012, 7 (1), pp.1-12. ⟨lirmm-00715828⟩
  • Fabrice Theoleyre, Benoit Darties. Capacity and Energy-Consumption Optimization for the Cluster-Tree Topology in IEEE 802.15.4. IEEE Communications Letters, Institute of Electrical and Electronics Engineers, 2011, 15 (8), pp.816-818. ⟨hal-00923365⟩
  • Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. Journal of Scheduling, Springer Verlag, 2011, 14 (5), pp.501-509. ⟨10.1007/s10951-010-0193-x⟩. ⟨hal-00612822v2⟩

Conference papers32 documents

  • Samuel Masseport, Jorick Lartigau, Benoit Darties, Rodolphe Giroudeau. Proof of Usage: User-centric consensus for data provision and exchange. BRAINS: Blockchain, Robotics and AI for Networking Security, Mar 2019, Rio De Janerio, Brazil. ⟨hal-02025384⟩
  • 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⟩
  • Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. New Insights for Power Edge Set Problem. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.180-194, ⟨10.1007/978-3-319-71150-8_17⟩. ⟨lirmm-01672895⟩
  • Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Improved Complexity for Power Edge Set Problem. IWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.128-141, ⟨10.1007/978-3-319-78825-8_11⟩. ⟨hal-01715909⟩
  • Axel Moinet, Benoit Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni. Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. 2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Oct 2017, Rome, Italy. ⟨10.1109/WiMOB.2017.8115791⟩. ⟨hal-01715916⟩
  • Annie Chateau, Benoit Darties, Rodolphe Giroudeau, Mathias Weller. Surveiller un réseau électrique en plaçant des dispositifs sur ses liens : un problème difficile. AlgoTel: Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France. ⟨hal-01516931⟩
  • Julien Dubois, Axel Moinet, Serge Bobbia, Roberto Marroquin, Barthélémy Heyrman, et al.. WiseEye: A Platform to Manage and Experiment on Smart Camera Networks. 5th Workshop on Architecture of Smart Cameras (WASC), Jul 2016, Dijon, France. ⟨hal-01342808⟩
  • Rodolphe Giroudeau, Jean-Claude König, Benoit Darties, Gilles Simonin. Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. PMS: Project Management and Scheduling, Apr 2016, Valencia, Spain. pp.94-97. ⟨lirmm-01313722⟩
  • Benoit Darties, Nicolas Gastineau, Olivier Togni. Almost disjoint spanning trees. Bordeaux Graph Workshop BGW, Nov 2016, Bordeaux, France. ⟨hal-01451683⟩
  • Serge Bobbia, Julien Dubois, Christophe Nicolle, Axel Moinet, Benoit Darties. A New Development Framework for Multi-Core Processor based Smart-Camera Implementations. Workshop on Architecture of Smart Cameras (WASC), Jun 2015, Santiago de Compostela, Spain. ⟨hal-01231821⟩
  • Nicolas Gastineau, Benoit Darties, Olivier Togni. Arbres couvrants presque disjoints. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. ⟨hal-01148458⟩
  • Nicolas Gastineau, Benoit Darties, Olivier Togni. Recherche d'arbres couvrants complètement indépendants dans des graphes réguliers. ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1--4. ⟨hal-00986223⟩
  • Wahabou Abdou, Benoit Darties, Nader Mbarek. A Novel Multi-hop Broadcasting Method for VANETs Based on Autonomic Computing Paradigm. The fourth International Conference on Communications and Networking, ComNet'2014, Mar 2014, Hammamet, Tunisia. ⟨hal-00965840⟩
  • Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem. BPPC: Bin Packing and Placement Constraints, May 2014, Cork, Ireland. ⟨hal-01005429⟩
  • Benoit Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO: International Symposium on Combinatorial Optimization, Mar 2014, Lisbon, Portugal. pp.161-172, ⟨10.1007/978-3-319-09174-7_14⟩. ⟨hal-00981164⟩
  • Wahabou Abdou, Nader Mbarek, Benoit Darties. Gestion autonome des communications dans les réseaux ad hoc de véhicules : cas de la diffusion. JNCT 2013 : Journées Nationales des Communications dans les Transports, May 2013, NEVERS, France. ⟨hal-00829854⟩
  • Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoit Darties. Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. ICAPS: International Conference on Automated Planning and Scheduling, Jun 2011, Freiburg, Germany. pp.218-225. ⟨hal-00612821⟩
  • Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Isomorphic Coupled-Task Scheduling Problem with Compatibility Constraints on a Single Processor. MISTA'2009: 4th Multidisciplinary International Scheduling Conference: Theory and Applications, Aug 2009, Dublin, Ireland. pp.378-388. ⟨lirmm-00355050⟩
  • Benoit Darties, Fabrice Theoleyre, Andrzej Duda. A Divide-and-Conquer Scheme for Assigning Roles in Multi-Channel Wireless Mesh Networks. IEEE Conference on Local Computer Networks (LCN), Oct 2009, Zurich, Switzerland. pp.0. ⟨hal-00401662v2⟩
  • Benoit Darties, Fabrice Theoleyre, Andrzej Duda. Algorithme distribué pour l'assignation de rôles dans Molecular MAC, une couche MAC multicanal. CFIP'2009, Oct 2009, Strasbourg, France. ⟨inria-00419467⟩
  • Benoit Darties, Fabrice Theoleyre, Andrzej Duda. A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2009, Morocco. pp.167-172. ⟨hal-00618338⟩
  • Fabrice Theoleyre, Benoit Darties, Andrzej Duda. Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks. International Conference on Computer Communications and Networks (ICCCN), 2009, United States. pp.10.1109/ICCCN.2009.5235224. ⟨hal-00618224⟩
  • Benoit Darties, Jérôme Palaysi, Sylvain Durand. Conception de réseaux radio multi-sauts robustes. ROADEF: Recherche Opérationnelle et d'Aide à la Décision, Feb 2008, Clermont-Ferrand, France. ⟨lirmm-00270152⟩
  • Benoit Darties, Sylvain Durand, Jérôme Palaysi. Request Satisfaction Problem in Synchronous Radio Networks. ADHOC-NOW: Ad-hoc, Mobile and Wireless Networks, Sep 2008, Sophia Antipolis, France. pp.451-462, ⟨10.1007/978-3-540-85209-4_36⟩. ⟨lirmm-00322362⟩
  • Benoit Darties, Olivier Cogis, 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. TCS: Theoretical Computer Science, Sep 2008, Milan, Italy. pp.115-126, ⟨10.1007/978-0-387-09680-3_8⟩. ⟨lirmm-00322361⟩
  • Benoit Darties, Olivier Cogis, Jean-Claude König, Geneviève Simonet, Sylvain Durand. La mv-décomposition : un nouvel algorithme pour la diffusion dans un réseau radio. AlgoTel: Aspects Algorithmiques des Télécommunications, May 2008, Saint-Malo, France. pp.93-96. ⟨lirmm-00286575⟩
  • Benoit Darties, Sylvain Durand, Jérôme Palaysi. Satisfaction de requêtes dans un réseau radio synchrone : NP-complétude dans les arbres. AlgoTel: Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.113-116. ⟨lirmm-00172311⟩
  • Benoit Darties, Sylvain Durand, Jérôme Palaysi. Robust Multihop Network Design. EURO XXII: 22nd European Conference on Operational Research, Jul 2007, Prague, Czech Republic. ⟨lirmm-00172270⟩
  • Benoit Darties, Sylvain Durand, Jérôme Palaysi. Satisfaction de requêtes dans un réseau radio synchrone : NP-Complétude dans les arbres. 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.113-116. ⟨inria-00176948⟩
  • Benoit Darties, Jérôme Palaysi. Satisfaction de requêtes par affectation de dates d'émission dans les réseaux radio. RenPar'17 : Rencontres francophones du Parallélisme (Perpi'2006), Oct 2006, Canet en Roussillon, France. pp.156-163. ⟨lirmm-00092254⟩
  • Olivier Cogis, Benoit Darties, Sylvain Durand, Jean-Claude König, Jérôme Palaysi. Contrôle de Routes par des Appareils de Surveillance (CRAS). AlgoTel: Aspects Algorithmiques des Télécommunications, May 2005, Presqu'île de Giens, France. ⟨lirmm-00106542⟩
  • Benoit Darties. Original Broadcasting Technique in Radio Networks. CoNEXT '05: Conference on Emerging Network Experiment and Technology, 2005, Toulouse, France. pp.238-239, ⟨10.1145/1095921.1095959⟩. ⟨lirmm-00177931⟩

Book sections2 documents

  • Nader Mbarek, Wahabou Abdou, Benoit Darties. Autonomic Computing and VANETs: Simulation of a QoS-based Communication Model. Benoit Hilt ; Marion Berbineau ; Alexey Vinel; Alain Pirovano. Networking simulation for intelligent transportation systems, ISTE Ltd/John Wiley and Sons Inc, Chapitre 10, 2017, 978-1-84821-853-6. ⟨http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848218532.html⟩. ⟨hal-01515785⟩
  • Mohamed Nazim Abdeddaim, Benoit Darties, Fabrice Theoleyre. Bandwidth and Energy Consumption Tradeoff for IEEE 802.15.4 in Multihop Topologies. Wireless Sensor Networks: Technology & Applications, Intech, pp.00-00, 2012, ⟨10.5772/48295⟩. ⟨hal-00923327⟩

Preprints, Working Papers, ...2 documents

  • Benoit Darties, Nicolas Gastineau, Olivier Togni. Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees. 2017. ⟨hal-01476364⟩
  • Benoit Darties, Nicolas Gastineau, Olivier Togni. Completely Independent Spanning Trees in Some Regular Graphs. 2014. ⟨hal-01066448⟩

Reports6 documents

  • Wahabou Abdou, Benoit Darties, Nader Mbarek. ADM : A Density And Priority Levels Aware Protocol For Broadcasting In Vehicular Ad-Hoc Networks. 2014. ⟨hal-00942849⟩
  • Benoit Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin. Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs. 2014. ⟨hal-00947519⟩
  • Benoit Darties, Fabrice Theoleyre, Andrzej Duda. A Divide-and-Conquer Scheme for Assigning Roles in Multi-Channel Wireless Mesh Networks. [Research Report] RR-LIG-004, LIG. 2010. ⟨hal-01353797⟩
  • Benoit Darties. Quelques résultats de complexité pour un problème de conception de réseaux radio multi-sauts robustes.. [Rapport de recherche] RR-07022, LIRMM. 2007. ⟨lirmm-00182422⟩
  • Benoit Darties. Diffusion dans les Réseaux Sans-Fil à Longueur d'Onde Unique. [Research Report] 05013, LIRMM. 2005. ⟨lirmm-00106679⟩
  • Olivier Cogis, Benoit Darties, Sylvain Durand, Jean-Claude König, Jérôme Palaysi. Contrôle de Routes par des Appareils de Surveillance (CRAS) - II. [Rapport de recherche] 05052, LIRMM. 2005. ⟨lirmm-00106694⟩

Theses1 document

  • Benoit Darties. Problèmes algorithmiques et de complexité dans les réseaux sans fil. Réseaux et télécommunications [cs.NI]. Université Montpellier II - Sciences et Techniques du Languedoc, 2007. Français. ⟨tel-00270118⟩