M. Demange, Reducing off-line to on-line: An example and its applications, Yugoslav Journal of Operations Research, vol.13, issue.1, pp.3-24, 2003.
DOI : 10.2298/YJOR0301003D

M. Demange, V. Paschos, and . Th, Improved approximations for weighted and unweighted graph problems. Theory of Computing Systems

M. Demange, X. Paradon, V. Paschos, and . Th, On-line maximum-order induced hereditary subgraph problems, International Transactions in Operational Research, vol.28, issue.2, pp.185-201, 2005.
DOI : 10.1016/0012-365X(89)90096-4

M. M. Halldòrsson, Approximations of weighted independent set and heditary subset problems, Proc. 5th Ann. Int. Conf. on Computing and Combinatories, pp.261-270, 1999.

P. Crescenzi, R. Silvestri, and L. Trevisan, To weight or not to weight: where is the question?, Proc. 4th Israel Symposium on Theory and Computing and Systems, pp.68-77, 1996.

M. R. Garey and . Johnson, S:, Computers and intractability. A guide to the theory of NP-completness, 1979.

X. Paradon, Algorithmique on-line, Thèse de doctorat, 2000.