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

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

The table below contains the list of citations in 2018 to the papers published in 2013–2017. 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 5  Full list
N	Citing pulication		Cited paper
1.	M. Alaeiyan, H. Karami, S. Siasat, “Perfect $3$-coloring of $\mathrm{GP}(5,2)$, $\mathrm{GP}(6,2)$, and $\mathrm{GP}(7,2)$ graphs”, J. Indones. Math. Soc., 24:2 (2018), 47–53	→	Perfect $3$-colorings of prisms and Möbius ladders M. A. Lisitsyna Diskretn. Anal. Issled. Oper., 20:1 (2013),  28–36
2.	A. A. Evdokimov, T. I. Fedoryaeva, “Grafy drevovidnoi struktury s polnym raznoobraziem sharov”, Diskretn. analiz i issled. oper., 25:1 (2018), 25–41	→	Majorants and minorants in the graph class with given number of vertices and diameter T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 20:1 (2013),  58–76
3.	A. V. Kelmanov, S. A. Khamidullin, V. I. Khandeev, “Randomizirovannyi algoritm dlya zadachi dvukhklasternogo razbieniya posledovatelnosti”, Zh. vychisl. matem. i matem. fiz., 58:12 (2018), 2169–2178	→	On the complexity of some vector sequence clustering problems A. V. Kel'manov, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 20:2 (2013),  47–57
4.	A. Kel'manov, S. Khamidullin, V. Khandeev, “A randomized algorithm for 2-partition of a sequence”, Analysis of Images, Social Networks and Texts, AIST 2017, Lecture Notes in Computer Science, 10716, eds. W. van der Aalst, D. Ignatov, M. Khachay, S. Kuznetsov, V. Lempitsky, I. Lomazova, N. Loukachevitch, A. Napoli, A. Panchenko, P. Pardalos, A. Savchenko, S. Wasserman, Springer, 2018, 313–322	→	On the complexity of some vector sequence clustering problems A. V. Kel'manov, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 20:2 (2013),  47–57
5.	K. L. Rychkov, “O slozhnosti realizatsii lineinoi bulevoi funktsii v klasse $\pi$-skhem”, Diskretn. analiz i issled. oper., 25:3 (2018), 36–94	→	A lower bound on formula size of a ternary linear function Yu. L. Vasil'ev, K. L. Rychkov Diskretn. Anal. Issled. Oper., 20:4 (2013),  15–26
6.	A. V. Kelmanov, A. V. Motkova, “Priblizhennyi polinomialnyi algoritm dlya zadachi vzveshennoi 2-klasterizatsii s ogranicheniem na moschnosti klasterov”, Zh. vychisl. matem. i matem. fiz., 58:1 (2018), 136–142	→	A $2$-approximation polynomial algorithm for one clustering problem A. V. Kelmanov, V. I. Khandeev Diskretn. Anal. Issled. Oper., 20:4 (2013),  36–45
7.	N. P. Redkin, “Obobschennaya slozhnost lineinykh bulevykh funktsii”, Diskret. matem., 30:4 (2018), 88–96	→	On minimal circuts in Sheffer basis for linear Boolean functions Yu. A. Kombarov Diskretn. Anal. Issled. Oper., 20:4 (2013),  65–87
8.	A. S. Degtyarev, V. I. Usakov, P. A. Kuznetsov, I. V. Kovalev, T. S. Karaseva, “Genetic algorithms of physical modelling with postcrossover survival”, IX International Multidisciplinary Scientific and Research Conference Modern Issues in Science and Technology / Workshop Advanced Technologies in Aerospace, Mechanical and Automation Engineering, IOP Conference Series-Materials Science and Engineering, 450, IOP Publishing Ltd, 2018, 042008	→	A deterministic algorithm for solving the Weber problem for an $n$-sequentially connected chain R. E. Shangin Diskretn. Anal. Issled. Oper., 20:5 (2013),  84–96
9.	M. Isaev, B. D. McKay, “Complex martingales and asymptotic enumeration”, Random Struct. Algorithms, 52:4 (2018), 617–661	→	Asymptotic enumeration of Eulerian orientations for graphs with strong mixing properties M. I. Isaev, K. V. Isaeva Diskretn. Anal. Issled. Oper., 20:6 (2013),  40–58
10.	I. P. Chukhrov, “O slozhnosti minimizatsii kvazitsiklicheskikh bulevykh funktsii”, Diskretn. analiz i issled. oper., 25:3 (2018), 126–151	→	On complexity measures for complexes of faces in the unit cube I. P. Chukhrov Diskretn. Anal. Issled. Oper., 20:6 (2013),  77–94
11.	E. Kh. Gimadi, O. Yu. Tsidulko, “Approximation algorithms for the maximum $m$-Peripatetic Salesman Problem”, Analysis of Images, Social Networks and Texts, AIST 2017, Lecture Notes in Computer Science, 10716, eds. W. van der Aalst, D. Ignatov, M. Khachay, S. Kuznetsov, V. Lempitsky, I. Lomazova, N. Loukachevitch, A. Napoli, A. Panchenko, P. Pardalos, A. Savchenko, S. Wasserman, Springer, 2018, 304–312	→	The probabilistic analysis of an algorithm for solving the $m$-planar $3$-dimensional assignment problem on one-cycle permutations E. Kh. Gimadi, Yu. V. Glazkov, O. Yu. Tsidulko Diskretn. Anal. Issled. Oper., 21:1 (2014),  15–29
12.	M. Khachay, K. Neznakhina, “Polynomial time solvable subclass of the Generalized Traveling Salesman Problem on Grid Clusters”, Analysis of Images, Social Networks and Texts, AIST 2017, Lecture Notes in Computer Science, 10716, eds. W. van der Aalst, D. Ignatov, M. Khachay, S. Kuznetsov, V. Lempitsky, I. Lomazova, N. Loukachevitch, A. Napoli, A. Panchenko, P. Pardalos, A. Savchenko, S. Wasserman, Springer, 2018, 346–355	→	The probabilistic analysis of an algorithm for solving the $m$-planar $3$-dimensional assignment problem on one-cycle permutations E. Kh. Gimadi, Yu. V. Glazkov, O. Yu. Tsidulko Diskretn. Anal. Issled. Oper., 21:1 (2014),  15–29
13.	A. A. Evdokimov, T. I. Fedoryaeva, “Grafy drevovidnoi struktury s polnym raznoobraziem sharov”, Diskretn. analiz i issled. oper., 25:1 (2018), 25–41	→	On the description problem of the diversity vectors of balls A. A. Evdokimov, T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 21:1 (2014),  44–52
14.	A. V. Kelmanov, S. A. Khamidullin, V. I. Khandeev, “Randomizirovannyi algoritm dlya zadachi dvukhklasternogo razbieniya posledovatelnosti”, Zh. vychisl. matem. i matem. fiz., 58:12 (2018), 2169–2178	→	Approximation algorithm for one problem of partitioning a sequence A. V. Kelmanov, S. A. Khamidullin Diskretn. Anal. Issled. Oper., 21:1 (2014),  53–66
15.	A. Kel'manov, S. Khamidullin, V. Khandeev, “A randomized algorithm for 2-partition of a sequence”, Analysis of Images, Social Networks and Texts, AIST 2017, Lecture Notes in Computer Science, 10716, eds. W. van der Aalst, D. Ignatov, M. Khachay, S. Kuznetsov, V. Lempitsky, I. Lomazova, N. Loukachevitch, A. Napoli, A. Panchenko, P. Pardalos, A. Savchenko, S. Wasserman, Springer, 2018, 313–322	→	Approximation algorithm for one problem of partitioning a sequence A. V. Kelmanov, S. A. Khamidullin Diskretn. Anal. Issled. Oper., 21:1 (2014),  53–66
16.	S. S. Marchenkov, “Kriterii polnoty dlya operatora zamykaniya po perechisleniyu v trekhznachnoi logike”, Diskret. matem., 30:4 (2018), 47–54	→	Positive closed classes in the three-valued logic S. S. Marchenkov Diskretn. Anal. Issled. Oper., 21:1 (2014),  67–83
17.	V. Beresnev, A. Melnikov, “Exact method for the capacitated competitive facility location problem”, Comput. Oper. Res., 95 (2018), 73–82	→	Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers V. L. Beresnev, A. A. Melnikov Diskretn. Anal. Issled. Oper., 21:2 (2014),  3–23
18.	V. L. Beresnev, A. A. Melnikov, “Algoritm generatsii otsechenii dlya diskretnoi zadachi konkurentnogo razmescheniya predpriyatii”, Dokl. RAN, 480:5 (2018), 515–518	→	Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers V. L. Beresnev, A. A. Melnikov Diskretn. Anal. Issled. Oper., 21:2 (2014),  3–23
19.	A. Rahmani, S. A. MirHassani, “An improved multi-parametric method for solving MIBLPP”, J. Inform. Optim. Science, 39:6 (2018), 1309–1328	→	Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers V. L. Beresnev, A. A. Melnikov Diskretn. Anal. Issled. Oper., 21:2 (2014),  3–23
20.	A. N. Glebov, D. Zh. Zambalaeva, “Putevaya razbivaemost planarnykh grafov obkhvata 4 bez smezhnykh korotkikh tsiklov”, Sib. elektron. matem. izv., 15 (2018), 1040–1047	→	A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4 A. N. Glebov, D. Zh. Zambalaeva Diskretn. Anal. Issled. Oper., 21:2 (2014),  33–51
1 2 3 4 5  Full list