Christian Laforest

发表

A Note On Bicriteria Schedules With Optimal Approximations Ratios

Evripidis Bampis, Fabien Baille, Christian Laforest, 2004, Parallel Process. Lett..

Edge disjoint graph spanners of complete graphs and complete digraphs

Arthur L. Liestman, Thomas C. Shermer, Christian Laforest, 1997, Proceedings of the Thirtieth Hawaii International Conference on System Sciences.

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions

Christian Laforest, Mamadou Moustapha Kanté, Benjamin Momège, 2013, SOFSEM.

Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems pdf

Christian Laforest, Stephane Rovedakis, François Delbot, 2014, OPODIS.

Construction of low-cost and low-diameter Steiner trees for multipoint groups

Jean-Claude König, Christian Laforest, Alexis Irlande, 2000, SIROCCO.

The Broadcast Assignment Problem

Christian Laforest, Christian Destré, Sandrine Vial, 2003, SIROCCO.

A distributed token-based algorithm for the dynamic resource allocation problem

Abdelmadjid Bouabdallah, Christian Laforest, 2000, OPSR.

An Optimal Rebuilding Strategy for a Decremental Tree Problem

Christian Laforest, Nicolas Thibault, C. Laforest, 2006, SIROCCO.

Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities

Christian Laforest, Eric Angel, Romain Campigotto, 2011, Algorithmic Oper. Res..

Hardness results and approximation algorithms of k-tuple domination in graphs

Christian Laforest, Ralf Klasing, R. Klasing, 2004, Inf. Process. Lett..

A new lower bound on the independence number of graphs

Christian Laforest, Eric Angel, Romain Campigotto, 2013, Discret. Appl. Math..

A Gossip Algorithm for Bus Networks with Buses of Limited Length

Satoshi Fujita, Stéphane Pérennes, Christian Laforest, 1996, Euro-Par, Vol. I.

Mean analysis of an online algorithm for the vertex cover problem

Christian Laforest, Etienne Birmelé, François Delbot, 2009, Inf. Process. Lett..

Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre

Christian Laforest, Etienne Birmelé, François Delbot, 2011, Tech. Sci. Informatiques.

Maximization of the Size and the Weight of Schedules of Degradable Intervals

Evripidis Bampis, Fabien Baille, Christian Laforest, 2004, COCOON.

Hardness Results and Heuristic for Multi-groups Interconnection

Christian Laforest, Stephane Rovedakis, Lélia Blin, 2010, Comput. J..

On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules

Evripidis Bampis, Fabien Baille, Christian Laforest, 2005, COCOON.

Analytical and experimental comparison of six algorithms for the vertex cover problem

Christian Laforest, François Delbot, 2010, ACM J. Exp. Algorithmics.

Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs

Christian Laforest, Benjamin Momège, C. Laforest, 2015, SOFSEM.

Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases

Christian Laforest, C. Laforest, 2003, Euro-Par.

Short cut Eulerian routing of datagrams in all optical point-to-point networks

Christian Laforest, Sandrine Vial, 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

Graph Problems with Obligations

Christian Laforest, Alexis Cornet, C. Laforest, 2018, COCOA.

A good balance between weight and distances for multipoint trees

Christian Laforest, 2002, OPODIS.

Bicriteria scheduling for contiguous and non contiguous parallel tasks

Evripidis Bampis, Fabien Baille, Christian Laforest, 2008, Ann. Oper. Res..

On-Line Bicriteria Interval Scheduling

Evripidis Bampis, Fabien Baille, Christian Laforest, 2005, Euro-Par.

Some Hamiltonian Properties of One-Conflict Graphs

Christian Laforest, Benjamin Momège, C. Laforest, 2014, IWOCA.

Edge-disjoint spanners of complete bipartite graphs

Arthur L. Liestman, Thomas C. Shermer, Christian Laforest, 2001, Discret. Math..

Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic

Christian Laforest, Raksmey Phan, 2013, RAIRO Oper. Res..

Minimum gossip bus networks

Pierre Fraigniaud, Christian Laforest, 1996 .

Online time constrained scheduling with penalties

Christian Laforest, Nicolas Thibault, 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

New Approximation Algorithms for the Vertex Cover Problem

Christian Laforest, Raksmey Phan, François Delbot, 2013, IWOCA.

A Mixed Deflection and Convergence Routing Algorithm: Design and Performance

Dominique Barth, Jean-Michel Fourneau, Christian Laforest, 2002, Euro-Par.

Multiservice optical network: main concepts and first achievements of the ROM program

Dominique Barth, Christian Laforest, Emmanuel Dotaro, 2001 .

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs

Christian Laforest, Eric Angel, Romain Campigotto, 2012, SEA.

Assignment of shortest paths spanning trees in meshes

Christian Laforest, Christian Destré, Sandrine Vial, 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

Minimum gossip bus networks

Pierre Fraigniaud, Christian Laforest, 1996, Networks.

Domination problems with no conflicts

Christian Laforest, Alexis Cornet, 2018, Discret. Appl. Math..

Edge-disjoint spanners of complete graphs and complete digraphs

Arthur L. Liestman, David Peleg, Thomas C. Shermer, 1999, Discret. Math..

Distributed Approximation Allocation Resources Algorithm for Connecting Groups

Fabien Baille, Christian Laforest, Lélia Blin, 2006, Euro-Par.

Constructing Incremental Sequences in Graphs

Christian Laforest, Ralf Klasing, Joseph G. Peters, 2006, Algorithmic Oper. Res..

Broadcast and Gossip in Line-communication Mode

Christian Laforest, C. Laforest, 1997, Discret. Appl. Math..

Gossip in Trees under Line-Communication Mode

Christian Laforest, 1996, Euro-Par, Vol. I.

Scattering and multi-scattering in trees and meshes, with local routing and without buffering

Dominique Barth, Christian Laforest, D. Barth, 1999, Parallel Comput..

Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts

Christian Laforest, Alexis Cornet, 2017, Discret. Math. Theor. Comput. Sci..

Experimental Results of Cost Sharing for Broadcast Trees in Meshes

Christian Laforest, Sandrine Vial, Christian Destré, 2005 .

Disjoint Spanning Trees of Small Depth

Pierre Fraigniaud, Christian Laforest, 1993, PARCO.

Trees in Graphs with Conflict Edges or Forbidden Transitions

Christian Laforest, Mamadou Moustapha Kanté, Benjamin Momège, 2013, TAMC.

On-line Time-Constrained Scheduling Problem for the Size on \kappa machines

Christian Laforest, Nicolas Thibault, 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

A better list heuristic for vertex cover

Christian Laforest, François Delbot, 2008, Inf. Process. Lett..

On the complexity of independent dominating set with obligations in graphs

Christian Laforest, Timothée Martinod, 2021 .

Graphs with Forbidden and Required Vertices

Christian Laforest, Raksmey Phan, François Delbot, 2015 .

Analytical and experimental comparison of six algorithms for the vertex cover problem

Christian Laforest, François Delbot, C. Laforest, 2010, JEAL.