The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Christian Laforest: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fabien Baille, Evripidis Bampis, Christian Laforest
    Maximization of the Size and the Weight of Schedules of Degradable Intervals. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:219-228 [Conf]
  2. Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
    On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:308-317 [Conf]
  3. Fabien Baille, Lélia Blin, Christian Laforest
    Distributed Approximation Allocation Resources Algorithm for Connecting Groups. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:519-529 [Conf]
  4. Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
    On-Line Bicriteria Interval Scheduling. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:312-322 [Conf]
  5. Dominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial
    A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:767-774 [Conf]
  6. Satoshi Fujita, Christian Laforest, Stephane Perennes
    A Gossip Algorithm for Bus Networks with Buses of Limited Length. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:353-360 [Conf]
  7. Christian Laforest
    Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:903-910 [Conf]
  8. Christian Laforest
    Gossip in Trees under Line-Communication Mode. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:333-340 [Conf]
  9. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
    Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:191-199 [Conf]
  10. Christian Destré, Christian Laforest, Sandrine Vial
    Assignment of Shortest Paths Spanning Trees in Meshes. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  11. Christian Laforest, Sandrine Vial
    Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  12. Christian Laforest
    A good balance between weight and distances for multipoint trees. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2002, pp:193-202 [Conf]
  13. Pierre Fraigniaud, Christian Laforest
    Disjoint Spanning Trees of Small Depth. [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:105-112 [Conf]
  14. Christian Destré, Christian Laforest, Sandrine Vial
    The Broadcast Assignment Problem. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:101-116 [Conf]
  15. Alexis Irlande, Jean-Claude König, Christian Laforest
    Construction of low-cost and low-diameter Steiner trees for multipoint groups. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:197-210 [Conf]
  16. Nicolas Thibault, Christian Laforest
    An Optimal Rebuilding Strategy for a Decremental Tree Problem. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:157-170 [Conf]
  17. Christian Laforest
    Broadcast and Gossip in Line-communication Mode. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:161-176 [Journal]
  18. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
    Edge-disjoint spanners of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:65-76 [Journal]
  19. Ralf Klasing, Christian Laforest
    Hardness results and approximation algorithms of k-tuple domination in graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:2, pp:75-83 [Journal]
  20. Pierre Fraigniaud, Christian Laforest
    Minimum gossip bus networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:239-251 [Journal]
  21. Dominique Barth, Christian Laforest
    Scattering and multi-scattering in trees and meshes, with local routing and without buffering. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1999, v:25, n:8, pp:1035-1057 [Journal]
  22. Fabien Baille, Evripidis Bampis, Christian Laforest
    A Note On Bicriteria Schedules With Optimal Approximations Ratios. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:2, pp:315-323 [Journal]
  23. Abdelmadjid Bouabdallah, Christian Laforest
    A Distributed token/based Algorithm for the Dynamic Resource Allocation Problem. [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 2000, v:34, n:3, pp:60-68 [Journal]
  24. Ralf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault
    Constructing Incremental Sequences in Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:2, pp:- [Journal]
  25. Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
    Edge-disjoint spanners of complete graphs and complete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:133-159 [Journal]

  26. Online time constrained scheduling with penalties. [Citation Graph (, )][DBLP]


  27. On-line Time-Constrained Scheduling Problem for the Size on kappa machines. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.327secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002