1. V. S. Aizenshtat and D. N. Kravchuk, “On the Minimum of a Linear Form on the Set of All Cycles of the Symmetric Group Sn,” Kibernetika 2, 64–66 (1968) [Cybernetics 4, 52–53 (1968)].
2. Yu. A. Belov, “On Clique Number of the Matroid Graph,” Operations Research Models in Computing Systems (Yarosl. Gos. Univ., Yugoslavs, 1985), pp. 95–100.
3. V. A. Bondarenko, “Nonpolynomial Lower Bounds for the Complexity of the Traveling Salesman Problem in a Class of Algorithms,” Avtom. Telemekh. 44 (9), 44–50 (1983) [Automat. Remote Control 44 (9), 1137–1142 (1983)].
4. V. A. Bondarenko and A. N. Maksimenko, Geometric Constructions and Complexity in Combinatorial Optimization (LKI,Moscow, 2008) [in Russian].
5. V. A. Bondarenko, A. V. Nikolaev, and D. A. Shovgenov, “1-Skeletons of the Spanning Tree Problems with Additional Constraints,” Model. Anal. Inform. Sistem 22 (9), 453–463 (2015).