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

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

The table below contains the list of citations in 2013 to the papers published in 2011–2012. 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  Full list
N	Citing pulication		Cited paper
1.	R. M. Ganopolskii, “Proizvodyaschie funktsii posledovatelnosti chisel svyaznykh pokrytii”, PDM, 2013, № 3(21), 5–10	→	Generating functions for sequences of disordered covers numbers R. M. Ganopolsky Prikl. Diskr. Mat., 2011, no. 1(11),  5–13
2.	V. V. Bykova, “Ob asimptotike reshenii rekurrentnykh sootnoshenii spetsialnogo vida i tekhnike Kulmana–Lyukkhardta”, PDM, 2013, № 4(22), 56–66	→	Technology for translating combinatorial problems into Boolean equations I. V. Otpuschennikov, A. A. Semenov Prikl. Diskr. Mat., 2011, no. 1(11),  96–115
3.	A. A. Semenov, S. E. Kochemazov, “O diskretno-avtomatnykh modelyakh konformnogo povedeniya”, UBS, 46 (2013), 266–292	→	Technology for translating combinatorial problems into Boolean equations I. V. Otpuschennikov, A. A. Semenov Prikl. Diskr. Mat., 2011, no. 1(11),  96–115
4.	O. S. Zaikin, A. A. Semenov, M. A. Posypkin, “Protsedury postroeniya dekompozitsionnykh mnozhestv dlya raspredelennogo resheniya sat-zadach v proekte dobrovolnykh vychislenii sat@home”, UBS, 43 (2013), 138–156	→	Technology for translating combinatorial problems into Boolean equations I. V. Otpuschennikov, A. A. Semenov Prikl. Diskr. Mat., 2011, no. 1(11),  96–115
5.	E. O. Fomina, “Glavnye idealy v polureshetke kongruentsii tsepi”, Izv. Sarat. un-ta. Nov. ser. Ser.: Matematika. Mekhanika. Informatika, 13:1(1) (2013), 109–113	→	On congruences of paths E. O. Karmanova Prikl. Diskr. Mat., 2011, no. 2(12),  96–100
6.	S. N. Kyazhin, “O lokalnoi primitivnosti grafov i neotritsatelnykh matrits”, PDM. Prilozhenie, 2013, № 6, 81–83	→	The estimates of exponents for primitive graphs V. M. Fomichev Prikl. Diskr. Mat., 2011, no. 2(12),  101–112
7.	R. E. Shangin, “Determinirovannyi algoritm resheniya zadachi Vebera dlya $n$-posledovatelnosvyaznoi tsepi”, Diskretn. analiz i issled. oper., 20:5 (2013), 84–96	→	Computational aspects of treewidth for graph V. V. Bykova Prikl. Diskr. Mat., 2011, no. 3(13),  65–79
8.	R. E. Shangin, “Konstruktivnye opisaniya $n$-posledovatelnosvyaznykh grafov”, Vladikavk. matem. zhurn., 15:4 (2013), 48–57	→	Computational aspects of treewidth for graph V. V. Bykova Prikl. Diskr. Mat., 2011, no. 3(13),  65–79
9.	E. A. Monakhova, “Novaya dostizhimaya nizhnyaya otsenka chisla vershin v tsirkulyantnykh setyakh razmernosti chetyre”, Diskretn. analiz i issled. oper., 20:1 (2013), 37–44	→	Structural and communicative properties of circulant networks E. A. Monakhova Prikl. Diskr. Mat., 2011, no. 3(13),  92–115
10.	E. A. Monakhova, “O postroenii tsirkulyantnykh setei razmernosti chetyre s maksimalnym chislom vershin pri lyubom diametre”, PDM, 2013, № 3(21), 76–85	→	Structural and communicative properties of circulant networks E. A. Monakhova Prikl. Diskr. Mat., 2011, no. 3(13),  92–115
11.	A. Yu. Zubov, “Kod autentifikatsii s sekretnostyu na osnove proektivnoi geometrii”, PDM, 2013, № 2(20), 39–49	→	Almost perfect ciphers and authentication codes A. U. Zubov Prikl. Diskr. Mat., 2011, no. 4(14),  28–33
12.	A. N. Voropaev, “Podschet $k$-ugolnikov v konechnykh proektivnykh ploskostyakh”, Sib. elektron. matem. izv., 10 (2013), 241–270	→	Multiplicities of sums in the explicit formulae for counting fixed length cycles in undirected graphs A. N. Voropaev Prikl. Diskr. Mat., 2011, no. 4(14),  42–55
13.	Kochkarov A.A., “Modelirovanie strukturno-dinamicheskikh protsessov v setetsentricheskikh sistemakh monitoringa”, Antenny, 2013, № 1, 164–168	→	Some prefractal graph's connectivity characteristics estimations A. A. Kochkarov, L. I. Sennikova Prikl. Diskr. Mat., 2011, no. 4(14),  56–61
14.	Bairamukova Z.Kh., Kochkarov A.M., “Algoritm vychisleniya opredelitelei predfraktalnykh grafov s polnymi zatravkami, sokhranyayuschikh smezhnost starykh reber”, Politematicheskii setevoi elektronnyi nauchnyi zhurnal kubanskogo gosudarstvennogo agrarnogo universiteta, 2013, № 87, 1–11	→	Some prefractal graph's connectivity characteristics estimations A. A. Kochkarov, L. I. Sennikova Prikl. Diskr. Mat., 2011, no. 4(14),  56–61
15.	O. L. Mironenko, “O statisticheskoi nezavisimosti proizvolnoi superpozitsii bulevykh funktsii”, PDM. Prilozhenie, 2013, № 6, 18–19	→	Statistical independence of the Boolean function superposition O. L. Kolcheva, I. A. Pankratova Prikl. Diskr. Mat., 2011, supplement № 4,  11–12
16.	E. P. Korsakova, “Klassifikatsiya grafov kvadratichnykh bent-funktsii ot shesti peremennykh”, Diskretn. analiz i issled. oper., 20:5 (2013), 45–57	→	Classification of ANF graphs for quadratic bent functions in 6 variables E. P. Korsakova Prikl. Diskr. Mat., 2011, supplement № 4,  13–14
17.	D. S. Kovalev, “Realizatsiya na PLIS simmetrichnogo analoga FAPKC”, PDM. Prilozhenie, 2013, № 6, 36–38	→	FPGA implementation of Finite Automata Public Key Cryptosystem D. S. Kovalev, V. N. Trenkaev Prikl. Diskr. Mat., 2011, supplement № 4,  33–34
18.	V. Yu. Smolyaninov, “Pravila preobrazovaniya sostoyanii SUBD DP-modeli”, PDM, 2013, № 1(19), 50–68	→	The role DP-model of access and information flows control in operating systems of Linux sets P. N. Devyanin Prikl. Diskr. Mat., 2012, no. 1(15),  69–90
19.	M. B. Abrosimov, O. V. Modenova, “Kharakterizatsiya orgrafov s malym chislom dopolnitelnykh dug minimalnogo vershinnogo $1$-rasshireniya”, Izv. Sarat. un-ta. Nov. ser. Ser.: Matematika. Mekhanika. Informatika, 13:2(2) (2013), 3–9	→	Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension M. B. Abrosimov Prikl. Diskr. Mat., 2012, no. 1(15),  111–120
20.	M. B. Abrosimov, O. V. Modenova, “Kharakterizatsiya orgrafov s tremya dopolnitelnymi dugami v minimalnom vershinnom $1$-rasshirenii”, PDM, 2013, № 3(21), 68–75	→	Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension M. B. Abrosimov Prikl. Diskr. Mat., 2012, no. 1(15),  111–120
1 2  Full list