default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRodolphe Giroudeau
Person information
- affiliation: LIRMM, Montpellier, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j38]Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
On the Shared Transportation Problem: Computational Hardness and Exact Approach. Int. J. Found. Comput. Sci. 35(6): 741-756 (2024)- 2023
- [j37]Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud
:
Using VRPSolver to efficiently solve the Differential Harvest Problem. Comput. Oper. Res. 149: 106029 (2023) - [j36]Samuel Masseport, Tom Davot, Rodolphe Giroudeau:
Ricochet Robots with Infinite Horizontal Board is Turing-complete. J. Inf. Process. 31: 413-420 (2023) - 2022
- [j35]Tom Davot, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller:
On a greedy approach for genome scaffolding. Algorithms Mol. Biol. 17(1): 16 (2022) - 2021
- [j34]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): 2063-2095 (2021) - [j33]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: 69-83 (2021) - [c37]Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
Complexity and Approximation Results on the Shared Transportation Problem. COCOA 2021: 140-151 - 2020
- [j32]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): 153-162 (2020) - [c36]Samuel Masseport, Benoît Darties, Rodolphe Giroudeau, Jorick Lartigau:
Proof of Experience: empowering Proof of Work protocol with miner previous work. BRAINS 2020: 57-58 - [c35]Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud:
Exact Method Approaches for the Differential Harvest Problem. CPAIOR 2020: 492-510 - [c34]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Linearizing Genomes: Exact Methods and Local Search. SOFSEM 2020: 505-518
2010 – 2019
- 2019
- [j31]Stéphane Bessy, Rodolphe Giroudeau:
Parameterized complexity of a coupled-task scheduling problem. J. Sched. 22(3): 305-313 (2019) - [c33]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Polynomial-Time Algorithm Around the Scaffolding Problem. AlCoB 2019: 25-38 - [c32]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: 449-460 - [c31]Gabriel Volte, Chloé Desdouits, Rodolphe Giroudeau:
The Workforce Routing and Scheduling Problem: solving real-world Instances. INOC 2019: 60-65 - [c30]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: 122-135 - 2018
- [j30]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): 1771-1803 (2018) - [j29]Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau:
Approximability and exact resolution of the multidimensional binary vector assignment problem. J. Comb. Optim. 36(3): 1059-1073 (2018) - [j28]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On residual approximation in solution extension problems. J. Comb. Optim. 36(4): 1195-1220 (2018) - [j27]Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms 52-53: 70-91 (2018) - [c29]Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA 2018: 94-107 - [c28]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. RECOMB-CG 2018: 91-107 - 2017
- [j26]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) - [c27]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Insights for Power Edge Set Problem. COCOA (1) 2017: 180-194 - [c26]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2) 2017: 509-517 - [c25]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Improved Complexity for Power Edge Set Problem. IWOCA 2017: 128-141 - [i4]Rodolphe Giroudeau, Jean-Claude König, Benoît Darties, Gilles Simonin:
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. CoRR abs/1706.02200 (2017) - [i3]Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. CoRR abs/1706.02202 (2017) - [i2]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 abs/1706.02214 (2017) - 2016
- [j25]Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau:
On the complexity of Wafer-to-Wafer Integration. Discret. Optim. 22: 255-269 (2016) - [j24]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): 551-559 (2016) - [j23]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau:
Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst. 58(1): 111-132 (2016) - [j22]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): 781-795 (2016) - [c24]Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA 2016: 294-308 - [c23]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On Residual Approximation in Solution Extension Problems. COCOA 2016: 463-476 - [c22]Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape:
A Method for the Energy Optimization of a Multisource Elevator. ICINCO (Selected Papers) 2016: 3-29 - [c21]Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape:
The Sourcing Problem - Energy Optimization of a Multisource Elevator. ICINCO (1) 2016: 19-30 - [c20]Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau:
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. ISCO 2016: 148-159 - [c19]Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape:
Certification Under Uncertainties of Control Methods for Multisource Elevators. ISDA 2016: 154-164 - [c18]Mustapha Haouassi, Chloe Desdouits, Rodolphe Giroudeau, Claude Le Pape:
Production scheduling with a piecewise-linear energy cost function. SSCI 2016: 1-8 - 2015
- [j21]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Exact approaches for scaffolding. BMC Bioinform. 16(S14): S2 (2015) - [j20]Annie Chateau, Rodolphe Giroudeau:
A complexity and approximation framework for the maximization scaffolding problem. Theor. Comput. Sci. 595: 92-106 (2015) - [c17]Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau:
On the Complexity of Wafer-to-Wafer Integration. CIAC 2015: 208-220 - [c16]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA 2015: 409-423 - [c15]Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant:
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT 2015: 189-201 - [i1]Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant:
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. CoRR abs/1506.03282 (2015) - 2014
- [j19]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): 235-259 (2014) - [j18]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König:
On the sum-max graph partitioning problem. Theor. Comput. Sci. 540: 143-155 (2014) - [c14]Annie Chateau, Rodolphe Giroudeau:
Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. AlCoB 2014: 47-58 - [c13]Gilles Simonin, Benoît Darties, Jean-Claude König, Rodolphe Giroudeau:
Approximation algorithm for constrained coupled-tasks scheduling problem. CoDIT 2014: 110-112 - [c12]Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO 2014: 161-172 - [c11]Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant:
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM 2014: 150-161 - 2013
- [c10]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau:
Approximating the Sparsest k-Subgraph in Chordal Graphs. WAOA 2013: 73-84 - 2012
- [b1]Rodolphe Giroudeau:
ordonnancement et communications. (Communications and scheduling). Montpellier 2 University, France, 2012 - [j17]Marwane Bouznif, Rodolphe Giroudeau:
Erratum to "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks". Adv. Oper. Res. 2012: 543215:1-543215:2 (2012) - [j16]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): 1-12 (2012) - [j15]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): 1-22 (2012) - [c9]Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König:
Sum-Max Graph Partitioning Problem. ISCO 2012: 297-308 - [c8]Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma:
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA 2012: 286-297 - 2011
- [j14]Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry:
Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 29-48 (2011) - [j13]Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry:
Erratum to: Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 111 (2011) - [j12]Marwane Bouznif, Rodolphe Giroudeau:
Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. Adv. Oper. Res. 2011: 476939:1-476939:20 (2011) - [j11]Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Complexity and approximation for scheduling problem for a torpedo. Comput. Ind. Eng. 61(2): 352-356 (2011) - [j10]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): 501-509 (2011) - [c7]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 - 2010
- [j9]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: 647-654 (2010)
2000 – 2009
- 2009
- [p1]Jean-Claude König, Rodolphe Giroudeau:
Approximation Algorithms for Scheduling Problems. Introduction to Scheduling 2009: 23-49 - 2008
- [j8]Rodolphe Giroudeau, Jean-Claude König:
General scheduling non-approximability results in presence of hierarchical communications. Eur. J. Oper. Res. 184(2): 441-457 (2008) - [j7]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): 107-119 (2008) - [j6]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): 571-588 (2008) - 2005
- [j5]Rodolphe Giroudeau:
Seuil d'approximation pour un problème d'ordonnancement en présence de communications hiérarchiques. Tech. Sci. Informatiques 24(1): 95-114 (2005) - [c6]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: 252-261 - 2004
- [j4]Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov:
Scheduling Tasks with Small Communication Delays for Clusters of Processors. Ann. Oper. Res. 129(1-4): 47-63 (2004) - [c5]Rodolphe Giroudeau, Jean-Claude König:
General Non-Approximability Results in Presence of Hierarchical Communications. ISPDC/HeteroPar 2004: 312-319 - 2003
- [j3]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): 1883-1895 (2003) - 2002
- [j2]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): 21-36 (2002) - [c4]Eric Angel, Evripidis Bampis, Rodolphe Giroudeau:
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. Euro-Par 2002: 217-224 - 2001
- [c3]Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov:
Scheduling tasks with small communication delays for clusters of processors. SPAA 2001: 314-315 - 2000
- [j1]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Process. Lett. 10(1): 133-140 (2000) - [c2]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS 2000: 443-454
1990 – 1999
- 1999
- [c1]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par 1999: 369-372
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
