Publications de Christian Laforest

Université d'Evry

Date: (Papers by Christian Laforest)

Les articles présentés ont été publiés dans des journaux, conférences nationales ou internationales avec comité de lecture. Je suis le seul auteur des articles [8,26,27,28].

Tableau 1: Publications par catégories et par années

	93		96	97	98	99	00	01	02	03	04	05	06	Total
Revues internationales			1	1		2		2			2		3	11
Conférences internationales	1		2			1	1	1	3	3	3	5	2	22
Conférences nationales							2	1		3	1	1	2	10

Publications classées par catégories, puis par ordre alphabétique.

Journaux internationaux (International journals).

1

F. Baille, E. Bampis, and C. Laforest.
A note on bicriteria schedules with optimal approximation ratios.
Parallel Processing Letters, 14(2):315-323, 2004.

15

F. Baille, E. Bampis, and C. Laforest and C. Rapine.
Bicriteria Scheduling for Contiguous and Non-Contiguous Parallel Tasks.
Annals of operation research, (To appear).

3

D. Barth and C Laforest.
Scattering and multi-scattering in trees and meshes, with local routing and without buffering.
Parallel computing, 25:1035-1057, 1999.

4

P. Fraigniaud and C. Laforest.
Minimum gossip bus networks.
Networks, 27:239-251, 1996.

5

P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, and I. Kotuliak.
Multiservice optical network : Main concepts and first achievements of the ROM program.
Journal of Ligthwave Technology, 19:23-31, 2001.

6

R. Klasing and C. Laforest.
Hardness results and approximation algorithms of $k$-tuple domination in graphs.
Information Processing Letters, 89:75-83, 2004.

7

R. Klasing, C. Laforest, J. Peters and N. Thibault.
Constructing Incremental Sequences in Graphs.
Algorithmic Operations Research, Vol 1, No 2, 2006.

8

C. Laforest.
Broadcast and gossip in line-communication mode.
Discrete Applied Mathematics, 80:161-176, 1997.

9

C. Laforest, A.L. Liestman, T.C. Shermer, and D. Sotteau.
Edge-disjoint spanners of complete bipartite graphs.
Discrete Mathematics, 234:65-76, 2001.

10

C. Laforest, A.L. Liestman, D. Peleg, T.C. Shermer, and D. Sotteau.
Edge-disjoint spanners of complete graphs and complete digraphs.
Discrete Mathematics, 203:133-159, 1999.

11

N. Thibault and C. Laforest.
An optimal rebuilding strategy for an incremental tree problem.
Journal of Interconnection Networks, (To Appear).

Conférences internationales.

12

F. Baille, E. Bampis, and C. Laforest.
Maximization of the size and the weight of schedules of degradable intervals.
In Computing and Combinatorics (COCOON), LNCS No. 3106, pages 219-228, 2004.

13

F. Baille, E. Bampis, and C. Laforest.
Bicriteria scheduling of parallel degradable tasks for network access under pricing constraints.
In International Network Optimization Conference (INOC), pages 37-42, 2003.

14

F. Baille, L. Blin, C. Laforest.
Distributed Approximation Allocation Ressources Algorithm for Connecting Groups.
Euro-par 2006, LNCS 4128, pages 519-529, 2006.

15

F. Baille, E. Bampis, and C. Laforest and C. Rapine.
Bicriteria Parallel task scheduling.
In Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pages 585-596, 2005.

16

F. Baille, E. Bampis, and C. Laforest and N. Thibault.
On-line simultaneous maximization of the size and the weight for degradable intervals schedules.
In Computing and Combinatorics (COCOON), LNCS No. 3595, pages 308-317, 2005.

17

F. Baille, E. Bampis, and C. Laforest and N. Thibault.
On-line Bicriteria Interval Scheduling.
In Euro-Par 2005, LNCS No. 3648, pages 312 - 323, 2005.

18

D. Barth, P. Berthomé, A. Borrero, J.M. Fourneau, C. Laforest, F. Quessette, and S. Vial.
Performance comparisons of eulerian routing and deflection routing in a 2d-mesh all optical network.
In European Simulation Multiconference (ESM), 2001.

19

D. Barth, P. Berthomé, T. Czarchoski, J-M. Fourneau, C. Laforest, and S. Vial.
A mixed deflection and convergence routing algorithm : design and performance.
In EUROPAR, volume 2400 of LNCS, pages 767-774. Springer, 2002.

20

C. Destré, C. Laforest, and S. Vial.
The broadcast assignment problem.
In Jop F. Sibeyn, editor, International colloquium on structural information and communication complexity (SIROCCO), number 10, pages 101-116. Carleton Scientific, 2003.

21

C. Destré, C. Laforest, and S. Vial.
Assignment of shortest paths spanning trees in meshes.
In International Parallel and Distributed Processing Symposium (IPDPS), 2004.

22

C. Destré, C. Laforest, and S. Vial.
Experimental Results of Cost Sharing for Broadcast Trees in Meshes.
In International Network Optimization Conference (INOC), 2005.

23

P. Fraigniaud and C. Laforest.
Disjoint spanning tree of small depth.
In Parallel computing: trends and applications, Actes de ParCo'93, pages 105-112, 1993.

24

S. Fujita, C. Laforest, and S. Perennes.
A gossip algorithm for bus networks with buses of limited length.
In EUROPAR, volume 1123 of LNCS, pages 353-360. Springer, 1996.

25

A. Irlande, J.-C. König, and C. Laforest.
Construction of low-cost and low-diameter steiner trees for multipoint groups.
In International colloquium on structural information and communication complexity (SIROCCO), pages 197-210. Carleton Scientific, 2000.

26

C. Laforest.
Construction of efficient communication sub-structures: Non-approximability results and polynomial sub-cases.
In EUROPAR, volume 2790 of LNCS, pages 903-910. Springer, 2003.

27

C. Laforest.
A good balance between weigth and distances for multipoint trees.
In 6th International Conference On Principles Of DIstributed Systems (OPODIS), pages 195-204, 2002.

28

C. Laforest.
Gossip in trees under line-communication mode.
In EUROPAR, volume 1123 of LNCS, pages 333-340. Springer, 1996.

29

C. Laforest, A.L. Liestman, T.C. Shermer, and D. Sotteau.
Edge-disjoint spanners of complete bipartite graphs (extended abstract).
In Proceedings of 30 th Hawaii International Conference on System Sciences, volume I, pages 191-199, 1999.

30

C. Laforest and S. Vial.
Short cut Eulerian routing of datagrams in all optical point-to-point networks.
In International Parallel and Distributed Processing Symposium (IPDPS), 2002.

31

N. Thibault and C. Laforest.
An optimal rebuilding strategy for a decremental problem.
International colloquium on structural information and communication complexity (SIROCCO), LNCS 4056, pages 157-170, 2006

32

N. Thibault and C. Laforest.
On-line Time-Constrained Scheduling Problem for the Size on $k$ Machines
In The International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), 2005.

33

N. Thibault and C. Laforest.
An optimal online strategy to increment connection trees.
In Workshop Adaptive Wireless Networks of Globecom, 2004.
(16 articles acceptés sur 61).

Conférences nationales.

34

F. Baille, E. Bampis, and C. Laforest.
Ordonnancements de tâches parallèles avec compromis entre la taille et le poids.
In Ecole d'automne de Recheche Opérationnelle (EARO), pages 81-85, 2003.

35

F. Baille, E. Bampis, and C. Laforest.
Rapports d'approximation effectifs d'ordonnacements bicritères d'intervalles sur des machines identiques.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 147-153. INRIA, 2003.

36

F. Baille, L. Blin and C. Lafores.
Algorithme distribué tricritère pour la construction de structures de connexions.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 45-48, INRIA, 2006.

37

F. Baille, E. Bampis, and C. Laforest and N. Thibault.
Algorithmes d'ordonnancements bicritères en-ligne.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 71-74. INRIA, 2005.

38

C. Destré, C. Laforest, and S. Vial.
Routage Eulérien dans les réseaux tout-optiques à multiplexage en longueur d'onde.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 49-57. INRIA, 2001.

39

A. Irlande, J.-C. König, and C. Laforest.
Incrémentalité pour l'arbre de steiner.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 173-178. INRIA, 2000.

40

C. Laforest and B. Rouits.
Le problème du $k$-fournisseur : technique d'approximation et aspect incrémental.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 95-100. INRIA, 2000.

41

N. Thibault and C. Laforest.
Ajouts et retraits dans un arbre de connexion.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 33-36, INRIA, 2006.

42

N. Thibault and C. Laforest.
Deux méthodes incrémentales pour le maintien d'un arbre de connexion.
In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 63-67 . INRIA, 2004.

43

N. Thibault and C. Laforest.
Algorithme incrémental pour le maintien d'un arbre de connexion.
In Rencontre du Parallélisme (RenPar), pages 27-34, 2003.

Autres.

44

A. Bouabdallah and C. Laforest.
A distributed token-based algorithm for the dynamic resource allocation problem.
Operating system review (ACM Press), 34(3):60-68, 2000.