- 22
- 10
- 9
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
BD
Benoît Darties
58
Documents
Presentation
Publications
- 19
- 15
- 9
- 9
- 8
- 8
- 7
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 3
- 7
- 4
- 3
- 8
- 1
- 2
- 3
- 1
- 5
- 4
- 5
- 1
- 4
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic GraphsIWOCA 2019 - 30th International Workshop on Combinatorial Algorithms, Jul 2019, Pisa, Italy. pp.122-135, ⟨10.1007/978-3-030-25005-8_11⟩
Conference papers
hal-02359076v1
|
|
|
Proof of Usage: User-centric consensus for data provision and exchangeBRAINS 2019 - 1st Blockchain, Robotics and AI for Networking Security Conference, Mar 2019, Rio De Janerio, Brazil
Conference papers
hal-02025384v1
|
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter GraphsCOCOA 2019 - 13th International Conference on Combinatorial Optimization and Applications, Dec 2019, Xiamen, China. pp.449-460, ⟨10.1007/978-3-030-36412-0_36⟩
Conference papers
lirmm-02454914v1
|
|
|
De l'existence d'arbres couvrants complètement disjoints dans les réseaux sans filALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France
Conference papers
hal-01784041v1
|
|
Completely independent spanning trees for enhancing the robustness in ad-hoc Networks2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Oct 2017, Rome, Italy. ⟨10.1109/WiMOB.2017.8115791⟩
Conference papers
hal-01715916v1
|
|
Improved Complexity for Power Edge Set ProblemIWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.128-141, ⟨10.1007/978-3-319-78825-8_11⟩
Conference papers
hal-01715909v1
|
New Insights for Power Edge Set ProblemCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.180-194, ⟨10.1007/978-3-319-71150-8_17⟩
Conference papers
lirmm-01672895v1
|
|
|
Surveiller un réseau électrique en plaçant des dispositifs sur ses liens : un problème difficileAlgoTel: Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Conference papers
hal-01516931v1
|
|
Bounds and approximation results for scheduling coupled-tasks with compatibility constraintsPMS: Project Management and Scheduling, Apr 2016, Valencia, Spain. pp.94-97
Conference papers
lirmm-01313722v1
|
WiseEye: A Platform to Manage and Experiment on Smart Camera Networks 5th Workshop on Architecture of Smart Cameras (WASC), Jul 2016, Dijon, France
Conference papers
hal-01342808v1
|
|
|
Almost disjoint spanning treesBordeaux Graph Workshop BGW, Nov 2016, Bordeaux, France
Conference papers
hal-01451683v1
|
|
Arbres couvrants presque disjointsALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Conference papers
hal-01148458v1
|
|
A New Development Framework for Multi-Core Processor based Smart-Camera ImplementationsWorkshop on Architecture of Smart Cameras (WASC), Jun 2015, Santiago de Compostela, Spain
Conference papers
hal-01231821v1
|
|
Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problemBPPC: Bin Packing and Placement Constraints, May 2014, Cork, Ireland
Conference papers
hal-01005429v1
|
|
Recherche d'arbres couvrants complètement indépendants dans des graphes réguliersALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1--4
Conference papers
hal-00986223v1
|
A Novel Multi-hop Broadcasting Method for VANETs Based on Autonomic Computing ParadigmThe fourth International Conference on Communications and Networking, ComNet'2014, Mar 2014, Hammamet, Tunisia
Conference papers
hal-00965840v1
|
|
|
Coupled-Tasks in Presence of Bipartite Compatibilities GraphsISCO: International Symposium on Combinatorial Optimization, Mar 2014, Lisbon, Portugal. pp.161-172, ⟨10.1007/978-3-319-09174-7_14⟩
Conference papers
hal-00981164v1
|
Gestion autonome des communications dans les réseaux ad hoc de véhicules : cas de la diffusionJNCT 2013 : Journées Nationales des Communications dans les Transports, May 2013, NEVERS, France
Conference papers
hal-00829854v1
|
|
|
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility GraphICAPS: International Conference on Automated Planning and Scheduling, Jun 2011, Freiburg, Germany. pp.218-225
Conference papers
hal-00612821v1
|
|
Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh NetworksInternational Conference on Computer Communications and Networks (ICCCN), 2009, United States. pp.10.1109/ICCCN.2009.5235224
Conference papers
hal-00618224v1
|
|
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh NetworkIEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2009, Morocco. pp.167-172
Conference papers
hal-00618338v1
|
|
A Divide-and-Conquer Scheme for Assigning Roles in Multi-Channel Wireless Mesh NetworksIEEE Conference on Local Computer Networks (LCN), Oct 2009, Zurich, Switzerland. pp.0
Conference papers
hal-00401662v2
|
|
Algorithme distribué pour l'assignation de rôles dans Molecular MAC, une couche MAC multicanalCFIP'2009, Oct 2009, Strasbourg, France
Conference papers
inria-00419467v1
|
|
Isomorphic Coupled-Task Scheduling Problem with Compatibility Constraints on a Single ProcessorMISTA'2009: 4th Multidisciplinary International Scheduling Conference: Theory and Applications, Aug 2009, Dublin, Ireland. pp.378-388
Conference papers
lirmm-00355050v1
|
|
Conception de réseaux radio multi-sauts robustesROADEF: Recherche Opérationnelle et d'Aide à la Décision, Feb 2008, Clermont-Ferrand, France
Conference papers
lirmm-00270152v1
|
|
Request Satisfaction Problem in Synchronous Radio NetworksADHOC-NOW: Ad-hoc, Mobile and Wireless Networks, Sep 2008, Sophia Antipolis, France. pp.451-462, ⟨10.1007/978-3-540-85209-4_36⟩
Conference papers
lirmm-00322362v1
|
|
The MV-Decomposition: Definition and Application to the Distance-2 Broadcast Problem in Multi-Hops Radio NetworksTCS: Theoretical Computer Science, Sep 2008, Milan, Italy. pp.115-126, ⟨10.1007/978-0-387-09680-3_8⟩
Conference papers
lirmm-00322361v1
|
|
La mv-décomposition : un nouvel algorithme pour la diffusion dans un réseau radioAlgoTel: Aspects Algorithmiques des Télécommunications, May 2008, Saint-Malo, France. pp.93-96
Conference papers
lirmm-00286575v1
|
Robust Multihop Network DesignEURO XXII: 22nd European Conference on Operational Research, Jul 2007, Prague, Czech Republic
Conference papers
lirmm-00172270v1
|
|
|
Satisfaction de requêtes dans un réseau radio synchrone : NP-Complétude dans les arbres9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.113-116
Conference papers
inria-00176948v1
|
|
Satisfaction de requêtes dans un réseau radio synchrone : NP-complétude dans les arbresAlgoTel: Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.113-116
Conference papers
lirmm-00172311v1
|
|
Satisfaction de requêtes par affectation de dates d'émission dans les réseaux radioRenPar'17 : Rencontres francophones du Parallélisme (Perpi'2006), Oct 2006, Canet en Roussillon, France. pp.156-163
Conference papers
lirmm-00092254v1
|
|
Contrôle de Routes par des Appareils de Surveillance (CRAS)AlgoTel: Aspects Algorithmiques des Télécommunications, May 2005, Presqu'île de Giens, France
Conference papers
lirmm-00106542v1
|
|
Original Broadcasting Technique in Radio NetworksCoNEXT '05: Conference on Emerging Network Experiment and Technology, 2005, Toulouse, France. pp.238-239, ⟨10.1145/1095921.1095959⟩
Conference papers
lirmm-00177931v1
|
|
Network Optimization INOC 2019OpenProceedings, 2019, 978-3-89318-079-0. ⟨10.5441/002/inoc.2019.01⟩
Books
lirmm-02194269v1
|
Autonomic Computing and VANETsBenoit 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
Book sections
hal-01515785v1
|
|
|
Bandwidth and Energy Consumption Tradeoff for IEEE 802.15.4 in Multihop TopologiesWireless Sensor Networks: Technology & Applications, Intech, pp.00-00, 2012, ⟨10.5772/48295⟩
Book sections
hal-00923327v1
|
|
Ricochet Robots game: complexity analysis Technical Report2019
Preprints, Working Papers, ...
hal-02191102v1
|
|
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees2017
Preprints, Working Papers, ...
hal-01476364v1
|
|
Completely Independent Spanning Trees in Some Regular Graphs2014
Preprints, Working Papers, ...
hal-01066448v1
|
|
Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs2014
Reports
hal-00947519v1
|
|
ADM : A Density And Priority Levels Aware Protocol For Broadcasting In Vehicular Ad-Hoc Networks2014
Reports
hal-00942849v1
|
|
A Divide-and-Conquer Scheme for Assigning Roles in Multi-Channel Wireless Mesh Networks[Research Report] RR-LIG-004, LIG. 2010
Reports
hal-01353797v1
|
|
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
Reports
lirmm-00182422v1
|
|
Diffusion dans les Réseaux Sans-Fil à Longueur d'Onde Unique[Research Report] 05013, LIRMM. 2005
Reports
lirmm-00106679v1
|
|
Contrôle de Routes par des Appareils de Surveillance (CRAS) - II[Rapport de recherche] 05052, LIRMM. 2005
Reports
lirmm-00106694v1
|
|
Problèmes algorithmiques et de complexité dans les réseaux sans filRéseaux et télécommunications [cs.NI]. Université Montpellier II - Sciences et Techniques du Languedoc, 2007. Français. ⟨NNT : ⟩
Theses
tel-00270118v1
|