1. Abbas, N. and Stewart, L.K. (2000). Biconvex graphs: ordering and algorithms. Discrete Applied Mathematics, 103:1–19.
2. Alekseev, V.E. (1983) On the local restrictions effect on the complexity of finding the graph independence number. Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorky, pp. 3–13, in Russian.
3. Alekseev, V.E. (1999). A polynomial algorithm for finding largest independent sets in fork-free graphs, Diskretnyj Analiz i Issledovanie Operatsii, Seriya 1 6(4):3–19. (In Russian, translation in Discrete Applied Mathematics, 135:3–16, 2004).
4. Alekseev, V.E. (2004). On easy and hard hereditary classes of graphs with respect to the independent set problem, Discrete Applied Mathematics, 132:17–26.
5. Alekseev, V.E. and Lozin, V.V. (2004) Augmenting graphs for independent sets. Discrete Applied Mathematics, 145:3–10.