Christian Laforest

According to our database, Christian Laforest authored at least 50 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Introduction to Routing Problems with Mandatory Transitions.

Christian Laforest, Timothée Martinod

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022

On the complexity of independent dominating set with obligations in graphs.

Christian Laforest, Timothée Martinod

Theor. Comput. Sci., 2022

2018

Domination problems with no conflicts.

Alexis Cornet, Christian Laforest

Discret. Appl. Math., 2018

Graph Problems with Obligations.

Alexis Cornet, Christian Laforest

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts.

Alexis Cornet, Christian Laforest

Discret. Math. Theor. Comput. Sci., 2017

2015

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

Christian Laforest, Benjamin Momège

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

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

François Delbot, Christian Laforest, Stephane Rovedakis

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Some Hamiltonian Properties of One-Conflict Graphs.

Christian Laforest, Benjamin Momège

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

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

Christian Laforest, Raksmey Phan

RAIRO Oper. Res., 2013

A new lower bound on the independence number of graphs.

Eric Angel, Romain Campigotto, Christian Laforest

Discret. Appl. Math., 2013

Trees in Graphs with Conflict Edges or Forbidden Transitions.

Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège

Proceedings of the Theory and Applications of Models of Computation, 2013

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

Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

New Approximation Algorithms for the Vertex Cover Problem.

François Delbot, Christian Laforest, Raksmey Phan

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

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

Eric Angel, Romain Campigotto, Christian Laforest

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

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

Etienne Birmelé, François Delbot, Christian Laforest, Nicolas Thibault

Tech. Sci. Informatiques, 2011

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

Eric Angel, Romain Campigotto, Christian Laforest

Algorithmic Oper. Res., 2011

2010

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

François Delbot, Christian Laforest

ACM J. Exp. Algorithmics, 2010

Hardness Results and Heuristic for Multi-groups Interconnection.

Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault

Comput. J., 2010

2009

Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks.

Dominique Barth, Pascal Berthomé, Dominique Chiaroni, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial

JOCN, 2009

Mean analysis of an online algorithm for the vertex cover problem.

Etienne Birmelé, François Delbot, Christian Laforest

Inf. Process. Lett., 2009

Online time constrained scheduling with penalties.

Nicolas Thibault, Christian Laforest

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

A better list heuristic for vertex cover.

François Delbot, Christian Laforest

Inf. Process. Lett., 2008

Bicriteria scheduling for contiguous and non contiguous parallel tasks.

Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine

Ann. Oper. Res., 2008

2007

An Optimal Rebuilding Strategy for an Incremental Tree Problem.

Nicolas Thibault, Christian Laforest

J. Interconnect. Networks, 2007

2006

Constructing Incremental Sequences in Graphs.

Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault

Algorithmic Oper. Res., 2006

An Optimal Rebuilding Strategy for a Decremental Tree Problem.

Nicolas Thibault, Christian Laforest

Proceedings of the Structural Information and Communication Complexity, 2006

Distributed Approximation Allocation Resources Algorithm for Connecting Groups.

Fabien Baille, Lélia Blin, Christian Laforest

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005

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

Nicolas Thibault, Christian Laforest

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

On-Line Bicriteria Interval Scheduling.

Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

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

Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

A Note On Bicriteria Schedules With Optimal Approximations Ratios.

Fabien Baille, Evripidis Bampis, Christian Laforest

Parallel Process. Lett., 2004

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

Ralf Klasing, Christian Laforest

Inf. Process. Lett., 2004

Assignment of Shortest Paths Spanning Trees in Meshes.

Christian Destré, Christian Laforest, Sandrine Vial

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

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

Fabien Baille, Evripidis Bampis, Christian Laforest

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

The Broadcast Assignment Problem.

Christian Destré, Christian Laforest, Sandrine Vial

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

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

Christian Laforest

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002

A good balance between weight and distances for multipoint trees.

Christian Laforest

Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks.

Christian Laforest, Sandrine Vial

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

A Mixed Deflection and Convergence Routing Algorithm: Design and Performance.

Dominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial

Proceedings of the Euro-Par 2002, 2002

2001

Edge-disjoint spanners of complete bipartite graphs.

Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau

Discret. Math., 2001

2000

A Distributed token/based Algorithm for the Dynamic Resource Allocation Problem.

Abdelmadjid Bouabdallah, Christian Laforest

ACM SIGOPS Oper. Syst. Rev., 2000

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

Alexis Irlande, Jean-Claude König, Christian Laforest

Proceedings of the SIROCCO 7, 2000

1999

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

Dominique Barth, Christian Laforest

Parallel Comput., 1999

Edge-disjoint spanners of complete graphs and complete digraphs.

Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau

Discret. Math., 1999

1997

Broadcast and Gossip in Line-communication Mode.

Christian Laforest

Discret. Appl. Math., 1997

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.

Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996

Minimum gossip bus networks.

Pierre Fraigniaud, Christian Laforest

Networks, 1996

Gossip in Trees under Line-Communication Mode.

Christian Laforest

Proceedings of the Euro-Par '96 Parallel Processing, 1996

A Gossip Algorithm for Bus Networks with Buses of Limited Length.

Satoshi Fujita, Christian Laforest, Stephane Perennes

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1993

Disjoint Spanning Trees of Small Depth.

Pierre Fraigniaud, Christian Laforest

Proceedings of the Parallel Computing: Trends and Applications, 1993