1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. SODA’99, pp. 856–857 (1999)
2. Lecture Notes in Computer Science;N. Bourgeois,2008
3. Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. CoRR, abs/0901.1563 (2009)
4. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure and conquer approach for the analysis of exact algorithms. Journal of the ACM 56(5) (2009)
5. Kneis, J., Langer, A., Rossmanith, P.: A Fine-grained Analysis of a Simple Independent Set Algorithm. In: Proc. FSTTCS 2009, pp. 287–298 (2009)