2-years impact-factor Math-Net.Ru of «Diskretnyi Analiz i Issledovanie Operatsii» 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 3  Full list
N	Citing pulication		Cited paper
1.	A. R. Urakov, T. V. Timeryaev, “O dvukh zadachakh approksimatsii vzveshennykh grafov i algoritmakh ikh resheniya”, PDM, 2013, № 3(21), 86–92	→	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
2.	A. V. Kelmanov, S. M. Romanchenko, S. A. Khamidullin, “Tochnye psevdopolinomialnye algoritmy dlya nekotorykh trudnoreshaemykh zadach poiska podposledovatelnosti vektorov”, Zh. vychisl. matem. i matem. fiz., 53:1 (2013), 143–153	→	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
3.	I. I. Eremin, E. Kh. Gimadi, A. V. Kelmanov, A. V. Pyatkin, M. Yu. Khachai, “$2$-priblizhennyi algoritm poiska kliki s minimalnym vesom vershin i reber”, Tr. IMM UrO RAN, 19, № 2, 2013, 134–143	→	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
4.	D. S. Malyshev, “Kriticheskie klassy grafov dlya zadachi o rebernom spiskovom ranzhirovanii”, Diskretn. analiz i issled. oper., 20:6 (2013), 59–76	→	Minimal hard classes of graphs for the edge list-ranking problem D. S. Malyshev Diskretn. Anal. Issled. Oper., 18:1 (2011),  70–76
5.	M. A. Lisitsyna, “Sovershennye $3$-raskraski grafov prizmy i lestnitsy Mebiusa”, Diskretn. analiz i issled. oper., 20:1 (2013), 28–36	→	Perfect 2-colorings of transitive cubic graphs S. V. Avgustinovich, M. A. Lisitsyna Diskretn. Anal. Issled. Oper., 18:2 (2011),  3–17
6.	A. V. Kelmanov, V. I. Khandeev, “Polinomialnyi algoritm s otsenkoi tochnosti $2$ dlya resheniya odnoi zadachi klasternogo analiza”, Diskretn. analiz i issled. oper., 20:4 (2013), 36–45	→	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
7.	T. A. Panyukova, E. A. Savitskii, “Programmnoe obespechenie dlya postroeniya pokrytiya s uporyadochennym okhvatyvaniem mnogosvyaznykh ploskikh grafov”, Vestn. YuUrGU. Ser. Vych. matem. inform., 2:2 (2013), 111–117	→	Optimal Eulerian coverings with ordered enclosing for plane graphs T. A. Panyukova Diskretn. Anal. Issled. Oper., 18:2 (2011),  64–74
8.	I. P. Chukhrov, “O merakh slozhnosti kompleksov granei v edinichnom kube”, Diskretn. analiz i issled. oper., 20:6 (2013), 77–94	→	On kernel and shortest complexes of faces in the unit cube I. P. Chukhrov Diskretn. Anal. Issled. Oper., 18:2 (2011),  75–94
9.	M. A. Lisitsyna, “Sovershennye $3$-raskraski grafov prizmy i lestnitsy Mebiusa”, Diskretn. analiz i issled. oper., 20:1 (2013), 28–36	→	Distance regular colorings of the infinite rectangular grid S. V. Avgustinovich, A. Yu. Vasil'eva, I. V. Sergeeva Diskretn. Anal. Issled. Oper., 18:3 (2011),  3–10
10.	A. S. Kornienko, “Derevya funktsionalnykh grafov dlya tsirkulyantov s lineinymi bulevymi funktsiyami v vershinakh”, PDM. Prilozhenie, 2013, № 6, 80–81	→	Discrete dynamical systems of a circulant type with linear functions at vertices of network A. A. Evdokimov, A. L. Perezhogin Diskretn. Anal. Issled. Oper., 18:3 (2011),  39–48
11.	A. V. Seliverstov, “O monomakh kvadratichnykh form”, Diskretn. analiz i issled. oper., 20:3 (2013), 65–70	→	SAT polytopes are faces of polytopes of the traveling salesman problem A. N. Maksimenko Diskretn. Anal. Issled. Oper., 18:3 (2011),  76–83
12.	A. N. Maksimenko, “$k$-smezhnostnye grani buleva kvadratichnogo mnogogrannika”, Fundament. i prikl. matem., 18:2 (2013), 95–103	→	SAT polytopes are faces of polytopes of the traveling salesman problem A. N. Maksimenko Diskretn. Anal. Issled. Oper., 18:3 (2011),  76–83
13.	D. S. Malyshev, “Vliyanie rosta upakovochnogo chisla grafov na slozhnost zadachi o nezavisimom mnozhestve”, Diskret. matem., 25:2 (2013), 63–67	→	Analysis of the number of the edges effect on the complexity of the independent set problem solvability D. S. Malyshev Diskretn. Anal. Issled. Oper., 18:3 (2011),  84–88
14.	A. V. Seliverstov, “O monomakh kvadratichnykh form”, Diskretn. analiz i issled. oper., 20:3 (2013), 65–70	→	Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions V. L. Beresnev, E. N. Goncharov, A. A. Mel'nikov Diskretn. Anal. Issled. Oper., 18:4 (2011),  3–16
15.	E. Kh. Gimadi, A. M. Istomin, I. A. Rykov, “O zadache neskolkikh kommivoyazherov s ogranicheniyami na propusknye sposobnosti reber grafa”, Diskretn. analiz i issled. oper., 20:5 (2013), 13–30	→	Polynomial algorithm with approximation ratio $7/9$ for maximum 2-PSP A. N. Glebov, D. Zh. Zambalayeva Diskretn. Anal. Issled. Oper., 18:4 (2011),  17–48
16.	O. Yu. Tsidulko, “O razreshimosti $8$-indeksnoi aksialnoi zadachi o naznacheniyakh na odnotsiklicheskikh podstanovkakh”, Diskretn. analiz i issled. oper., 20:5 (2013), 66–83	→	Polynomial algorithm with approximation ratio $7/9$ for maximum 2-PSP A. N. Glebov, D. Zh. Zambalayeva Diskretn. Anal. Issled. Oper., 18:4 (2011),  17–48
17.	R. E. Shangin, “Determinirovannyi algoritm resheniya zadachi Vebera dlya $n$-posledovatelnosvyaznoi tsepi”, Diskretn. analiz i issled. oper., 20:5 (2013), 84–96	→	Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks G. G. Zabudsky, A. Yu. Lagzdin Diskretn. Anal. Issled. Oper., 18:4 (2011),  49–65
18.	S. S. Marchenkov, “Opredelimost v yazyke funktsionalnykh uravnenii schetnoznachnoi logiki”, Diskret. matem., 25:4 (2013), 13–23	→	On classificatons of many-valued logic functions by means of automorphism groups S. S. Marchenkov Diskretn. Anal. Issled. Oper., 18:4 (2011),  66–76
19.	E. Kh. Gimadi, A. M. Istomin, I. A. Rykov, “O zadache neskolkikh kommivoyazherov s ogranicheniyami na propusknye sposobnosti reber grafa”, Diskretn. analiz i issled. oper., 20:5 (2013), 13–30	→	An approximation algorithm for the minimum 2-PSP with different weight functions valued 1 and 2 A. N. Glebov, D. Zh. Zambalayeva Diskretn. Anal. Issled. Oper., 18:5 (2011),  11–37
20.	O. Yu. Tsidulko, “O razreshimosti $8$-indeksnoi aksialnoi zadachi o naznacheniyakh na odnotsiklicheskikh podstanovkakh”, Diskretn. analiz i issled. oper., 20:5 (2013), 66–83	→	An approximation algorithm for the minimum 2-PSP with different weight functions valued 1 and 2 A. N. Glebov, D. Zh. Zambalayeva Diskretn. Anal. Issled. Oper., 18:5 (2011),  11–37
1 2 3  Full list