|
2-years impact-factor Math-Net.Ru of «Diskretnyi Analiz i Issledovanie Operatsii» journal, 2019
2-years impact-factor Math-Net.Ru of the journal in 2019 is calculated
as the number of citations in 2019 to the scientific papers published during
2017–2018.
The table below contains the list of citations in 2019 to the papers
published in 2017–2018. 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.
Year |
2-years impact-factor Math-Net.Ru |
Scientific papers |
Citations |
Citated papers |
Journal Self-citations |
2019 |
0.358 |
53 |
19 |
15 |
21.1% |
|
N |
Citing pulication |
|
Cited paper |
|
1. |
X. Delorme, A. Dolgui, S. Kovalev, M. Y. Kovalyov, “Minimizing the number of workers in a paced mixed-model assembly line”, Eur. J. Oper. Res., 272:1 (2019), 188–194  |
→ |
Construction of cyclic schedules in presence of parallel machines E. A. Bobrova, V. V. Servakh Diskretn. Anal. Issled. Oper., 24:1 (2017), 5–20
|
|
2. |
A. V. Pyatkin, “O predpisannoi $(k,l)$-raskraske intsidentorov multigrafov chetnoi stepeni pri nekotorykh znacheniyakh $k$ i $l$”, Tr. IMM UrO RAN, 25, № 2, 2019, 177–184  |
→ |
On list incidentor $(k,l)$-colorings E. I. Vasilyeva, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 24:1 (2017), 21–30
|
|
3. |
S. A. Malyugin, “Systematic and Nonsystematic Perfect Codes of Infinite Length Over Finite Fields”, Sib. Electron. Math. Rep., 16 (2019), 1732–1751  |
→ |
Perfect binary codes of infinite length S. A. Malyugin Diskretn. Anal. Issled. Oper., 24:2 (2017), 53–67
|
|
4. |
D. S. Malyshev, D. B. Mokeev, “Kenigovy grafy otnositelno 4-puti i ego ostovnykh nadgrafov”, Diskretn. analiz i issled. oper., 26:1 (2019), 74–88  |
→ |
On König graphs with respect to $P_4$ D. B. Mokeev Diskretn. Anal. Issled. Oper., 24:3 (2017), 61–79
|
|
5. |
K. A. Popkov, “Metod postroeniya legko diagnostiruemykh skhem iz funktsionalnykh elementov otnositelno edinichnykh neispravnostei”, PDM, 2019, № 46, 38–57  |
→ |
On the exact value of the length of the minimal single diagnostic test for a particular class of circuits K. A. Popkov Diskretn. Anal. Issled. Oper., 24:3 (2017), 80–103
|
|
6. |
V. M. Fomichev, “Ob uluchshennoi universalnoi otsenke eksponentov orgrafov”, PDM, 2019, № 43, 115–123  |
→ |
Computational complexity of the original and extended Diophantine Frobenius problem V. M. Fomichev Diskretn. Anal. Issled. Oper., 24:3 (2017), 104–124
|
|
7. |
A. Nikolaev, “On vertex adjacencies in the polytope of pyramidal tours with step-backs”, Mathematical Optimization Theory and Operations Research, Lecture Notes in Computer Science, 11548, eds. M. Khachay, Y. Kochetov, P. Pardalos, Springer, 2019, 247–263  |
→ |
On the skeleton of the polytope of pyramidal tours V. A. Bondarenko, A. V. Nikolaev Diskretn. Anal. Issled. Oper., 25:1 (2018), 5–24
|
8. |
A. Kozlova, A. Nikolaev, “Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope”, Mathematical Optimization Theory and Operations Research, Lecture Notes in Computer Science, 11548, eds. M. Khachay, Y. Kochetov, P. Pardalos, Springer, 2019, 374–389  |
→ |
On the skeleton of the polytope of pyramidal tours V. A. Bondarenko, A. V. Nikolaev Diskretn. Anal. Issled. Oper., 25:1 (2018), 5–24
|
|
9. |
A. V. Kutsenko, “Izometrichnye otobrazheniya mnozhestva vsekh bulevykh funktsii v sebya, sokhranyayuschie samodualnost i otnoshenie Releya”, PDM. Prilozhenie, 2019, № 12, 55–58  |
→ |
The Hamming distance spectrum between self-dual Maiorana–McFarland bent functions A. V. Kutsenko Diskretn. Anal. Issled. Oper., 25:1 (2018), 98–119
|
|
10. |
K. A. Popkov, “Korotkie polnye proveryayuschie testy dlya skhem iz dvukhvkhodovykh funktsionalnykh elementov”, Diskretn. analiz i issled. oper., 26:1 (2019), 89–113  |
→ |
Complete fault detection tests of length 2 for logic networks under stuck-at faults of gates K. A. Popkov Diskretn. Anal. Issled. Oper., 25:2 (2018), 62–81
|
|
11. |
D. V. Gribanov, D. S. Malyshev, “Integer conic function minimization based on the comparison oracle”, Mathematical Optimization Theory and Operations Research, Lecture Notes in Computer Science, 11548, eds. M. Khachay, Y. Kochetov, P. Pardalos, Springer, 2019, 218–231  |
→ |
Minimizing a symmetric quasiconvex function on a two-dimensional lattice S. I. Veselov, D. V. Gribanov, N. Yu. Zolotykh, A. Yu. Chirkov Diskretn. Anal. Issled. Oper., 25:3 (2018), 23–35
|
12. |
A. Yu. Chirkov, D. V. Gribanov, D. S. Malyshev, P. M. Pardalos, S. I. Veselov, N. Yu. Zolotykh, “On the complexity of quasiconvex integer minimization problem”, J. Glob. Optim., 73:4 (2019), 761–788  |
→ |
Minimizing a symmetric quasiconvex function on a two-dimensional lattice S. I. Veselov, D. V. Gribanov, N. Yu. Zolotykh, A. Yu. Chirkov Diskretn. Anal. Issled. Oper., 25:3 (2018), 23–35
|
|
13. |
K. L. Rychkov, “O sovershennosti minimalnykh pravilnykh razbienii mnozhestva reber $n$-mernogo kuba”, Diskretn. analiz i issled. oper., 26:4 (2019), 74–107  |
→ |
Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes K. L. Rychkov Diskretn. Anal. Issled. Oper., 25:3 (2018), 36–94
|
|
14. |
V. M. Fomichev, “Ob uluchshennoi universalnoi otsenke eksponentov orgrafov”, PDM, 2019, № 43, 115–123  |
→ |
Primitivity and local primitivity of digraphs and nonnegative matrices V. M. Fomichev, Ya. E. Avezova, A. M. Koreneva, S. N. Kyazhin Diskretn. Anal. Issled. Oper., 25:3 (2018), 95–125
|
|
15. |
I. P. Chukhrov, “O minimizatsii bulevykh funktsii dlya additivnykh mer slozhnosti”, Diskretn. analiz i issled. oper., 26:3 (2019), 115–140  |
→ |
On the complexity of minimizing quasicyclic Boolean functions I. P. Chukhrov Diskretn. Anal. Issled. Oper., 25:3 (2018), 126–151
|
|
16. |
J. Pisanski, T. Pisanski, “The use of collaboration distance in scheduling conference talks”, Inform.-J. Comput. Inform., 43:4 (2019), 461–466  |
→ |
On $2$-connected transmission irregular graphs A. A. Dobrynin Diskretn. Anal. Issled. Oper., 25:4 (2018), 5–14
|
17. |
A. A. Dobrynin, A. Yu. Vesnin, “On the Wiener complexity and the Wiener index of fullerene graphs”, Mathematics, 7:11 (2019), 1071  |
→ |
On $2$-connected transmission irregular graphs A. A. Dobrynin Diskretn. Anal. Issled. Oper., 25:4 (2018), 5–14
|
18. |
A. A. Dobrynin, “Infinite family of 3-connected cubic transmission irregular graphs”, Discret Appl. Math., 257 (2019), 151–157  |
→ |
On $2$-connected transmission irregular graphs A. A. Dobrynin Diskretn. Anal. Issled. Oper., 25:4 (2018), 5–14
|
|
19. |
N. V. Prytkov, A. L. Perezhogin, “Gamiltonova svyaznost grafov diagonalnoi reshetki”, Sib. elektron. matem. izv., 16 (2019), 2080–2089  |
→ |
The functional graph of a linear discrete dynamical system with two dominating vertices A. S. Parfinenko, A. L. Perezhogin Diskretn. Anal. Issled. Oper., 25:4 (2018), 81–96
|
|
Total publications: |
956 |
Scientific articles: |
912 |
Authors: |
463 |
Citations: |
2872 |
Cited articles: |
635 |
 |
Scopus Metrics |
|
2019 |
SJR |
0.200 |
|
2018 |
CiteScore |
0.580 |
|
2018 |
SNIP |
0.680 |
|
2018 |
SJR |
0.247 |
|
2017 |
CiteScore |
0.590 |
|
2017 |
SNIP |
0.793 |
|
2017 |
SJR |
0.292 |
|
2016 |
CiteScore |
0.510 |
|
2016 |
SNIP |
0.786 |
|
2016 |
SJR |
0.242 |
|
2015 |
CiteScore |
0.230 |
|
2015 |
SNIP |
0.364 |
|
2015 |
IPP |
0.201 |
|
2015 |
SJR |
0.187 |
|
2014 |
CiteScore |
0.260 |
|
2014 |
SNIP |
0.432 |
|
2014 |
IPP |
0.236 |
|
2014 |
SJR |
0.202 |
|
2013 |
SNIP |
0.292 |
|
2013 |
IPP |
0.106 |
|
2013 |
SJR |
0.135 |
|