Publications (Christian Laforest)

Sorted by type and by (decreasing) date. Back to my page

Vulgarisation scientifique (in French)

C. Laforest, "Un glouton, une couverture, un million de dollars", Magazine Tangente, num. 163, 2015 (article primé au concours "trophées tangente" en 2014).
C. Laforest, "À la recherche des copains", Magazine Tangente, num. 173, p. 18-20, 2016.
C. Laforest, "Langages formels et automates", Magazine Tangente, num. 174, p. 20-21, 2017.
C. Laforest, "Les algorithmes en ligne (prendre des décisions sans connaitre l'avenir)", Magazine Tangente, num. 176, p. 44-47, 2017 (Prix tangente du meilleur article en 2015 au concours des "trophées tangente").
C. Laforest "À la découverte des graphes et des algorithmes de graphes". Livre publié chez EDP-sciences début 2017 (ma page web du livre ici).

International journals

A. Cornet, C. Laforest, Domination problems with no conflicts, Discrete applied math., 244, P. 78-88, 2018.
A. Cornet, C. Laforest, Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2017, Vol 19 no. 3 (3). hal-01455072v3.
C. Laforest, R. Phan, Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic. RAIRO-RO, vol. 47, num. 3, pages 199-221. 2013.
E. Angel, R. Campigotto, C. Laforest. A New Lower Bound on the Independence Number of Graphs. Discrete Applied Mathematics, 161, pp. 847-852, 2013.
E. Angel, R. Campigotto, C. Laforest. Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities. Algorithmic Operations Research (AOR). Vol. 6, pages 56–67. Mars 2011.
F. Delbot and C. Laforest. Analytical and experimental comparison of six algorithms for the vertex cover. (ACM) Journal of Experimental Algorithmics,Volume 15, 2010.
L. Blin, C. Laforest, S. Rovedakis, and N. Thibault. Hardness Results and Heuristic for Multi-groups Interconnection. The computer Journal. 53 (9): 1497-1507, 2010.
E. Birmelé, F. Delbot and C. Laforest. Mean analysis of an online algorithm for the vertex cover problem. Information Processing Letters. Vol 109, Issue 9. Pages 436-439, 2009.
D. Barth, P. Berthomé, D. Chiaroni, J.-M. Fourneau, C. Laforest, S. Vial. Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks. Journal of Optical Communications and Networking, Vol. 1 Issue 3, pp.222-234, 2009.
F. Delbot and C. Laforest. A better list heuristic for vertex cover. Information Processing Letters, Vol 107. Issue 3-4,Pages 125-127, 2008.
F. Baille, E. Bampis, and C. Laforest and C. Rapine. Bicriteria Scheduling for Contiguous and Non-Contiguous Parallel Tasks. Annals of operation research. Volume 159, Number 1, 97-106, 2008.
N. Thibault and C. Laforest. An optimal rebuilding strategy for an incremental tree problem. Journal of Interconnection Networks, 75-99, Vol. 8, No. 1, 2007.
R. Klasing, C. Laforest, J. Peters and N. Thibault. Constructing Incremental Sequences in Graphs. Algorithmic Operations Research, Vol 1, No 2, 2006.
R. Klasing and C. Laforest. Hardness results and approximation algorithms of $k$-tuple domination in graphs. Information Processing Letters, 89:75--83, 2004.
F. Baille, E. Bampis, and C. Laforest. A note on bicriteria schedules with optimal approximation ratios. Parallel Processing Letters, 14(2):315--323, 2004.
C. Laforest, A.L. Liestman, T.C. Shermer, and D. Sotteau. Edge-disjoint spanners of complete bipartite graphs. Discrete Mathematics, 234:65--76, 2001.
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. Hebuterne, 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.
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.
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.
C. Laforest. Broadcast and gossip in line-communication mode. Discrete Applied Mathematics, 80:161--176, 1997.
P. Fraigniaud and C. Laforest. Minimum gossip bus networks. Networks, 27:239--251, 1996.

National Journals

E. Birmelé, F. Delbot et C. Laforest. Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre. Technique et Science Informatiques. Vol. 30, No. 7:781-808, 2011.

International Conferences

A. Cornet, Ch. Laforest. Graph problems with obligations. Donghyun Kim and R. N. Uma and Alexander Zelikovsky. Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Dec 2018, Atlanta, United States. Springer, LNCS 11346, pp.183--197, 2018, Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings.
Ch. Laforest and B. Momège. Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs. SOFSEM 2015, 2015, Snezkou, Czech Republic. Springer, LNCS 8939, pp.327-338, 2015, SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science.
Ch. Laforest and B. Momège. Some hamiltonian properties of one-conflict graphs. Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, 2014, Duluth, United States. Springer, pp.262--273.
F. Delbot, S. Rovedakis, Ch. Laforest. Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. December 2014, Vol. 8878, pp.307--322, SeriesLecture Notes in Computer Science.
Delbot, Ch. Laforest and R. Phan. New Approximation Algorithms for the Vertex Cover Problem. IWOCA 2013. Vol. LNCS 8288 pages 438-442.
M. Kante, C. Laforest and B. Momege. Trees in Graphs with conflict edges or forbidden transitions. TAMC 2013. Vol. LNCS 7876, pages 343-354.
M. Kante, C. Laforest and B. Momege. An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. SOFSEM 2013. Vol. LNCS 7741, pages 257-267.
E. Angel, R. Campigotto, C. Laforest, Implementation and comparison of Heuristics for the vertex cover problem on huge graphs. 11th International Symposium on Experimental Algorithms (SEA). Vol. LNCS 7276, pages 39–50. Bordeaux, 7–9 juin 2012.
N. Thibault and C. Laforest. Online time constrained scheduling with penalties. In IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2009.
F. Baille, L. Blin, C. Laforest. Distributed Approximation Allocation Ressources Algorithm for Connecting Groups. Euro-par 2006, LNCS 4128, pages 519-529, 2006.
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
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.
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.
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.
C. Destré, C. Laforest, and S. Vial. Experimental Results of Cost Sharing for Broadcast Trees in Meshes. In International Network Optimization Conference (INOC), 2005.
N. Thibault and C. Laforest. On-line Time-Constrained Scheduling Problem for the Size on $k$ Machines InThe International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), 2005.
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.
C. Destré, C. Laforest, and S. Vial. Assignment of shortest paths spanning trees in meshes. In International Parallel and Distributed Processing Symposium (IPDPS), 2004.
N. Thibault and C. Laforest. An optimal online strategy to increment connection trees. In Workshop Adaptive Wireless Networks of Globecom, 2004.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
C. Laforest. Gossip in trees under line-communication mode. In EUROPAR, volume 1123 of LNCS, pages 333--340. Springer, 1996.
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.

National conferences (old papers)

. Angel, R. Campigotto et C. Laforest. Mise en œuvre d'heuristiques capables de traiter de très grands graphes pour le problème du Vertex Cover. 13ème Congrès de la Société Française en Recherche Opérationnelle (ROADEF). Université Catholique de l'Ouest, Angers, 11–13 avril 2012.
C. Laforest, R. Phan, Résolution exacte du minimum independant set problem. ROADEF 2012.
F. Delbot et C. Laforest. Comparaison d'algorithmes pour le problème du vertex cover. ROADEF 2011.
E. Angel, R. Campigotto et C. Laforest. Comparaison d'algorithmes pour le problème du Vertex Cover sur de grands graphes (résumé de 2 pages). Congrès de la Société Française en Recherche Opérationnelle (ROADEF) 2010. Université Toulouse 1 Capitole, 24–26 février 2010.
L. Blin and C. Laforest and S. Rovedakis and N. Thibault. Interconnextion multi-groupes. In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 41-44, INRIA, 2007.
F. Delbot and C. Laforest and N. Thibault. Evaluation en moyenne d'un algorithme pour la mise à jour d'un arbre de connexion. In Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel), pages 95-98, INRIA, 2007.
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.
F. Baille, L. Blin and C. Laforest. 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.
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.
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.
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.
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.
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.
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.
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.
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.

Other

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.

Google Sites

Report abuse