| 2023 | SOFSEM | Introduction to Routing Problems with Mandatory Transitions. | Christian Laforest, Timothe Martinod |
| 2018 | COCOA | Graph Problems with Obligations. | Alexis Cornet, Christian Laforest |
| 2015 | SOFSEM | Nash-Williams-type and Chvtal-type Conditions in One-Conflict Graphs. | Christian Laforest, Benjamin Momge |
| 2014 | IWOCA | Some Hamiltonian Properties of One-Conflict Graphs. | Christian Laforest, Benjamin Momge |
| 2014 | OPODIS | Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. | Franois Delbot, Christian Laforest, Stephane Rovedakis |
| 2013 | IWOCA | New Approximation Algorithms for the Vertex Cover Problem. | Franois Delbot, Christian Laforest, Raksmey Phan |
| 2013 | SOFSEM | 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 Momge |
| 2013 | TAMC | Trees in Graphs with Conflict Edges or Forbidden Transitions. | Mamadou Moustapha Kant, Christian Laforest, Benjamin Momge |
| 2006 | EuroPar | Distributed Approximation Allocation Resources Algorithm for Connecting Groups. | Fabien Baille, Llia Blin, Christian Laforest |
| 2006 | SIROCCO | An Optimal Rebuilding Strategy for a Decremental Tree Problem. | Nicolas Thibault, Christian Laforest |
| 2005 | COCOON | On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. | Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault |
| 2005 | EuroPar | On-Line Bicriteria Interval Scheduling. | Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault |
| 2004 | COCOON | Maximization of the Size and the Weight of Schedules of Degradable Intervals. | Fabien Baille, Evripidis Bampis, Christian Laforest |
| 2003 | EuroPar | Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases. | Christian Laforest |
| 2003 | SIROCCO | The Broadcast Assignment Problem. | Christian Destr, Christian Laforest, Sandrine Vial |
| 2002 | EuroPar | A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. | Dominique Barth, Pascal Berthom, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial |
| 2002 | OPODIS | A good balance between weight and distances for multipoint trees. | Christian Laforest |
| 2000 | SIROCCO | Construction of low-cost and low-diameter Steiner trees for multipoint groups. | Alexis Irlande, Jean-Claude Knig, Christian Laforest |
| 1996 | EuroPar | A Gossip Algorithm for Bus Networks with Buses of Limited Length. | Satoshi Fujita, Christian Laforest, Stephane Perennes |
| 1996 | EuroPar | Gossip in Trees under Line-Communication Mode. | Christian Laforest |