default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Thibault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c7]Eric Angel, Evripidis Bampis
, Fanny Pascual, Nicolas Thibault:
Truthfulness for the Sum of Weighted Completion Times. COCOON 2016: 15-26- 2012
- [j5]Eric Angel, Evripidis Bampis, Nicolas Thibault:
Randomized truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 414(1): 1-8 (2012) - 2011
- [j4]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
- [j3]Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault:
Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. 53(9): 1497-1507 (2010) - [c6]Eric Angel, Evripidis Bampis, Nicolas Thibault:
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. LATIN 2010: 38-48
2000 – 2009
- 2009
- [c5]Nicolas Thibault, Christian Laforest:
Online time constrained scheduling with penalties. IPDPS 2009: 1-8 - 2007
- [j2]Nicolas Thibault, Christian Laforest:
An Optimal Rebuilding Strategy for an Incremental Tree Problem. J. Interconnect. Networks 8(1): 75-99 (2007) - 2006
- [b1]Nicolas Thibault:
Algorithmes d'approximation pour l'optimisation en ligne d'ordonnancements et de structures de communications. (Approximation algorithms for on-line optimization of scheduling and communication structures). University of Évry Val d'Essonne, France, 2006 - [j1]Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault:
Constructing Incremental Sequences in Graphs. Algorithmic Oper. Res. 1(2) (2006) - [c4]Nicolas Thibault, Christian Laforest:
An Optimal Rebuilding Strategy for a Decremental Tree Problem. SIROCCO 2006: 157-170 - 2005
- [c3]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 - [c2]Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault:
On-Line Bicriteria Interval Scheduling. Euro-Par 2005: 312-322 - [c1]Nicolas Thibault, Christian Laforest:
On-line Time-Constrained Scheduling Problem for the Size on kappa machines. ISPAN 2005: 20-24
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:09 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:
