1. Hereditary classes and coding of graphs;Alekseev,1982
2. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, in: A.A. Markov (Ed.), Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorky, 1983, pp. 3–13 (in Russian).
3. V.E. Alekseev, On the number of maximal independence sets in graphs from hereditary classes, in: V.N. Shevchenko (Ed.), Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorky, 1991, pp. 5–8 (in Russian).
4. A polynomial algorithm for finding the largest independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res. Ser. 1,1999
5. Complexity of some problems on hereditary classes of graphs;Alekseev;Discrete Math.,1992