1. V. E. Alekseev, “On Compressed Graphs,” Problemy Kibernet. 36, 23–31 (1979).
2. V. E. Alekseev, “On Influence of Local Constraints on the Complexity of the Definition of Graph Independence Number,” in Combinatoric and Algebraic Methods in Applied Mathematics (Gor’kov. Gos. Univ., Gor’kii, 1983), pp. 3–13.
3. V. E. Alekseev, “On Easy and Hard Hereditary Classes of Graphs with Respect to the Independent Set Problem,” Discrete Appl. Math. 132(1–3), 17–26 (2004).
4. H. L. Bodlaender, “Dynamic Programming on Graphs with Bounded Treewidth,” in Lecture Notes in Computer Sciences, Vol. 317: Automata, Languages and Programming (Springer, Berlin, 1988), pp. 105–118.
5. V. Lozin and M. Milanic, “A Polynomial Algorithm for Finding an Independent Set of Maximum Weight in Fork-Free Graphs,” in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. (ACM Press, New York, 2007).