Nicolas Thibault Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicolas Thibault, Christian Laforest: Online time constrained scheduling with penalties. IPDPS 2009: 1-8
2007
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicolas Thibault, Christian Laforest: An Optimal Rebuilding Strategy for an Incremental Tree Problem. Journal of Interconnection Networks 8(1): 75-99 (2007)
2006
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicolas Thibault, Christian Laforest: An Optimal Rebuilding Strategy for a Decremental Tree Problem. SIROCCO 2006: 157-170
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRalf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault: Constructing Incremental Sequences in Graphs. Algorithmic Operations Research 1(2): (2006)
2005
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabien 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault: On-Line Bicriteria Interval Scheduling. Euro-Par 2005: 312-322
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicolas Thibault, Christian Laforest: On-line Time-Constrained Scheduling Problem for the Size on kappa machines. ISPAN 2005: 20-24

Coauthor Index

1Fabien Baille [2] [3]
2Evripidis Bampis [2] [3]
3Ralf Klasing [4]
4Christian Laforest [1] [2] [3] [4] [5] [6] [7]
5Joseph Peters [4]

Copyright © Mon Nov 16 17:22:42 2009 by Michael Ley (ley@uni-trier.de)