C. Laforest

发表

Edge-disjoint spanners of complete graphs and complete digraphs

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

Hardness Results and Approximation Algorithms for Discrete Optimization Problems with Conditional and Unconditional Forbidden Vertices

C. Laforest, François Delbot, Raksmey Phan, 2016 .

Minimizing the number of critical stages for the on-line steiner tree problem

C. Laforest, N. Thibault, 2007 .

Mémoire d’habilitation à diriger des recherches Studying Graphs: Structure via Rank-Width, and Listing of Minimal Dominating Sets

M. Habib, B. Courcelle, F. Fomin, 2016 .

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

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

A new lower bound on the independence number of graphs

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

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..

Graph Problems with Obligations

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

Trees in Graphs with Conflict Edges or Forbidden Transitions

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

Hardness Results and Heuristic for Multi-groups Interconnection

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

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

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

Mean analysis of an online algorithm for the vertex cover problem

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

An Optimal Rebuilding Strategy for an Incremental Tree Problem

C. Laforest, N. Thibault, 2007, J. Interconnect. Networks.

Distributed Approximation Allocation Resources Algorithm for Connecting Groups

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

An Optimal Rebuilding Strategy for a Decremental Tree Problem

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

Constructing Incremental Sequences in Graphs

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

An optimal online strategy to increment connection trees

C. Laforest, N. Thibault, C. Laforest, 2004, IEEE Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004..

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

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

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

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

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.

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

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

Some Hamiltonian Properties of One-Conflict Graphs

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

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

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

Broadcast and Gossip in Line-communication Mode

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

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

P. Berthome, D. Chiaroni, D. Barth, 2009, IEEE/OSA Journal of Optical Communications and Networking.

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

Dominique Barth, Christian Laforest, Emmanuel Dotaro, 2001 .

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.

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.

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

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

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

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

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

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