1. V. E. Alekseev and D. S. Malyshev, “Planar Graph Classes with the Independent Set Problem Solvable in Polynomial Time,” Diskretn. Anal. Issled. Oper. 15(1), 3–10 (2008) [J. Appl. Indust. Math. 3 (1), 1–4 (2009)].
2. D. S. Malyshev, “Boundary Classes for the Independent Set Problem in the Class of Planar Graphs,” Vestnik Nizhegorod. Univ. im. N. I. Lobachevskogo No. 6, 165–168 (2007).
3. V. E. Alekseev, “On Easy and Hard Hereditary Classes of Graphs with Respect to the Independent Set Problem,” Discrete Appl. Math. 132, 17–26 (2004).
4. V. E. Alekseev, V. V. Lozin, D. S. Malyshev, and M. Millanic, “The Maximum Independent Set Problem in Planar Graphs,” in Proceedings of Mathematical Foundations of Computer Science (Torun, August 25–29, 2008) (Torun, 2008), pp. 96–107.
5. V. V. Lozin and M. Millanic, “Maximum Independent Sets in Graphs of Low Degree,” in Proceedings of ACM-SIAM Symposium on Discrete Algorithms (New Orleans, January 7–9, 2007) (ACM-SIAM, New Orlean, 2007), pp. 874–880.