5-years impact-factor Math-Net.Ru of «Diskretnyi Analiz i Issledovanie Operatsii» journal, 2015

5-years impact-factor Math-Net.Ru of the journal in 2015 is calculated as the number of citations in 2015 to the scientific papers published during 2010–2014.

The table below contains the list of citations in 2015 to the papers published in 2010–2014. We take into account all citing publications we found from different sources, mostly from references lists available on Math-Net.Ru. Both original and translation versions are taken into account.

The impact factor Math-Net.Ru may change when new citations to a year given are found.

1 2 3 4  Full list
N	Citing pulication		Cited paper
1.	V. N. Potapov, “Svoistva $p$-ichnykh bent-funktsii, nakhodyaschikhsya na minimalnom rasstoyanii drug ot druga”, PDM. Prilozhenie, 2015, № 8, 39–43	→	Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 17:1 (2010),  34–64
2.	Hodzic S., Pasalic E., “Generalized Bent Functions - Some General Construction Methods and Related Necessary and Sufficient Conditions”, Cryptogr. Commun., 7:4 (2015), 469–483	→	Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 17:1 (2010),  34–64
3.	Xu B., “Bentness and Nonlinearity of Functions on Finite Groups”, Des. Codes Cryptogr., 76:3 (2015), 409–430	→	Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 17:1 (2010),  34–64
4.	Xu B., “Dual Bent Functions on Finite Groups and $C^*$-Algebras”, J. Pure Appl. Algebr., 220:3 (2015), 1055–1073	→	Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 17:1 (2010),  34–64
5.	Singh D., Bhaintwal M., Singh B.K., “Constructions of Q-Ary Functions With Good Global Avalanche Characteristics”, Int. J. Comput. Math., 92:2 (2015), 266–276	→	Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 17:1 (2010),  34–64
6.	T. I. Fedoryaeva, “O raznoobrazii sharov grafa zadannogo diametra”, PDM. Prilozhenie, 2015, № 8, 127–128	→	On graphs with given diameter, number of vertices, and local diversity of balls T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 17:1 (2010),  65–74
7.	T. I. Fedoryaeva, “Vektor raznoobraziya sharov tipichnogo grafa malogo diametra”, Diskretn. analiz i issled. oper., 22:6 (2015), 43–54	→	On graphs with given diameter, number of vertices, and local diversity of balls T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 17:1 (2010),  65–74
8.	A. V. Kelmanov, V. I. Khandeev, “Randomizirovannyi algoritm dlya odnoi zadachi dvukhklasternogo razbieniya mnozhestva vektorov”, Zh. vychisl. matem. i matem. fiz., 55:2 (2015), 335–344	→	On the issue of algorithmic complexity of one cluster analysis problem A. V. Dolgushev, A. V. Kel'manov Diskretn. Anal. Issled. Oper., 17:2 (2010),  39–45
9.	A. V. Kelmanov, V. I. Khandeev, “Tochnyi psevdopolinomialnyi algoritm dlya odnoi zadachi dvukhklasternogo razbieniya mnozhestva vektorov”, Diskretn. analiz i issled. oper., 22:4 (2015), 50–62	→	On the issue of algorithmic complexity of one cluster analysis problem A. V. Dolgushev, A. V. Kel'manov Diskretn. Anal. Issled. Oper., 17:2 (2010),  39–45
10.	Artem A. Sedakov, “O silnoi dinamicheskoi ustoichivosti $c$-yadra”, MTIP, 7:2 (2015), 69–84	→	Solutions of a cooperative differential group pursuit game Ya. B. Pankratova Diskretn. Anal. Issled. Oper., 17:2 (2010),  57–78
11.	S. S. Marchenkov, “O slozhnosti resheniya sistem funktsionalnykh uravnenii schetnoznachnoi logiki”, Diskretn. analiz i issled. oper., 22:2 (2015), 49–62	→	The closure operator in many-valued logic based on functional equations S. S. Marchenkov Diskretn. Anal. Issled. Oper., 17:4 (2010),  18–31
12.	I. S. Kalinina, S. S. Marchenkov, “O slozhnosti problemy vypolnimosti dlya sistem funktsionalnykh uravnenii schetnoznachnoi logiki”, Izv. vuzov. Matem., 2015, № 8, 25–32	→	The closure operator in many-valued logic based on functional equations S. S. Marchenkov Diskretn. Anal. Issled. Oper., 17:4 (2010),  18–31
13.	Shenmaier V., “Complexity and Approximation of the Smallest K-Enclosing Ball Problem”, Eur. J. Comb., 48:SI (2015), 81–87	→	NP-completeness of some problems of a vectors subset choice A. V. Kel'manov, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 17:5 (2010),  37–45
14.	Ben-Amram A.M., “Mortality of Iterated Piecewise Affine Functions Over the Integers: Decidability and Complexity”, Computability, 4:1 (2015), 19–56	→	Orbits of linear maps and regular languages properties M. N. Vyalyi, S. P. Tarasov Diskretn. Anal. Issled. Oper., 17:6 (2010),  20–49
15.	R. Yu. Simanchev, I. V. Urazova, “O granyakh mnogogrannika zadachi approksimatsii grafa”, Diskretn. analiz i issled. oper., 22:2 (2015), 86–101	→	Approximation algorithms for graph approximation problems V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya Diskretn. Anal. Issled. Oper., 18:1 (2011),  41–60
16.	A. V. Kelmanov, S. A. Khamidullin, “Priblizhennyi polinomialnyi algoritm dlya odnoi zadachi biklasterizatsii posledovatelnosti”, Zh. vychisl. matem. i matem. fiz., 55:6 (2015), 1076–1085	→	The approximation algorithm for one problem of searching for subset of vectors A. V. Kel'manov, S. M. Romanchenko Diskretn. Anal. Issled. Oper., 18:1 (2011),  61–69
17.	E. A. Monakhova, O. G. Monakhov, “Poisk rekordnykh tsirkulyantnykh grafov s ispolzovaniem parallelnogo geneticheskogo algoritma”, Diskretn. analiz i issled. oper., 22:6 (2015), 29–42	→	On an extremal family of circulant networks E. A. Monakhova Diskretn. Anal. Issled. Oper., 18:1 (2011),  77–84
18.	E. Kh. Gimadi, I. A. Rykov, “Randomizirovannyi algoritm otyskaniya podmnozhestva vektorov s maksimalnoi evklidovoi normoi ikh summy”, Diskretn. analiz i issled. oper., 22:3 (2015), 5–17	→	An approximation algorithm for one problem of cluster analysis A. V. Dolgushev, A. V. Kel'manov Diskretn. Anal. Issled. Oper., 18:2 (2011),  29–40
19.	A. V. Kelmanov, V. I. Khandeev, “Tochnyi psevdopolinomialnyi algoritm dlya odnoi zadachi dvukhklasternogo razbieniya mnozhestva vektorov”, Diskretn. analiz i issled. oper., 22:4 (2015), 50–62	→	An approximation algorithm for one problem of cluster analysis A. V. Dolgushev, A. V. Kel'manov Diskretn. Anal. Issled. Oper., 18:2 (2011),  29–40
20.	A. V. Dolgushev, A. V. Kelmanov, V. V. Shenmaier, “Polinomialnaya approksimatsionnaya skhema dlya odnoi zadachi razbieniya konechnogo mnozhestva na dva klastera”, Tr. IMM UrO RAN, 21, № 3, 2015, 100–109	→	An approximation algorithm for one problem of cluster analysis A. V. Dolgushev, A. V. Kel'manov Diskretn. Anal. Issled. Oper., 18:2 (2011),  29–40
1 2 3 4  Full list