1. A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, and A. V. Pyatkin, “The Problem of Finding a Subset of Vectors with the Maximum Total Weight,” Diskretn. Anal. Issled.Oper. Ser. 2, 14(1), 32–42 (2007) [J. Appl. Indust. Math. 2 (1), 32–38 (2008)].
2. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “Aposteriori Detection of a Quasiperiodic Fragment in a Number Sequence under the Given Number of Repeats,” Sibirsk. Zh. Industr. Mat. 9(1), 55–74 (2006).
3. A. V. Dolgushev and A. V. Kel’manov, “On the Algorithmic Complexity of a Problem in Cluster Analysis,” Diskretn. Anal. Issled. Oper. 17(2), 39–45 (2010) [J. Appl. Indust.Math. 5 (2), 191–194 (2011)].
4. A. V. Kel’manov and A. V. Pyatkin, “On the Complexity of a Search for a Subset of ’similar’ Vectors,” Dokl. Akad. Nauk., Ross. Akad. Nauk 421(5), 590–592 (2008) [Dokl. Math. 78 (1), 574–575 (2008)].
5. A. V. Kel’manov and A. V. Pyatkin, “On a Version of the Problem of Choosing a Vector Subset,” Diskretn. Anal. Issled. Oper. 15(5), 25–40 (2008) [J. Appl. Indust. Math. 3 (4), 447–455 (2009)].