default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Laforest
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c27]Christian Laforest, Timothée Martinod:
Introduction to Routing Problems with Mandatory Transitions. SOFSEM 2023: 254-266- 2022
- [j23]Christian Laforest, Timothée Martinod:
On the complexity of independent dominating set with obligations in graphs. Theor. Comput. Sci. 904: 1-14 (2022)
2010 – 2019
- 2018
- [j22]Alexis Cornet, Christian Laforest:
Domination problems with no conflicts. Discret. Appl. Math. 244: 78-88 (2018) - [c26]Alexis Cornet, Christian Laforest:
Graph Problems with Obligations. COCOA 2018: 183-197 - 2017
- [j21]Alexis Cornet, Christian Laforest:
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - 2015
- [c25]Christian Laforest, Benjamin Momège:
Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs. SOFSEM 2015: 327-338 - 2014
- [c24]Christian Laforest, Benjamin Momège:
Some Hamiltonian Properties of One-Conflict Graphs. IWOCA 2014: 262-273 - [c23]François Delbot, Christian Laforest, Stephane Rovedakis:
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. OPODIS 2014: 307-322 - [i1]François Delbot, Christian Laforest, Stephane Rovedakis:
Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems. CoRR abs/1408.2116 (2014) - 2013
- [j20]Eric Angel, Romain Campigotto, Christian Laforest:
A new lower bound on the independence number of graphs. Discret. Appl. Math. 161(6): 847-852 (2013) - [j19]Christian Laforest, Raksmey Phan:
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic. RAIRO Oper. Res. 47(3): 199-221 (2013) - [c22]François Delbot, Christian Laforest, Raksmey Phan:
New Approximation Algorithms for the Vertex Cover Problem. IWOCA 2013: 438-442 - [c21]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: 257-267 - [c20]Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège:
Trees in Graphs with Conflict Edges or Forbidden Transitions. TAMC 2013: 343-354 - 2012
- [c19]Eric Angel, Romain Campigotto, Christian Laforest:
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. SEA 2012: 39-50 - 2011
- [j18]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): 56-67 (2011) - [j17]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): 781-808 (2011) - 2010
- [j16]Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault:
Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. 53(9): 1497-1507 (2010) - [j15]François Delbot, Christian Laforest:
Analytical and experimental comparison of six algorithms for the vertex cover problem. ACM J. Exp. Algorithmics 15 (2010)
2000 – 2009
- 2009
- [j14]Etienne Birmelé, François Delbot, Christian Laforest:
Mean analysis of an online algorithm for the vertex cover problem. Inf. Process. Lett. 109(9): 436-439 (2009) - [j13]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): 222-234 (2009) - [c18]Nicolas Thibault, Christian Laforest:
Online time constrained scheduling with penalties. IPDPS 2009: 1-8 - 2008
- [j12]Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine
:
Bicriteria scheduling for contiguous and non contiguous parallel tasks. Ann. Oper. Res. 159(1): 97-106 (2008) - [j11]François Delbot, Christian Laforest:
A better list heuristic for vertex cover. Inf. Process. Lett. 107(3-4): 125-127 (2008) - 2007
- [j10]Nicolas Thibault, Christian Laforest:
An Optimal Rebuilding Strategy for an Incremental Tree Problem. J. Interconnect. Networks 8(1): 75-99 (2007) - 2006
- [j9]Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault:
Constructing Incremental Sequences in Graphs. Algorithmic Oper. Res. 1(2) (2006) - [c17]Fabien Baille, Lélia Blin, Christian Laforest:
Distributed Approximation Allocation Resources Algorithm for Connecting Groups. Euro-Par 2006: 519-529 - [c16]Nicolas Thibault, Christian Laforest:
An Optimal Rebuilding Strategy for a Decremental Tree Problem. SIROCCO 2006: 157-170 - 2005
- [c15]Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault:
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. COCOON 2005: 308-317 - [c14]Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault:
On-Line Bicriteria Interval Scheduling. Euro-Par 2005: 312-322 - [c13]Nicolas Thibault, Christian Laforest:
On-line Time-Constrained Scheduling Problem for the Size on kappa machines. ISPAN 2005: 20-24 - 2004
- [j8]Ralf Klasing, Christian Laforest:
Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2): 75-83 (2004) - [j7]Fabien Baille, Evripidis Bampis, Christian Laforest:
A Note On Bicriteria Schedules With Optimal Approximations Ratios. Parallel Process. Lett. 14(2): 315-323 (2004) - [c12]Fabien Baille, Evripidis Bampis, Christian Laforest:
Maximization of the Size and the Weight of Schedules of Degradable Intervals. COCOON 2004: 219-228 - [c11]Christian Destré, Christian Laforest, Sandrine Vial:
Assignment of Shortest Paths Spanning Trees in Meshes. IPDPS 2004 - 2003
- [c10]Christian Laforest:
Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases. Euro-Par 2003: 903-910 - [c9]Christian Destré, Christian Laforest, Sandrine Vial:
The Broadcast Assignment Problem. SIROCCO 2003: 101-116 - 2002
- [c8]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: 767-774 - [c7]Christian Laforest, Sandrine Vial:
Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks. IPDPS 2002 - [c6]Christian Laforest:
A good balance between weight and distances for multipoint trees. OPODIS 2002: 193-202 - 2001
- [j6]Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau:
Edge-disjoint spanners of complete bipartite graphs. Discret. Math. 234(1-3): 65-76 (2001) - 2000
- [j5]Abdelmadjid Bouabdallah, Christian Laforest:
A Distributed token/based Algorithm for the Dynamic Resource Allocation Problem. ACM SIGOPS Oper. Syst. Rev. 34(3): 60-68 (2000) - [c5]Alexis Irlande, Jean-Claude König, Christian Laforest:
Construction of low-cost and low-diameter Steiner trees for multipoint groups. SIROCCO 2000: 197-210
1990 – 1999
- 1999
- [j4]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): 133-159 (1999) - [j3]Dominique Barth, Christian Laforest:
Scattering and multi-scattering in trees and meshes, with local routing and without buffering. Parallel Comput. 25(8): 1035-1057 (1999) - 1997
- [j2]Christian Laforest:
Broadcast and Gossip in Line-communication Mode. Discret. Appl. Math. 80(2-3): 161-176 (1997) - [c4]Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau:
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) 1997: 191-199 - 1996
- [j1]Pierre Fraigniaud, Christian Laforest:
Minimum gossip bus networks. Networks 27(4): 239-251 (1996) - [c3]Christian Laforest:
Gossip in Trees under Line-Communication Mode. Euro-Par, Vol. I 1996: 333-340 - [c2]Satoshi Fujita, Christian Laforest, Stephane Perennes:
A Gossip Algorithm for Bus Networks with Buses of Limited Length. Euro-Par, Vol. I 1996: 353-360 - 1993
- [c1]Pierre Fraigniaud, Christian Laforest:
Disjoint Spanning Trees of Small Depth. PARCO 1993: 105-112
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
