1. V. E. Alekseev and D. V. Korobitsyn, “On the complexity of some problems
for hereditary classes of graphs,” Diskretn. Mat. 4 (4),
34–40 (1992) [in Russian].
2. V. E. Alekseev and S. V. Sorochan, “New cases of the polynomial solvability
of the independent set problem for graphs with forbidden paths,” Diskretn. Anal. Issled. Oper.
25 (2), 5–18 (2018) [J. Appl. Ind. Math. 12 (2), 213–219 (2018)].
3. V. E. Alekseev, “On the local restriction effect on the complexity of finding
the graph independence number,” in Combinatorial-Algebraic Methods
in Applied Mathematics (Izd. Gorkovsk. Univ., Gorky, 1982), 3–13 [in Russian].
4. V. E. Alekseev, “On the number of maximal independent sets in graphs from
hereditary classes,” in Combinatorial-Algebraic Methods in Discrete
Optimization (Izd. NNGU, Nizhny Novgorod, 1991), 5–8 [in Russian].
5. V. E. Alekseev, “A polynomial algorithm for finding the largest independent
sets in claw-free graphs,” Diskretn. Anal. Issled. Oper. Ser. 1 6 (4), 3–19 (1999) [Discrete Appl. Math. 135 (1–3), 3–16 (2004)].