Christian Laforest

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