- 9
- 7
- 1
- 1
- 1
Rodolphe Giroudeau
19
Documents
Identifiants chercheurs
- rodolphe-giroudeau
- IdRef : 095605355
Présentation
Publications
- 9
- 3
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 19
- 11
- 9
- 5
- 5
- 3
- 3
- 2
- 1
- 1
- 1
- 18
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 3
- 2
- 3
- 1
- 2
- 1
- 1
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⟩
Communication dans un congrès
lirmm-02454914v1
|
|
|
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
Communication dans un congrès
hal-02025384v1
|
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⟩
Communication dans un congrès
hal-02359076v1
|
|
|
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
Communication dans un congrès
hal-01516931v1
|
|
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⟩
Communication dans un congrès
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⟩
Communication dans un congrès
lirmm-01672895v1
|
|
|
Bounds and approximation results for scheduling coupled-tasks with compatibility constraintsPMS: Project Management and Scheduling, Apr 2016, Valencia, Spain. pp.94-97
Communication dans un congrès
lirmm-01313722v1
|
|
Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problemBPPC: Bin Packing and Placement Constraints, May 2014, Cork, Ireland
Communication dans un congrès
hal-01005429v1
|
|
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⟩
Communication dans un congrès
hal-00981164v1
|
|
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
Communication dans un congrès
hal-00612821v1
|
|
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
Communication dans un congrès
lirmm-00355050v1
|
|
Ricochet Robots game: complexity analysis Technical Report2019
Pré-publication, Document de travail
hal-02191102v1
|