Christian Laforest

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 5

Top Topics

Approximation Algorithms

Top Venues

Discret. Appl. Math.

Publications

Christian Laforest, Timothée Martinod
Introduction to Routing Problems with Mandatory Transitions. SOFSEM (2023)
Christian Laforest, Timothée Martinod
On the complexity of independent dominating set with obligations in graphs. Theor. Comput. Sci. 904 (2022)
Alexis Cornet, Christian Laforest
Domination problems with no conflicts. Discret. Appl. Math. 244 (2018)
Alexis Cornet, Christian Laforest
Graph Problems with Obligations. COCOA (2018)
Alexis Cornet, Christian Laforest
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Christian Laforest, Benjamin Momège
Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs. SOFSEM (2015)
Christian Laforest, Benjamin Momège
Some Hamiltonian Properties of One-Conflict Graphs. IWOCA (2014)
François Delbot, Christian Laforest, Stephane Rovedakis
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. OPODIS (2014)
François Delbot, Christian Laforest, Stephane Rovedakis
Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems. CoRR (2014)
Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège
Trees in Graphs with Conflict Edges or Forbidden Transitions. TAMC (2013)
Christian Laforest, Raksmey Phan
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic. RAIRO Oper. Res. 47 (3) (2013)
Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. SOFSEM (2013)
François Delbot, Christian Laforest, Raksmey Phan
New Approximation Algorithms for the Vertex Cover Problem. IWOCA (2013)
Eric Angel, Romain Campigotto, Christian Laforest
A new lower bound on the independence number of graphs. Discret. Appl. Math. 161 (6) (2013)
Eric Angel, Romain Campigotto, Christian Laforest
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. SEA (2012)
Etienne Birmelé, François Delbot, Christian Laforest, Nicolas Thibault
Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre. Tech. Sci. Informatiques 30 (7) (2011)
Eric Angel, Romain Campigotto, Christian Laforest
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities. Algorithmic Oper. Res. 6 (1) (2011)
François Delbot, Christian Laforest
Analytical and experimental comparison of six algorithms for the vertex cover problem. ACM J. Exp. Algorithmics 15 (2010)
Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault
Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. 53 (9) (2010)
Dominique Barth, Pascal Berthomé, Dominique Chiaroni, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial
Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks. JOCN 1 (3) (2009)
Etienne Birmelé, François Delbot, Christian Laforest
Mean analysis of an online algorithm for the vertex cover problem. Inf. Process. Lett. 109 (9) (2009)
Nicolas Thibault, Christian Laforest
Online time constrained scheduling with penalties. IPDPS (2009)
Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine
Bicriteria scheduling for contiguous and non contiguous parallel tasks. Ann. Oper. Res. 159 (1) (2008)
François Delbot, Christian Laforest
A better list heuristic for vertex cover. Inf. Process. Lett. 107 (3-4) (2008)
Nicolas Thibault, Christian Laforest
An Optimal Rebuilding Strategy for an Incremental Tree Problem. J. Interconnect. Networks 8 (1) (2007)
Nicolas Thibault, Christian Laforest
An Optimal Rebuilding Strategy for a Decremental Tree Problem. SIROCCO (2006)
Fabien Baille, Lélia Blin, Christian Laforest
Distributed Approximation Allocation Resources Algorithm for Connecting Groups. Euro-Par (2006)
Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault
Constructing Incremental Sequences in Graphs. Algorithmic Oper. Res. 1 (2) (2006)
Nicolas Thibault, Christian Laforest
On-line Time-Constrained Scheduling Problem for the Size on kappa machines. ISPAN (2005)
Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. COCOON (2005)
Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
On-Line Bicriteria Interval Scheduling. Euro-Par (2005)
Fabien Baille, Evripidis Bampis, Christian Laforest
Maximization of the Size and the Weight of Schedules of Degradable Intervals. COCOON (2004)
Ralf Klasing, Christian Laforest
Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89 (2) (2004)
Christian Destré, Christian Laforest, Sandrine Vial
Assignment of Shortest Paths Spanning Trees in Meshes. IPDPS (2004)
Fabien Baille, Evripidis Bampis, Christian Laforest
A Note On Bicriteria Schedules With Optimal Approximations Ratios. Parallel Process. Lett. 14 (2) (2004)
Christian Laforest
Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases. Euro-Par (2003)
Christian Destré, Christian Laforest, Sandrine Vial
The Broadcast Assignment Problem. SIROCCO (2003)
Christian Laforest
A good balance between weight and distances for multipoint trees. OPODIS (2002)
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)
Christian Laforest, Sandrine Vial
Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks. IPDPS (2002)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge-disjoint spanners of complete bipartite graphs. Discret. Math. 234 (1-3) (2001)
Abdelmadjid Bouabdallah, Christian Laforest
A Distributed token/based Algorithm for the Dynamic Resource Allocation Problem. ACM SIGOPS Oper. Syst. Rev. 34 (3) (2000)
Alexis Irlande, Jean-Claude König, Christian Laforest
Construction of low-cost and low-diameter Steiner trees for multipoint groups. SIROCCO (2000)
Dominique Barth, Christian Laforest
Scattering and multi-scattering in trees and meshes, with local routing and without buffering. Parallel Comput. 25 (8) (1999)
Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. 203 (1-3) (1999)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) (1997)
Christian Laforest
Broadcast and Gossip in Line-communication Mode. Discret. Appl. Math. 80 (2-3) (1997)
Christian Laforest
Gossip in Trees under Line-Communication Mode. Euro-Par, Vol. I (1996)
Pierre Fraigniaud, Christian Laforest
Minimum gossip bus networks. Networks 27 (4) (1996)
Satoshi Fujita, Christian Laforest, Stephane Perennes
A Gossip Algorithm for Bus Networks with Buses of Limited Length. Euro-Par, Vol. I (1996)
Pierre Fraigniaud, Christian Laforest
Disjoint Spanning Trees of Small Depth. PARCO (1993)