1. V. E. Alekseev, “On the Local Restriction Effect on the Complexity of Finding the Graph Independence Number,” in Combinatorial and Algebraic Methods in Applied Mathematics (Izd. Gor’kovskogo Univ., Gor’ky, 1982), pp. 3–13.
2. V. E. Alekseev, “On the Number of Maximal Independent Sets in the Graphs from Hereditary classes," in Combinatorial and Algebraic Methods in Discrete Optimization (Nizhny Novgorod. Gos. Univ., Nizhny Novgorod, 1991), pp. 5–8.
3. V. E. Alekseev, “A Polynomial Algorithm for Finding the Largest Independent Sets in Fork-Free Graphs, Diskretn. Anal. Issled. Oper. Ser. 1, 6 (4), 3–19 (1999) [Discrete Appl.Math. 135 (1–3), 3–16 (2004)].
4. V. E. Alekseev and D. V. Korobitsyn, “Complexity of Some Problems for Hereditary Classes of Graphs,” Diskretn.Mat. 4 (4), 34–40 (1992).
5. D. S. Malyshev and D. V. Sirotkin, “Polynomial-TimeSolvability of the Independent Set Problem in a Certain Class of Subcubic PlanarGraphs,” Diskretn.Anal. Issled.Oper. 24 (3), 35–60 (2017) [J. Appl. Indust.Math. 11 (3), 400–414 (2017)].