Rodolphe Giroudeau

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 45

Top Topics

Scheduling Problem

Approximation Algorithms

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Publications

Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud
Using VRPSolver to efficiently solve the Differential Harvest Problem. Comput. Oper. Res. 149 (2023)
Samuel Masseport, Tom Davot, Rodolphe Giroudeau
Ricochet Robots with Infinite Horizontal Board is Turing-complete. J. Inf. Process. 31 (2023)
Tom Davot, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller
On a greedy approach for genome scaffolding. Algorithms Mol. Biol. 17 (1) (2022)
Timothée Martinod, Valentin Pollet, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
Complexity and inapproximability results for balanced connected subgraph problem. Theor. Comput. Sci. 886 (2021)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. Algorithmica 83 (7) (2021)
Tom Davot, Rodolphe Giroudeau, Jean-Claude König
Complexity and Approximation Results on the Shared Transportation Problem. COCOA (2021)
Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud
Exact Method Approaches for the Differential Harvest Problem. CPAIOR (2020)
Samuel Masseport, Jorick Lartigau, Benoît Darties, Rodolphe Giroudeau
Proof of usage: user-centric consensus for data provision and exchange. Ann. des Télécommunications 75 (3-4) (2020)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Linearizing Genomes: Exact Methods and Local Search. SOFSEM (2020)
Samuel Masseport, Benoît Darties, Rodolphe Giroudeau, Jorick Lartigau
Proof of Experience: empowering Proof of Work protocol with miner previous work. BRAINS (2020)
Gabriel Volte, Chloé Desdouits, Rodolphe Giroudeau
The Workforce Routing and Scheduling Problem: solving real-world Instances. INOC (2019)
Stéphane Bessy, Rodolphe Giroudeau
Parameterized complexity of a coupled-task scheduling problem. J. Sched. 22 (3) (2019)
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. COCOA (2019)
Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. IWOCA (2019)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
New Polynomial-Time Algorithm Around the Scaffolding Problem. AlCoB (2019)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
Approximability and exact resolution of the multidimensional binary vector assignment problem. J. Comb. Optim. 36 (3) (2018)
Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. RECOMB-CG (2018)
Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica 80 (6) (2018)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
On residual approximation in solution extension problems. J. Comb. Optim. 36 (4) (2018)
Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2018)
Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms (2018)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discret. Math. Theor. Comput. Sci. 19 (4) (2017)
Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. CoRR (2017)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau
On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2) (2017)
Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
New Insights for Power Edge Set Problem. COCOA (1) (2017)
Rodolphe Giroudeau, Jean-Claude König, Benoît Darties, Gilles Simonin
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. CoRR (2017)
Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
Improved Complexity for Power Edge Set Problem. IWOCA (2017)
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. CoRR (2017)
Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
A Method for the Energy Optimization of a Multisource Elevator. ICINCO (Selected Papers) (2016)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst. 58 (1) (2016)
Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau
On the complexity of Wafer-to-Wafer Integration. Discret. Optim. 22 (2016)
Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
The Sourcing Problem - Energy Optimization of a Multisource Elevator. ICINCO (1) (2016)
Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA (2016)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. ISCO (2016)
Mustapha Haouassi, Chloe Desdouits, Rodolphe Giroudeau, Claude Le Pape
Production scheduling with a piecewise-linear energy cost function. SSCI (2016)
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO Oper. Res. 50 (4-5) (2016)
Florent Hernández, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud
Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. Eur. J. Oper. Res. 249 (2) (2016)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
On Residual Approximation in Solution Extension Problems. COCOA (2016)
Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
Certification Under Uncertainties of Control Methods for Multisource Elevators. ISDA (2016)
Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau
On the Complexity of Wafer-to-Wafer Integration. CIAC (2015)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT (2015)
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. CoRR (2015)
Annie Chateau, Rodolphe Giroudeau
A complexity and approximation framework for the maximization scaffolding problem. Theor. Comput. Sci. 595 (2015)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA (2015)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau
Exact approaches for scaffolding. BMC Bioinform. 16 (S14) (2015)
Gilles Simonin, Benoît Darties, Jean-Claude König, Rodolphe Giroudeau
Approximation algorithm for constrained coupled-tasks scheduling problem. CoDIT (2014)
Florent Hernández, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud
A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR 12 (3) (2014)
Annie Chateau, Rodolphe Giroudeau
Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. AlCoB (2014)
Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM (2014)
Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO (2014)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
On the sum-max graph partitioning problem. Theor. Comput. Sci. 540 (2014)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
Approximating the Sparsest k-Subgraph in Chordal Graphs. WAOA (2013)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
Sum-Max Graph Partitioning Problem. ISCO (2012)
Vincent Boudet, Johanne Cohen, Rodolphe Giroudeau, Jean-Claude König
Scheduling in the presence of processor networks : complexity and approximation. RAIRO Oper. Res. 46 (1) (2012)
Marwane Bouznif, Rodolphe Giroudeau
Erratum to "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks". Adv. Oper. Res. 2012 (2012)
Gilles Simonin, Rodolphe Giroudeau, Benoît Darties, Jean-Claude König
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. Algorithmic Oper. Res. 7 (1) (2012)
Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA (2012)
Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Sched. 14 (5) (2011)
Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry
-tasks on a star network: complexity and approximation. 4OR 9 (1) (2011)
Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
Complexity and approximation for scheduling problem for a torpedo. Comput. Ind. Eng. 61 (2) (2011)
Marwane Bouznif, Rodolphe Giroudeau
Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. Adv. Oper. Res. 2011 (2011)
Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoît Darties
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. ICAPS (2011)
Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry
-tasks on a star network: complexity and approximation. 4OR 9 (1) (2011)
Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. Electron. Notes Discret. Math. 36 (2010)
Rodolphe Giroudeau, Jean-Claude König
General scheduling non-approximability results in presence of hierarchical communications. Eur. J. Oper. Res. 184 (2) (2008)
Rodolphe Giroudeau, Jean-Claude König, Farida Kamila Moulai, Jérôme Palaysi
Complexity and approximation for precedence constrained scheduling problems with large communication delays. Theor. Comput. Sci. 401 (1-3) (2008)
Rodolphe Giroudeau
Seuil d'approximation pour le modèle UET-UCT en présence d'une infinité de processeurs. Une preuve alternative. Tech. Sci. Informatiques 27 (5) (2008)
Rodolphe Giroudeau
Seuil d'approximation pour un problème d'ordonnancement en présence de communications hiérarchiques. Tech. Sci. Informatiques 24 (1) (2005)
Rodolphe Giroudeau, Jean-Claude König, Feryal-Kamila Moulaï, Jérôme Palaysi
Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays. Euro-Par (2005)
Rodolphe Giroudeau, Jean-Claude König
General Non-Approximability Results in Presence of Hierarchical Communications. ISPDC/HeteroPar (2004)
Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov
Scheduling Tasks with Small Communication Delays for Clusters of Processors. Ann. Oper. Res. 129 (1-4) (2004)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. Theor. Comput. Sci. 290 (3) (2003)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO Oper. Res. 36 (1) (2002)
Eric Angel, Evripidis Bampis, Rodolphe Giroudeau
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. Euro-Par (2002)
Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov
Scheduling tasks with small communication delays for clusters of processors. SPAA (2001)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS (2000)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Process. Lett. 10 (1) (2000)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par (1999)