Остановите войну!
for scientists:
default search action
Rodolphe Giroudeau
- > Home > Persons > Rodolphe Giroudeau
Publications
- 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 - 2019
- [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 - 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) - 2017
- [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
- [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) - [c23]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On Residual Approximation in Solution Extension Problems. COCOA 2016: 463-476 - 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) - [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 - 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 - 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) - [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) - 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) - 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
- [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) - 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 - 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
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 2023-11-14 02:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint