Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows F Hernandez, D Feillet, R Giroudeau, O Naud European Journal of Operational Research 249 (2), 551-559, 2016 | 57 | 2016 |

A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration F Hernandez, D Feillet, R Giroudeau, O Naud 4or 12 (3), 235-259, 2014 | 38 | 2014 |

Exact approaches for scaffolding M Weller, A Chateau, R Giroudeau BMC bioinformatics 16 (S14), S2, 2015 | 24 | 2015 |

A complexity and approximation framework for the maximization scaffolding problem A Chateau, R Giroudeau Theoretical Computer Science 595, 92-106, 2015 | 23 | 2015 |

Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor G Simonin, B Darties, R Giroudeau, JC König Journal of Scheduling 14 (5), 501-509, 2011 | 21 | 2011 |

Approximation algorithms for the wafer to wafer integration problem T Dokka, M Bougeret, V Boudet, R Giroudeau, FCR Spieksma International Workshop on Approximation and Online Algorithms, 286-297, 2012 | 17 | 2012 |

Complexity and approximation for precedence constrained scheduling problems with large communication delays R Giroudeau, JC Konig, FK Moulai, J Palaysi Theoretical Computer Science 401 (1-3), 107-119, 2008 | 17 | 2008 |

Approximating the Sparsest*k*-Subgraph in Chordal GraphsR Watrigant, M Bougeret, R Giroudeau Theory of Computing Systems 58 (1), 111-132, 2016 | 12 | 2016 |

Complexity and polynomial-time approximation algorithms around the scaffolding problem A Chateau, R Giroudeau International Conference on Algorithms for Computational Biology, 47-58, 2014 | 12 | 2014 |

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications E Bampis, R Giroudeau, JC König Theoretical Computer Science 290 (3), 1883-1895, 2003 | 12 | 2003 |

On the hardness of approximating the precedence constrained multiprocessor scheduling problem with hierarchical communications E Bampis, R Giroudeau, JC Konig RAIRO-Operations Research 36 (1), 21-36, 2002 | 12 | 2002 |

Using duplication for the multiprocessor scheduling problem with hierarchical communications E Bampis, R Giroudeau, JC König Parallel Processing Letters 10 (01), 133-140, 2000 | 12 | 2000 |

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks G Simonin, R Giroudeau, JC König Electronic Notes in Discrete Mathematics 36, 647-654, 2010 | 10 | 2010 |

A heuristic for the precedence constrained multiprocessor scheduling problem with hierarchical communications E Bampis, R Giroudeau, JC König Proceedings of STACS, LNCS, 443-454, 2000 | 10 | 2000 |

On the complexity of scaffolding problems: from cliques to sparse graphs M Weller, A Chateau, R Giroudeau Combinatorial Optimization and Applications, 409-423, 2015 | 9 | 2015 |

The k-sparsest subgraph problem R Watrigant, M Bougeret, R Giroudeau | 9 | 2012 |

Complexity and approximation for scheduling problem for a torpedo G Simonin, R Giroudeau, JC König Computers & Industrial Engineering 61 (2), 352-356, 2011 | 9 | 2011 |

On the sum-max graph partitioning problem R Watrigant, M Bougeret, R Giroudeau, JC König Theoretical Computer Science 540, 143-155, 2014 | 8 | 2014 |

Complexity and approximation for the precedence constrained scheduling problem with large communication delays R Giroudeau, JC König, FK Moulaď, J Palaysi European Conference on Parallel Processing, 252-261, 2005 | 8 | 2005 |

L'impact des delais de communications hierarchiques sur la complexite et l'approximation des problemes d'ordonnancement R Giroudeau Evry-Val d'Essonne, 2000 | 8 | 2000 |