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,” Diskret. Anal. Issled. Oper. Ser. 2, 14(1), 22–32 (2007) [J. Appl. Indust. Math. 2 (1), 32–38 (2008)].
2. E. Kh. Gimadi, Yu. V. Glazkov, and I. A. Rykov, “On Two Problems of Choosing Some Subset of Vectors with Integer Coordinates That Has the Maximum Norm of the Sum of Elements in Euclidean Space,” Diskret. Anal. Issled. Oper. 15(5), 30–43 (2008) [J. Appl. Indust. Math. 3 (3), 343–352 (2009)].
3. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “A Posteriori Search in a Number Sequence for the Quasiperiodically Repeating Fragment with a Given Number of Repeats,” Sibirsk. Zh. Indust. Mat. 9(1), 55–74 (2006).
4. E. Kh. Gimadi, A. V. Pyatkin, and I. A. Rykov, “On Polynomial Solvability of Some Problems of a Vector Subset Choice in a Euclidean Space of Fixed Dimension,” Diskret. Anal. Issled. Oper. 15(6), 11–19 (2008) [J. Appl. Indust. Math. 4 (1), 48–53 (2010)].
5. A. V. Kel’manov, “AProblemof theOff-Line Detecting a Repeating Fragment in a Number Sequence,” Trudy Inst. Mat. i Mekh. Ural. Otdel. Ross. Akad. Nauk 14(2), 81–88 (2008).