 | 2009 |
|---|
| 31 |       | Nicolas Thibault,
Christian Laforest:
Online time constrained scheduling with penalties.
IPDPS 2009: 1-8 |
| 30 | | Etienne Birmelé,
François Delbot,
Christian Laforest:
Mean analysis of an online algorithm for the vertex cover problem.
Inf. Process. Lett. 109(9): 436-439 (2009) |
| 2008 |
|---|
| 29 | | Fabien Baille,
Evripidis Bampis,
Christian Laforest,
Christophe Rapine:
Bicriteria scheduling for contiguous and non contiguous parallel tasks.
Annals OR 159(1): 97-106 (2008) |
| 28 | | François Delbot,
Christian Laforest:
A better list heuristic for vertex cover.
Inf. Process. Lett. 107(3-4): 125-127 (2008) |
| 2007 |
|---|
| 27 | | Nicolas Thibault,
Christian Laforest:
An Optimal Rebuilding Strategy for an Incremental Tree Problem.
Journal of Interconnection Networks 8(1): 75-99 (2007) |
| 2006 |
|---|
| 26 | | Fabien Baille,
Lélia Blin,
Christian Laforest:
Distributed Approximation Allocation Resources Algorithm for Connecting Groups.
Euro-Par 2006: 519-529 |
| 25 | | Nicolas Thibault,
Christian Laforest:
An Optimal Rebuilding Strategy for a Decremental Tree Problem.
SIROCCO 2006: 157-170 |
| 24 | | Ralf Klasing,
Christian Laforest,
Joseph Peters,
Nicolas Thibault:
Constructing Incremental Sequences in Graphs.
Algorithmic Operations Research 1(2): (2006) |
| 2005 |
|---|
| 23 | | Fabien Baille,
Evripidis Bampis,
Christian Laforest,
Nicolas Thibault:
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules.
COCOON 2005: 308-317 |
| 22 | | Fabien Baille,
Evripidis Bampis,
Christian Laforest,
Nicolas Thibault:
On-Line Bicriteria Interval Scheduling.
Euro-Par 2005: 312-322 |
| 21 | | Nicolas Thibault,
Christian Laforest:
On-line Time-Constrained Scheduling Problem for the Size on kappa machines.
ISPAN 2005: 20-24 |
| 2004 |
|---|
| 20 | | Fabien Baille,
Evripidis Bampis,
Christian Laforest:
Maximization of the Size and the Weight of Schedules of Degradable Intervals.
COCOON 2004: 219-228 |
| 19 | | Christian Destré,
Christian Laforest,
Sandrine Vial:
Assignment of Shortest Paths Spanning Trees in Meshes.
IPDPS 2004 |
| 18 | | Ralf Klasing,
Christian Laforest:
Hardness results and approximation algorithms of k-tuple domination in graphs.
Inf. Process. Lett. 89(2): 75-83 (2004) |
| 17 | | Fabien Baille,
Evripidis Bampis,
Christian Laforest:
A Note On Bicriteria Schedules With Optimal Approximations Ratios.
Parallel Processing Letters 14(2): 315-323 (2004) |
| 2003 |
|---|
| 16 | | Christian Laforest:
Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases.
Euro-Par 2003: 903-910 |
| 15 |  | Christian Destré,
Christian Laforest,
Sandrine Vial:
The Broadcast Assignment Problem.
SIROCCO 2003: 101-116 |
| 2002 |
|---|
| 14 | | Dominique Barth,
Pascal Berthomé,
T. Czarchoski,
Jean-Michel Fourneau,
Christian Laforest,
Sandrine Vial:
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance.
Euro-Par 2002: 767-774 |
| 13 | | Christian Laforest,
Sandrine Vial:
Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks.
IPDPS 2002 |
| 12 | | Christian Laforest:
A good balance between weight and distances for multipoint trees.
OPODIS 2002: 193-202 |
| 2001 |
|---|
| 11 | | Christian Laforest,
Arthur L. Liestman,
Thomas C. Shermer,
Dominique Sotteau:
Edge-disjoint spanners of complete bipartite graphs.
Discrete Mathematics 234(1-3): 65-76 (2001) |
| 2000 |
|---|
| 10 | | Alexis Irlande,
Jean-Claude König,
Christian Laforest:
Construction of low-cost and low-diameter Steiner trees for multipoint groups.
SIROCCO 2000: 197-210 |
| 9 | | Abdelmadjid Bouabdallah,
Christian Laforest:
A Distributed token/based Algorithm for the Dynamic Resource Allocation Problem.
Operating Systems Review 34(3): 60-68 (2000) |
| 1999 |
|---|
| 8 | | Christian Laforest,
Arthur L. Liestman,
David Peleg,
Thomas C. Shermer,
Dominique Sotteau:
Edge-disjoint spanners of complete graphs and complete digraphs.
Discrete Mathematics 203(1-3): 133-159 (1999) |
| 7 | | Dominique Barth,
Christian Laforest:
Scattering and multi-scattering in trees and meshes, with local routing and without buffering.
Parallel Computing 25(8): 1035-1057 (1999) |
| 1997 |
|---|
| 6 | | Christian Laforest,
Arthur L. Liestman,
Thomas C. Shermer,
Dominique Sotteau:
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.
HICSS (1) 1997: 191-199 |
| 5 | | Christian Laforest:
Broadcast and Gossip in Line-communication Mode.
Discrete Applied Mathematics 80(2-3): 161-176 (1997) |
| 1996 |
|---|
| 4 | | Christian Laforest:
Gossip in Trees under Line-Communication Mode.
Euro-Par, Vol. I 1996: 333-340 |
| 3 | | Satoshi Fujita,
Christian Laforest,
Stephane Perennes:
A Gossip Algorithm for Bus Networks with Buses of Limited Length.
Euro-Par, Vol. I 1996: 353-360 |
| 2 | | Pierre Fraigniaud,
Christian Laforest:
Minimum gossip bus networks.
Networks 27(4): 239-251 (1996) |
| 1993 |
|---|
| 1 | | Pierre Fraigniaud,
Christian Laforest:
Disjoint Spanning Trees of Small Depth.
PARCO 1993: 105-112 |
