1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: SODA10th, pp. 856–857 (1999)
2. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. IPL 32, 171–176 (1989)
3. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195–207 (1972)
4. Lecture Notes in Computer Science;F.V. Fomin,2005
5. Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: SODA15th, pp. 328–328 (2004)