Annual citation index Math-Net.Ru of «Diskretnyi Analiz i Issledovanie Operatsii» journal, 2010

Annual citation index Math-Net.Ru of the journal in 2010 is calculated as the number of citations in 2010 to the scientific papers published during 2010.

The table below contains the list of citations in 2010 to the papers published in 2010. 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.

N	Citing pulication		Cited paper
1.	E. V. Gorkunov, “Gruppa avtomorfizmov $q$-ichnogo koda Khemminga”, Diskretn. analiz i issled. oper., 17:6 (2010), 50–55	→	Monomial automorphisms of the linear and simple components of the Hamming code E. V. Gorkunov Diskretn. Anal. Issled. Oper., 17:1 (2010),  11–33
2.	N. N. Tokareva, “Novaya kombinatornaya konstruktsiya bent-funktsii”, PDM, 2010, prilozhenie № 3, 13–14	→	Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 17:1 (2010),  34–64
3.	N. N. Tokareva, “Gruppa avtomorfizmov mnozhestva bent-funktsii”, Diskret. matem., 22:4 (2010), 34–42	→	Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 17:1 (2010),  34–64
4.	V. I. Shmyrev, “Drobno-lineinaya model obmena. Chast 2: metod vstrechnykh traektorii dlya modeli s fiksirovannymi byudzhetami”, Diskretn. analiz i issled. oper., 17:2 (2010), 79–96	→	Linear-fractional exchange model. Part 1: Existence and characterization of equilibrium V. I. Shmyrev Diskretn. Anal. Issled. Oper., 17:1 (2010),  75–96
5.	O. V. Borodin, A. O. Ivanova, “Acyclic $3$-choosability of planar graphs with no cycles of length from $4$ to $11$”, Sib. elektron. matem. izv., 7 (2010), 275–283	→	Acyclic 4-colorability of planar graphs without 4- and 5-cycles O. V. Borodin Diskretn. Anal. Issled. Oper., 17:2 (2010),  20–38
6.	A. V. Kelmanov, A. V. Pyatkin, “NP-polnota nekotorykh zadach vybora podmnozhestva vektorov”, Diskretn. analiz i issled. oper., 17:5 (2010), 37–45	→	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
7.	A. V. Kelmanov, “$NP$-polnota nekotorykh zadach poiska podmnozhestv vektorov”, Tr. IMM UrO RAN, 16, № 3, 2010, 121–129	→	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
8.	A. V. Kelmanov, “O slozhnosti nekotorykh zadach analiza dannykh”, Zh. vychisl. matem. i matem. fiz., 50:11 (2010), 2045–2051	→	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.	N. G. Parvatov, “Tochechnye i silno tochechnye funktsii na polureshetke”, PDM, 2010, № 3(9), 22–40	→	Clones with the majority function and their generalizations N. G. Parvatov Diskretn. Anal. Issled. Oper., 17:3 (2010),  46–60