Number of documents

15

Publications


Rodolphe Giroudeau   

Journal articles4 documents

  • 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, 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⟩
  • 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⟩
  • 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 papers9 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩

Preprints, Working Papers, ...1 document

  • Samuel Masseport, Benoit Darties, Rodolphe Giroudeau, Jorick Lartigau. Ricochet Robots game: complexity analysis Technical Report. 2019. ⟨hal-02191102⟩

Reports1 document

  • 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⟩