Rodolphe Giroudeau Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodolphe Giroudeau, Jean-Claude König: General scheduling non-approximability results in presence of hierarchical communications. European Journal of Operational Research 184(2): 441-457 (2008)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodolphe Giroudeau: Seuil d'approximation pour le modèle UET-UCT en présence d'une infinité de processeurs. Une preuve alternative. Technique et Science Informatiques 27(5): 571-588 (2008)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodolphe 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodolphe 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
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodolphe Giroudeau: Seuil d'approximation pour un problème d'ordonnancement en présence de communications hiérarchiques. Technique et Science Informatiques 24(1): 95-114 (2005)
2004
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRodolphe Giroudeau, Jean-Claude König: General Non-Approximability Results in Presence of Hierarchical Communications. ISPDC/HeteroPar 2004: 312-319
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvripidis Bampis, Rodolphe Giroudeau, Alexander Kononov: Scheduling Tasks with Small Communication Delays for Clusters of Processors. Annals OR 129(1-4): 47-63 (2004)
2003
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvripidis 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric 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
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvripidis Bampis, Rodolphe Giroudeau, Alexander Kononov: Scheduling tasks with small communication delays for clusters of processors. SPAA 2001: 314-315
2000
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvripidis Bampis, Rodolphe Giroudeau, Jean-Claude König: An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS 2000: 443-454
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvripidis Bampis, Rodolphe Giroudeau, Jean-Claude König: Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Processing Letters 10(1): 133-140 (2000)
1999
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvripidis Bampis, Rodolphe Giroudeau, Jean-Claude König: Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par 1999: 369-372

Coauthor Index

1Eric Angel [5]
2Evripidis Bampis [1] [2] [3] [4] [5] [6] [7]
3Jean-Claude König [1] [2] [3] [6] [8] [10] [11] [13]
4Alexander Kononov [4] [7]
5Farida Kamila Moulai [11]
6Feryal-Kamila Moulaï [10]
7Jérôme Palaysi [10] [11]

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)