Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (Parallel Process. Lett., 2000)

Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. - Eric Angel; Evripidis Bampis; Rodolphe Giroudeau (Euro-Par, 2002)

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (RAIRO Oper. Res., 2002)

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2003)

General Non-Approximability Results in Presence of Hierarchical Communications. - Rodolphe Giroudeau; Jean-Claude König (ISPDC/HeteroPar, 2004)

Scheduling Tasks with Small Communication Delays for Clusters of Processors. - Evripidis Bampis; Rodolphe Giroudeau; Alexander V. Kononov (Ann. Oper. Res., 2004)

Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays. - Rodolphe Giroudeau; Jean-Claude König; Feryal-Kamila Moulaï; Jérôme Palaysi (Euro-Par, 2005)

Seuil d'approximation pour un problème d'ordonnancement en présence de communications hiérarchiques. - Rodolphe Giroudeau (Tech. Sci. Informatiques, 2005)

General scheduling non-approximability results in presence of hierarchical communications. - Rodolphe Giroudeau; Jean-Claude König (Eur. J. Oper. Res., 2008)

Complexity and approximation for precedence constrained scheduling problems with large communication delays. - Rodolphe Giroudeau; Jean-Claude König; Farida Kamila Moulai; Jérôme Palaysi (Theor. Comput. Sci., 2008)

Seuil d'approximation pour le modèle UET-UCT en présence d'une infinité de processeurs. Une preuve alternative. - Rodolphe Giroudeau (Tech. Sci. Informatiques, 2008)

Approximation Algorithms for Scheduling Problems. - Jean-Claude König; Rodolphe Giroudeau (Introduction to Scheduling, 2009)

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. - Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König (Electron. Notes Discret. Math., 2010)

Scheduling UET-tasks on a star network: complexity and approximation. - Rodolphe Giroudeau; Jean-Claude König; Benoît Valéry (4OR, 2011)

Erratum to: Scheduling UET-tasks on a star network: complexity and approximation. - Rodolphe Giroudeau; Jean-Claude König; Benoît Valéry (4OR, 2011)

Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. - Marwane Bouznif; Rodolphe Giroudeau (Adv. Oper. Res., 2011)

Complexity and approximation for scheduling problem for a torpedo. - Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König (Comput. Ind. Eng., 2011)

Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. - Gilles Simonin; Benoît Darties; Rodolphe Giroudeau; Jean-Claude König (J. Sched., 2011)

ordonnancement et communications. (Communications and scheduling). - Rodolphe Giroudeau (2012)

Approximation Algorithms for the Wafer to Wafer Integration Problem. - Trivikram Dokka; Marin Bougeret; Vincent Boudet; Rodolphe Giroudeau; Frits C. R. Spieksma (WAOA, 2012)

Erratum to "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks". - Marwane Bouznif; Rodolphe Giroudeau (Adv. Oper. Res., 2012)

Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. - Gilles Simonin; Rodolphe Giroudeau; Benoît Darties; Jean-Claude König (Algorithmic Oper. Res., 2012)

Scheduling in the presence of processor networks : complexity and approximation. - Vincent Boudet; Johanne Cohen; Rodolphe Giroudeau; Jean-Claude König (RAIRO Oper. Res., 2012)

Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. - Annie Chateau; Rodolphe Giroudeau (AlCoB, 2014)

Approximation algorithm for constrained coupled-tasks scheduling problem. - Gilles Simonin; Benoît Darties; Jean-Claude König; Rodolphe Giroudeau (CoDIT, 2014)

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. - Benoît Darties; Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König (ISCO, 2014)

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. - Marin Bougeret; Nicolas Bousquet 001; Rodolphe Giroudeau; Rémi Watrigant (SOFSEM, 2014)

A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. - Florent Hernández; Dominique Feillet; Rodolphe Giroudeau; Olivier Naud (4OR, 2014)

On the sum-max graph partitioning problem. - Rémi Watrigant; Marin Bougeret; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2014)

On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2015)

A complexity and approximation framework for the maximization scaffolding problem. - Annie Chateau; Rodolphe Giroudeau (Theor. Comput. Sci., 2015)

Exact approaches for scaffolding. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau (BMC Bioinform., 2015)

Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. - Clément Dallard; Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2016)

The Sourcing Problem - Energy Optimization of a Multisource Elevator. - Chloé Desdouits; Mazen Alamir; Rodolphe Giroudeau; Claude Le Pape (ICINCO (1), 2016)

A Method for the Energy Optimization of a Multisource Elevator. - Chloé Desdouits; Mazen Alamir; Rodolphe Giroudeau; Claude Le Pape (ICINCO (Selected Papers), 2016)

Certification Under Uncertainties of Control Methods for Multisource Elevators. - Chloé Desdouits; Mazen Alamir; Rodolphe Giroudeau; Claude Le Pape (ISDA, 2016)

Production scheduling with a piecewise-linear energy cost function. - Mustapha Haouassi; Chloe Desdouits; Rodolphe Giroudeau; Claude Le Pape (SSCI, 2016)

On the complexity of Wafer-to-Wafer Integration. - Marin Bougeret; Vincent Boudet; Trivikram Dokka; Guillerme Duvillié; Rodolphe Giroudeau (Discret. Optim., 2016)

Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. - Florent Hernández; Dominique Feillet; Rodolphe Giroudeau; Olivier Naud (Eur. J. Oper. Res., 2016)

Approximating the Sparsest k-Subgraph in Chordal Graphs. - Rémi Watrigant; Marin Bougeret; Rodolphe Giroudeau (Theory Comput. Syst., 2016)

Some complexity and approximation results for coupled-tasks scheduling problem according to topology. - Benoît Darties; Rodolphe Giroudeau; Jean-Claude König; Gilles Simonin (RAIRO Oper. Res., 2016)

New Insights for Power Edge Set Problem. - Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (COCOA (1), 2017)

On the Linearization of Scaffolds Sharing Repeated Contigs. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA (2), 2017)

Improved Complexity for Power Edge Set Problem. - Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (IWOCA, 2017)

Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. - Rodolphe Giroudeau; Jean-Claude König; Benoît Darties; Gilles Simonin (CoRR, 2017)

Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. - Marin Bougeret; Guillerme Duvillié; Rodolphe Giroudeau; Rémi Watrigant (Discret. Math. Theor. Comput. Sci., 2017)

New Results About the Linearization of Scaffolds Sharing Repeated Contigs. - Dorine Tabary; Tom Davot; Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2018)

On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (RECOMB-CG, 2018)

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. - Mathias Weller; Annie Chateau; Clément Dallard; Rodolphe Giroudeau (Algorithmica, 2018)

Approximability and exact resolution of the multidimensional binary vector assignment problem. - Marin Bougeret; Guillerme Duvillié; Rodolphe Giroudeau (J. Comb. Optim., 2018)

On residual approximation in solution extension problems. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau; Jean-Claude König; Valentin Pollet (J. Comb. Optim., 2018)

Complexity and lowers bounds for Power Edge Set Problem. - Benoît Darties; Nicolas Champseix; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (J. Discrete Algorithms, 2018)

New Polynomial-Time Algorithm Around the Scaffolding Problem. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (AlCoB, 2019)

The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. - Benoît Darties; Rodolphe Giroudeau; Jean-Claude König; Valentin Pollet (COCOA, 2019)

The Workforce Routing and Scheduling Problem: solving real-world Instances. - Gabriel Volte; Chloé Desdouits; Rodolphe Giroudeau (INOC, 2019)

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. - Pierre Cazals; Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (IWOCA, 2019)

Parameterized complexity of a coupled-task scheduling problem. - Stéphane Bessy; Rodolphe Giroudeau (J. Sched., 2019)

Proof of Experience: empowering Proof of Work protocol with miner previous work. - Samuel Masseport; Benoît Darties; Rodolphe Giroudeau; Jorick Lartigau (BRAINS, 2020)

Exact Method Approaches for the Differential Harvest Problem. - Gabriel Volte; Eric Bourreau; Rodolphe Giroudeau; Olivier Naud (CPAIOR, 2020)

Linearizing Genomes: Exact Methods and Local Search. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (SOFSEM, 2020)

Proof of usage: user-centric consensus for data provision and exchange. - Samuel Masseport; Jorick Lartigau; Benoît Darties; Rodolphe Giroudeau (Ann. des Télécommunications, 2020)

Complexity and Approximation Results on the Shared Transportation Problem. - Tom Davot; Rodolphe Giroudeau; Jean-Claude König (COCOA, 2021)

Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller; Dorine Tabary (Algorithmica, 2021)

Complexity and inapproximability results for balanced connected subgraph problem. - Timothée Martinod; Valentin Pollet; Benoît Darties; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2021)

On a greedy approach for genome scaffolding. - Tom Davot; Annie Chateau; Rohan Fossé; Rodolphe Giroudeau; Mathias Weller (Algorithms Mol. Biol., 2022)

Using VRPSolver to efficiently solve the Differential Harvest Problem. - Gabriel Volte; Eric Bourreau; Rodolphe Giroudeau; Olivier Naud (Comput. Oper. Res., 2023)

Ricochet Robots with Infinite Horizontal Board is Turing-complete. - Samuel Masseport; Tom Davot; Rodolphe Giroudeau (J. Inf. Process., 2023)

On the Shared Transportation Problem: Computational Hardness and Exact Approach. - Tom Davot; Rodolphe Giroudeau; Jean-Claude König (Int. J. Found. Comput. Sci., 2024)

Indoor Navigation: Navmesh Applied to Indoor Graph Creation. - Maxime Callico; Rodolphe Giroudeau; Benoît Darties; Jean Carrière (ICORES, 2025)