Keywords

Researcher identifiers

  • IdHAL : rodolphe-giroudeau
Number of documents

101

publications of giroudeau rodolphe


Journal articles27 documents

  • Stéphane Bessy, Rodolphe Giroudeau. Parameterized complexity of a coupled-task scheduling problem. Journal of Scheduling, Springer Verlag, 2019, 22 (3), pp.305-313. ⟨10.1007/s10951-018-0581-1⟩. ⟨lirmm-02133404⟩
  • Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau. Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica, Springer Verlag, 2018, 80 (6), pp.1771-1803. ⟨10.1007/s00453-018-0405-x⟩. ⟨hal-01833303⟩
  • 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⟩
  • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. Approximability and exact resolution of the multidimensional binary vector assignment problem. Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.1059-1073. ⟨10.1007/s10878-018-0276-8⟩. ⟨lirmm-01922494⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. On Residual Approximation in Solution Extension Problems. Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (4), pp.1195-1220. ⟨10.1007/s10878-017-0202-5⟩. ⟨lirmm-01889394⟩
  • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2017, FCT '15, 19 (4), ⟨10.23638/DMTCS-19-4-3⟩. ⟨lirmm-01889400⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the sparsest $k$-subgraph in chordal graph. Theory of Computing Systems, Springer Verlag, 2016, 58 (1), pp.111-132. ⟨10.1007/s00224-014-9568-2⟩. ⟨lirmm-01383119⟩
  • Florent Hernandez, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud. Branch-and-price algorithms for the solution of the Multi-Trip Vehicle Routing Problem with Time Windows. European Journal of Operational Research, Elsevier, 2016, 249 (2), pp.551-559. ⟨10.1016/j.ejor.2015.08.040⟩. ⟨emse-01186966⟩
  • 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⟩
  • Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau. On the complexity of Wafer-to-Wafer Integration. Discrete Optimization, Elsevier, 2016, 22 (part B), pp.255-269. ⟨10.1016/j.disopt.2016.07.001⟩. ⟨lirmm-01378579⟩
  • Annie Chateau, Rodolphe Giroudeau. A complexity and approximation framework for the maximization scaffolding problem. Theoretical Computer Science, Elsevier, 2015, 595, pp.92-106. ⟨10.1016/j.tcs.2015.06.023⟩. ⟨lirmm-01219622⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau. Exact approaches for scaffolding. BMC Bioinformatics, BioMed Central, 2015, pp.S2. ⟨10.1186/1471-2105-16-S14-S2⟩. ⟨lirmm-01219627⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. On the sum-max graph partitioning problem. Theoretical Computer Science, Elsevier, 2014, Combinatorial Optimization: Theory of algorithms and Complexity, 540, pp.143-155. ⟨10.1016/j.tcs.2013.11.024⟩. ⟨lirmm-01251016⟩
  • Rodolphe Giroudeau, Dominique Feillet, Florent Hernandez, Olivier Naud. A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2014, 12 (3), pp.235-259. ⟨10.1007/s10288-013-0238-z⟩. ⟨lirmm-01056150⟩
  • Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin. Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks. International Journal of Planning and Scheduling, Inderscience, 2013, 1 (en cours de publication) (4), pp.285-300. ⟨lirmm-00952599⟩
  • Rodolphe Giroudeau, Jean-Claude König, Vincent Boudet, Joanne Cohen. Scheduling in the Presence of Processor Networks: Complexity and Approximation. RAIRO - Operations Research, EDP Sciences, 2012, 46, pp.1-22. ⟨10.1051/ro/2012005⟩. ⟨lirmm-00697219⟩
  • 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⟩
  • Marwane Bouznif, Rodolphe Giroudeau. Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. Advances in Operations Research, Hindawi Publishing Corporation, 2011, pp.20. ⟨10.1155/2011/476939⟩. ⟨lirmm-00605652⟩
  • 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⟩
  • Rodolphe Giroudeau, Jean-Claude König, Benoît Valery. Scheduling UET-Tasks on a Star Network: Complexity and Approximation. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2011, 9 (1), pp.29-48. ⟨10.1007/s10288-010-0127-7⟩. ⟨lirmm-00578530⟩
  • Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks. Electronic Notes in Discrete Mathematics, Elsevier, 2010, 36, pp.647-654. ⟨10.1016/j.endm.2010.05.082⟩. ⟨lirmm-00522993⟩
  • Olivier Naud, Tu Tuitete, Bertrand Léger, Arnaud Hélias, Rodolphe Giroudeau. Systèmes à événements discrets : de la simulation à l'analyse temporelle de la décision en agriculture. e-STA Sciences et Technologies de l’Automatique, SEE - Société de l'Electricité, de l'Electronique et des Technologies de l'Information et de la Communication 2008, 5 (2), pp.52-56. ⟨lirmm-00276716⟩
  • Rodolphe Giroudeau, Jean-Claude König, Jérôme Palaysi, Farida Moulai. Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays. Theoretical Computer Science, Elsevier, 2008, 401, pp.107-119. ⟨10.1016/j.tcs.2008.03.027⟩. ⟨lirmm-00289342⟩
  • Rodolphe Giroudeau, Jean-Claude König. General Scheduling Non-Approximability Results in Presence of Hierarchical Communications. European Journal of Operational Research, Elsevier, 2008, 184 (2), pp.441-457. ⟨lirmm-00276719⟩
  • Rodolphe Giroudeau. Seuil d'approximation pour le modèle UET-UCT en présence d'une infinité de processeurs : Une preuve alternative. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2008, 27 (5), pp.571-588. ⟨10.3166/tsi.27.571-588⟩. ⟨lirmm-00276718⟩
  • Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König. An Approximate Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. Theoretical Computer Science, Elsevier, 2003, 290 (3), pp.1883-1895. ⟨10.1016/S0304-3975(02)00328-6⟩. ⟨lirmm-00269765⟩
  • Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König. On the Hardness of Approximating the Precedence Constrained Multiprocessor Scheduling Problem with Hierarchical Communications. RAIRO - Operations Research, EDP Sciences, 2002, 36 (1), pp.21-36. ⟨lirmm-00268637⟩

Conference papers50 documents

  • Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. New Polynomial-Time Algorithm around the Scaffolding Problem. AlCoB: Algorithms for Computational Biology, May 2019, Berkeley, United States. pp.25-38, ⟨10.1007/978-3-030-18174-1_2⟩. ⟨lirmm-02047701⟩
  • Gabriel Volte, Chloé Desdouits, Rodolphe Giroudeau. The Workforce Routing and Scheduling Problem: solving real-world Instances. INOC: International Network Optimization Conference, Jun 2019, Avignon, France. pp.60-65, ⟨10.5441/002/inoc.2019.12⟩. ⟨lirmm-02193442⟩
  • 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⟩
  • Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA: Conference on Combinatorial Optimization and Applications, Sep 2018, Atlanta, GA, United States. pp.94-107, ⟨10.1007/978-3-030-04651-4_7⟩. ⟨lirmm-01900389v2⟩
  • Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. On the hardness of approximating Linearization of Scaffolds sharing Repeated Contigs. RECOMB-CG: Comparative Genomics, Oct 2018, Magog-Orford, QC, Canada. pp.91-107, ⟨10.1007/978-3-030-00834-5_5⟩. ⟨lirmm-01900395v2⟩
  • 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⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau. On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.509-517, ⟨10.1007/978-3-319-71147-8_38⟩. ⟨lirmm-01672893⟩
  • Eric Bourreau, Annie Chateau, Rodolphe Giroudeau, Clément Dallard. Une modélisation par Contrainte de graphe pour résoudre l’échafaudage de génome. ROADEF: Recherche Opérationnelle et Aide à la Décision, Feb 2017, Metz, France. ⟨lirmm-01875591⟩
  • Rodolphe Giroudeau, Michel Vasquez, Tamara Jovanovic. Lower bound on the logistic ratio objective function for bulk distribution inventory-routing problem. VeRoLog: Vehicle Routing and Logistics optimization, Jun 2016, Nantes, France. ⟨lirmm-01378572⟩
  • Rodolphe Giroudeau, Chloé Desduits, Mustafa Haouassi. Production scheduling with piecewise-linear energy costs. SSCI: Symposium Series on Computational Intelligence , Dec 2016, Athènes Greece. ⟨lirmm-01378518⟩
  • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. ISCO: International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. pp.148-159, ⟨10.1007/978-3-319-45587-7_13⟩. ⟨lirmm-01383110⟩
  • Eric Bourreau, Annie Chateau, Clément Dallard, Rodolphe Giroudeau. A Graph Constraints Formulation for Contigs Scaffolding. WCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2016, Toulouse, France. pp.136-149. ⟨lirmm-01360463⟩
  • 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⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. On Residual Approximation in Solution Extension Problems. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.463-476, ⟨10.1007/978-3-319-48749-6_34⟩. ⟨lirmm-01378581⟩
  • Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.294-308, ⟨10.1007/978-3-319-48749-6_22⟩. ⟨lirmm-01378584⟩
  • Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape. The sourcing problem: energy optimization of a multisource elevator. ICINCO: Informatics in Control, Automation and Robotics, Oleg Gusikhin; Dimitri Peaucelle; Kurosh Madani, Jul 2016, Lisbonne, Portugal. pp.19-30, ⟨10.5220/0005947600190030⟩. ⟨lirmm-01378569⟩
  • Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape. Certification under Uncertainties of Control Methods for Multi-Source Elevators. ISDA: Intelligent Systems Design and Applications, Dec 2016, Porto, Portugal. pp.154-164, ⟨10.1007/978-3-319-53480-0_16⟩. ⟨hal-01476039⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau. On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2015, Houston, United States. pp.409-423, ⟨10.1007/978-3-319-26626-8_30⟩. ⟨lirmm-01250982⟩
  • Marin Bougeret, Rodolphe Giroudeau, Guillerme Duvillié. On the complexity of flexible interval scheduling. MAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2015, La Roche-en-Ardenne, Belgium. ⟨lirmm-01251104⟩
  • Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau. On the Complexity of Wafer-to-Wafer Integration. CIAC: International Conference on Algorithms and Complexity, May 2015, Paris, France. pp.208-220, ⟨10.1007/978-3-319-18173-8_15⟩. ⟨lirmm-01250989⟩
  • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201, ⟨10.1007/978-3-319-22177-9_15⟩. ⟨lirmm-01250997⟩
  • 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⟩
  • Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant. Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM: Theory and Practice of Computer Science, Jan 2014, Nový Smokovec, Slovakia. pp.150-161, ⟨10.1007/978-3-319-04298-5_14⟩. ⟨lirmm-01251025⟩
  • Annie Chateau, Rodolphe Giroudeau. Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. AlCoB: Algorithms for Computational Biology, Jul 2014, Tarragona, Spain. pp.47-58, ⟨10.1007/978-3-319-07953-0_4⟩. ⟨lirmm-01007556⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest $k$-Subgraph in Chordal Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2013, Sophia Antipolis, France. pp.73-84, ⟨10.1007/978-3-319-08001-7_7⟩. ⟨lirmm-01283611⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. On the Approximability of the Sum-Max Graph Partitioning Problem. APEX: Approximation, Parameterized and EXact algorithms, Feb 2012, Paris, France. ⟨lirmm-00675888⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. Sum-Max Graph Partitioning Problem. ISCO: International Symposium on Combinatorial Optimization, Apr 2012, Athens, Greece. pp.297-308, ⟨10.1007/978-3-642-32147-4_27⟩. ⟨lirmm-00738554⟩
  • Rodolphe Giroudeau, Vincent Boudet, Marin Bougeret, Trivikram Dokka, Frits Spieksma. Approximation algorithms for the wafer to wafer integration problem. WAOA: Workshop on Approximation and Online Algorithms, Sep 2012, Ljubljana, Slovenia. pp.286-297. ⟨lirmm-00805063⟩
  • Rodolphe Giroudeau, Florent Hernandez, Michel Gendreau, Marie-Lise Flottes, Giorgio Di Natale, et al.. Circuits intégrés en 3D. ROADEF: Recherche Opérationnelle et Aide à la Décision, Apr 2012, Angers, France. ⟨lirmm-00805058⟩
  • Rodolphe Giroudeau, Florent Hernandez, Olivier Naud, Frédéric Semet. An Exact Method to Solve the Multi-Trip Vehicle Routing Problem with Multi Time Windows. ODYSSEUS, May 2012, Mykonos Island, Greece. pp.9-12. ⟨lirmm-00702137⟩
  • 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, Rodolphe Giroudeau, Jean-Claude König. Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks. PMS: Project Management and Scheduling, Apr 2010, Tours, France. pp.371-374. ⟨lirmm-00488279⟩
  • Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks. ISCO: International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.647-654. ⟨lirmm-00522986⟩
  • Rodolphe Giroudeau, Dominique Feillet, Florent Hernandez, Olivier Naud. An exact method to solve the Multi-Trip Vehicle Routing Problem with Time Windows and Limited Duration. TRISTAN VII'10: The Triennial Symposium on Transportation Analysis, Jun 2010, Tromso, Norway. pp.366-369. ⟨lirmm-00496041⟩
  • Gilles Simonin, Anne-Elisabeth Baert, Alain Jean-Marie, Rodolphe Giroudeau. Problème d'acquisition de données par une torpille. ROADEF'09 : Recherche Opérationnelle et d'Aide à la Décision, Feb 2009, Nancy, France. pp.179-180. ⟨lirmm-00354634⟩
  • 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⟩
  • Rodolphe Giroudeau, Jean-Claude König. Homogeneous versus hierarchical communication delay model. ASTEC'2009: Workshop/Summer school on Algorithms and Techniques for Scheduling on Clusters and Grids, Jun 2009, Faveyrolles, France. ⟨lirmm-00805056⟩
  • Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Complexity and approximation for scheduling problem for a torpedo. CIE'39: 39th International Conference on Computers & Industrial Engineering, Jul 2009, Troyes, France. pp.352-356. ⟨lirmm-00355052⟩
  • Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Extended Matching Problem for a Coupled-Tasks Scheduling Problem. TMFCS'09: International Conference on Theoretical and Mathematical Foundations of Computer Science, Jul 2009, Orlando, Florida, United States. pp.082-089. ⟨lirmm-00375000⟩
  • Florent Hernandez, Dominique Feillet, Rodolphe Giroudeau, Jean-Claude König, Olivier Naud. Multi-Trip Vehicule Routing Problem with Time Windows for Agricultural Tasks. ODYSSEUS'2009: 4th International Workshop on Freight Transportation and Logistics, May 2009, Çeşme, İzmir, Turkey. ⟨lirmm-00395324⟩
  • Florent Hernandez, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud, Jean-Claude König. Problème de tournées de véhicules avec routes multiples pour réaliser des traitements phytosanitaires. ROADEF'09 : Recherche Opérationnelle et d'Aide à la Décision, Feb 2009, Nancy, France. pp.5-6. ⟨lirmm-00370189⟩
  • Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Complexité et approximation pour un problème d'ordonnancement avec tâches couplées. RenPar'18 : Rencontres Francophones du Parallélisme, Feb 2008, Fribourg, Suisse. ⟨lirmm-00270792⟩
  • Rodolphe Giroudeau, Jean-Claude König. Approximations Algorithms: Application in Scheduling Problems. EPIT'07 : Ecole de Printemps en Informatique Théorique - Ordonnancement, 2007, Marseille, France. ⟨lirmm-00276720⟩
  • Olivier Naud, Tu Tuitete, Bertrand Léger, Arnaud Helias, Rodolphe Giroudeau. Systèmes à évènements discrets : De la simulation à l'analyse temporelle de la décision en agriculture. 5ème Journée STIC & Environnement, Nov 2007, Lyon, France. ⟨lirmm-00239345⟩
  • Olivier Naud, Arnaud Helias, Bertrand Léger, Tu Tuitete, Florent Hernandez, et al.. Systèmes réactifs pour modéliser la décision en production agricole: Exemples à propos des traitements phytosanitaires. MSR'07: 6ème Colloque Francophone sur la Modélisation des Systèmes Réactifs, Oct 2007, Lyon, France. pp.159-174. ⟨lirmm-00243964⟩
  • Rodolphe Giroudeau, Jean-Claude König, Farida Moulai, Jérôme Palaysi. Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays. Euro-Par: European Conference on Parallel Computing, Aug 2005, Lisboa, Portugal. pp.252-261, ⟨10.1007/11549468_30⟩. ⟨lirmm-00402647⟩
  • Eric Angel, Evripidis Bampis, Rodolphe Giroudeau. Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. Euro-Par: European Conference on Parallel Processing, Aug 2002, Paderborn, Germany. pp.217-224, ⟨10.1007/3-540-45706-2_28⟩. ⟨lirmm-00268636⟩

Poster communications1 document

  • Rodolphe Giroudeau, Giorgio Di Natale, Marie-Lise Flottes, Florent Hernandez. Exact wafer matching process wafer to wafer inegration. 3D Integration Applications, 2012, Grenoble, France. Workshop on 3D Integration Applications, Technology, Architecture, Design, Automation, and Test, 2012. ⟨lirmm-00805059⟩

Book sections3 documents

  • Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape. A Method for the Energy Optimization of a Multisource Elevator. Informatics in Control, Automation and Robotics, LNEE (430), pp.3-29, 2018, 978-3-319-55010-7. ⟨10.1007/978-3-319-55011-4_1⟩. ⟨lirmm-02139036⟩
  • Rodolphe Giroudeau, Jean-Claude König. Approximation algorithms for scheduling problems. A chapman and hall book. Introduction to scheduling, CRC press, pp.23-50, 2009. ⟨lirmm-00445575⟩
  • Rodolphe Giroudeau, Jean-Claude König. Scheduling with Communication Delay. Multiprocessor Scheduling: Theory and Applications, ARS Publishing, pp.1-26, 2007, 978-3-902613-02-8. ⟨lirmm-00195552⟩

Other publications2 documents

  • Florent Hernandez, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud. A new exact algorithm to solve the Multi-trip vehicle routing problem with time windows and limited duration. 2011. ⟨emse-00632609⟩
  • Nicolas Anquetil, Simon Denier, Stéphane Ducasse, Jannik Laval, Damien Pollet, et al.. Software (re)modularization: Fight against the structure erosion and migration preparation. 2010. ⟨lirmm-00534901⟩

Preprints, Working Papers, ...1 document

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

Reports16 documents

  • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. Approximability and exact resolution of the Multidimensional Binary Vector Assignment problem. [Research Report] Lirmm; Montpellier II. 2016. ⟨lirmm-01310648⟩
  • Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau. On the complexity of Wafer-to-Wafer Integration. [Research Report] LIRMM. 2015. ⟨lirmm-01110027⟩
  • 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⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest k-Subgraph in Chordal Graphs. 2013. ⟨hal-00868188⟩
  • Rémi Watrigant, Nicolas Bousquet, Marin Bougeret, Rodolphe Giroudeau. Parameterized Complexity of the Sparsest k-Subgraph in Chordal Graphs. [Research Report] RR-13033, LIRMM. 2013. ⟨lirmm-00875132⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. NP-hardness of the Sparsest k-Subgraph Problem in Chordal Graphs. RR-12026, 2012. ⟨lirmm-00744655v3⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. Sum-Max Graph Partitioning Problem. RR-12015, 2012. ⟨lirmm-00694569v2⟩
  • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. The k-Sparsest Subgraph Problem. RR-12019, 2012. ⟨lirmm-00735713v2⟩
  • Rodolphe Giroudeau, Oliver Naud, Florent Hernandez, Dominique Feillet. A New Exact Algorithm to Solve the Multi-Trip Vehicle Routing Problem with Time Windows and Limited Duration. RR-11023, 2011. ⟨lirmm-00616667v2⟩
  • Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. 2-Cover Definition for a Coupled-Tasks Scheduling Problem. [Research Report] RR-09003, LIRMM. 2009. ⟨lirmm-00355048v2⟩
  • Rodolphe Giroudeau, Jean-Claude König, F.K. Moulai, Jérôme Palaysi. Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays. [Research Report] 05025, LIRMM. 2005. ⟨lirmm-00106681⟩
  • Rodolphe Giroudeau, Jean-Claude König. General Non-Approximability Results in Presence of Hierarchical Communications. [Research Report] 03019, LIRMM. 2003, pp.11. ⟨lirmm-00191921⟩
  • Rodolphe Giroudeau, Jean-Claude König. General Non-Approximability Results in Presence of Hierarchical Communications. [Research Report] 03019, LIRMM. 2003. ⟨lirmm-00269570⟩
  • Rodolphe Giroudeau, Jean-Claude König. General Non-Approximability Results in Presence of Hierarchical Communications. [Research Report] 03019, LIRMM. 2003. ⟨lirmm-00269441⟩
  • Rodolphe Giroudeau, Jean-Claude König. Non-Approximability Results in Presence of Hierarchical Communications. [Research Report] 02206, LIRMM. 2002. ⟨lirmm-00268513⟩
  • Rodolphe Giroudeau, Jean-Claude König. Non-Approximability Results in Presence of Hierarchical Communications. [Research Report] 02206, LIRMM. 2002. ⟨lirmm-00269417⟩

Habilitation à diriger des recherches1 document

  • Rodolphe Giroudeau. ordonnancement et communications. Recherche opérationnelle [cs.RO]. Université Montpellier II - Sciences et Techniques du Languedoc, 2012. ⟨tel-00797855⟩