Malleable tasks: An efficient model for solving actual parallel applications. - Renaud Lepère; G. Maunie; Denis Trystram; Borut Robic (PARCO, 1999)

Approches algorithmiques pour l'ordonnancement d'applications parallèles avec communications. (Parallel application scheduling with communications). - Renaud Lepère (2001)

A New Clustering Algorithm for Large Communication Delays. - Renaud Lepère; Denis Trystram (IPDPS, 2002)

An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. - Renaud Lepère; Christophe Rapine (STACS, 2002)

An approximation algorithm for scheduling trees of malleable tasks. - Renaud Lepère; Grégory Mounié; Denis Trystram (Eur. J. Oper. Res., 2002)

Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. - Renaud Lepère; Denis Trystram; Gerhard J. Woeginger (Int. J. Found. Comput. Sci., 2002)