2-years impact-factor Math-Net.Ru of «Diskretnaya Matematika» journal, 2011

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

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

1 2 3  Full list
N	Citing pulication		Cited paper
1.	Behbahani M., Lam C., “Strongly Regular Graphs with Non-Trivial Automorphisms”, Discrete Math., 311:2-3 (2011), 132–144	→	On the automorphisms of the strongly regular graph with parameters $(85, 14, 3, 2)$ D. V. Paduchikh Diskr. Mat., 21:1 (2009),  78–104
2.	Mezhennaya N.M., “Predelnaya teorema puassona dlya chisla plotnykh serii zadannoi dliny i vesa”, Vestn. Mosk. gos. tekhnich. un-ta im. N.E. Baumana. Ser. Estestvennye nauki, 2011, № S, Prikladnaya matematika, 75–82	→	Limit theorems for the number of dense series in a random sequence N. M. Mezhennaya Diskr. Mat., 21:1 (2009),  105–116
3.	E. Vl. Bulinskaya, “Predelnye raspredeleniya chislennostei chastits v vetvyaschemsya sluchainom bluzhdanii”, Matem. zametki, 90:6 (2011), 845–859	→	Critical branching random walks on low-dimensional lattices E. B. Yarovaya Diskr. Mat., 21:1 (2009),  117–138
4.	Bulinskaya E.Vl., “Limit distributions arising in branching random walks on integer lattices”, Lith. Math. J., 51:3 (2011), 310–321	→	Critical branching random walks on low-dimensional lattices E. B. Yarovaya Diskr. Mat., 21:1 (2009),  117–138
5.	V. A. Emelichev, V. V. Korotkov, “Otsenki radiusa ustoichivosti leksikograficheskogo optimuma vektornoi bulevoi zadachi s kriteriyami riskov Sevidzha”, Diskretn. analiz i issled. oper., 18:2 (2011), 41–50	→	Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric V. A. Emelichev, O. V. Karelkina Diskr. Mat., 21:2 (2009),  43–50
6.	V. A. Emelichev, V. V. Korotkov, “O radiuse ustoichivosti effektivnogo resheniya vektornoi kvadratichnoi bulevoi zadachi na uzkie mesta”, Diskretn. analiz i issled. oper., 18:6 (2011), 3–16	→	Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric V. A. Emelichev, O. V. Karelkina Diskr. Mat., 21:2 (2009),  43–50
7.	V. A. Emelichev, V. V. Korotkov, “O radiuse ustoichivosti effektivnogo resheniya mnogokriterialnoi zadachi portfelnoi optimizatsii s kriteriyami Sevidzha”, Diskret. matem., 23:4 (2011), 33–38	→	Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric V. A. Emelichev, O. V. Karelkina Diskr. Mat., 21:2 (2009),  43–50
8.	Emelichev V.A., Korotkov V.V., Kuzmin K.G., “Mnogokriterialnaya investitsionnaya zadacha v usloviyakh neopredelennosti i riska”, Izv. RAN. Teoriya i sistemy upravleniya, 2011, № 6, 157–164	→	Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric V. A. Emelichev, O. V. Karelkina Diskr. Mat., 21:2 (2009),  43–50
9.	S. V. Smyshlyaev, “Bulevy funktsii bez predskazyvaniya”, Diskret. matem., 23:1 (2011), 102–118	→	New methods of investigation of perfectly balanced Boolean functions O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko Diskr. Mat., 21:2 (2009),  51–74
10.	S. V. Smyshlyaev, “O chisle sovershenno uravnoveshennykh bulevykh funktsii s barerom dliny $3$”, PDM, 2011, № 1(11), 26–33	→	New methods of investigation of perfectly balanced Boolean functions O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko Diskr. Mat., 21:2 (2009),  51–74
11.	S. V. Smyshlyaev, “Lokalno obratimye bulevy funktsii”, PDM, 2011, № 4(14), 11–21	→	New methods of investigation of perfectly balanced Boolean functions O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko Diskr. Mat., 21:2 (2009),  51–74
12.	Rozhnev A.Yu., Titov S.S., “Issledovanie bulevykh funktsii na zapret v sistemakh svyazi na zheleznodorozhnom transporte”, Vestn. Uralskogo gos. un-ta putei soobscheniya, 2011, № 3, 21–27	→	New methods of investigation of perfectly balanced Boolean functions O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko Diskr. Mat., 21:2 (2009),  51–74
13.	A. V. Tarasov, “Universalnye algebry, porozhdaemye mnozhestvami vypolnyayuschikh vektorov biyunktivnykh i $r$-yunktivnykh bulevykh funktsii”, Matem. vopr. kriptogr., 2:3 (2011), 75–98	→	Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions S. P. Gorshkov, A. V. Tarasov Diskr. Mat., 21:2 (2009),  94–101
14.	V. P. Chistyakov, “Asimptoticheskaya normalnost chisla znachenii $m$-zavisimykh sluchainykh velichin, poyavivshikhsya zadannoe chislo raz”, Diskret. matem., 23:2 (2011), 41–52	→	Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials M. I. Tikhomirova Diskr. Mat., 21:2 (2009),  112–125
15.	M. I. Tikhomirova, V. P. Chistyakov, “Asimptoticheskaya normalnost chisla nepoyavivshikhsya znachenii $m$-zavisimykh sluchainykh velichin”, Matem. vopr. kriptogr., 2:1 (2011), 119–129	→	Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials M. I. Tikhomirova Diskr. Mat., 21:2 (2009),  112–125
16.	A. M. Magomedov, “O suschestvovanii kompromissnogo razbieniya dlya chastichno-$4$-odnorodnogo grafa”, Matem. zametki, 89:3 (2011), 378–383	→	On the edge colouring of bipartite graphs A. M. Magomedov Diskr. Mat., 21:2 (2009),  153–158
17.	V. A. Emelichev, V. V. Korotkov, “Otsenki radiusa ustoichivosti leksikograficheskogo optimuma vektornoi bulevoi zadachi s kriteriyami riskov Sevidzha”, Diskretn. analiz i issled. oper., 18:2 (2011), 41–50	→	On five types of stability of the lexicographic variant of the combinatorial bottleneck problem E. E. Gurevskii, V. A. Emelichev Diskr. Mat., 21:3 (2009),  3–13
18.	V. A. Emelichev, V. V. Korotkov, “O radiuse ustoichivosti effektivnogo resheniya vektornoi kvadratichnoi bulevoi zadachi na uzkie mesta”, Diskretn. analiz i issled. oper., 18:6 (2011), 3–16	→	On five types of stability of the lexicographic variant of the combinatorial bottleneck problem E. E. Gurevskii, V. A. Emelichev Diskr. Mat., 21:3 (2009),  3–13
19.	V. A. Emelichev, V. V. Korotkov, “Ob ustoichivosti leksikograficheskogo resheniya vektornoi minimaksnoi kvadratichnoi bulevoi zadachi”, Tr. In-ta matem., 19:2 (2011), 26–36	→	On five types of stability of the lexicographic variant of the combinatorial bottleneck problem E. E. Gurevskii, V. A. Emelichev Diskr. Mat., 21:3 (2009),  3–13
20.	Pavlov Yu.L., “O tipichnoi strukture konfiguratsionnogo internet-grafa s izvestnym chislom svyazei”, Trudy Karelskogo nauchnogo tsentra RAN, 2011, № 5, 86–96	→	On the limit distributions of the vertex degrees of conditional Internet graphs Yu. L. Pavlov Diskr. Mat., 21:3 (2009),  14–23
1 2 3  Full list