|
2-years impact-factor Math-Net.Ru of «Diskretnyi Analiz i Issledovanie Operatsii» journal, 2021
2-years impact-factor Math-Net.Ru of the journal in 2021 is calculated
as the number of citations in 2021 to the scientific papers published during
2019–2020.
The table below contains the list of citations in 2021 to the papers
published in 2019–2020. 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 |
2021 |
0.431 |
51 |
22 |
15 |
27.3% |
|
|
N |
Citing pulication |
|
Cited paper |
|
1. |
T. T. Lebedeva, N. V. Semenova, T. I. Sergienko, “Stability kernel of a multicriteria optimization problem under perturbations of input data of the vector criterion”, Cybern. Syst. Anal., 57:4 (2021), 578–583 |
→ |
Stability aspects of multicriteria integer linear programming problems S. E. Bukhtoyarov, V. A. Emelichev Diskretn. Anal. Issled. Oper., 26:1 (2019), 5–19
|
|
2. |
V. A. Voblyi, “Utochnenie asimptotiki dlya chisla pomechennykh posledovatelno-parallelnykh grafov”, Matem. zametki, 109:6 (2021), 944–947 |
→ |
The second Riddel relation and its consequences V. A. Voblyi Diskretn. Anal. Issled. Oper., 26:1 (2019), 20–32
|
3. |
V. A. Voblyi, “O perechislenii pomechennykh posledovatelno-parallelnykh $k$-tsiklicheskikh $2$-svyaznykh grafov”, Diskretn. analiz i issled. oper., 28:1 (2021), 5–14 |
→ |
The second Riddel relation and its consequences V. A. Voblyi Diskretn. Anal. Issled. Oper., 26:1 (2019), 20–32
|
4. |
V. A. Voblyi, “Asimptoticheskoe perechislenie pomechennykh posledovatelno-parallelnykh $k$-tsiklicheskikh grafov bez mostov”, Diskretn. analiz i issled. oper., 28:4 (2021), 61–69 |
→ |
The second Riddel relation and its consequences V. A. Voblyi Diskretn. Anal. Issled. Oper., 26:1 (2019), 20–32
|
5. |
V. A. Voblyi, “Asymptotic Enumeration of Labeled Series-Parallel $k$-Cyclic Bridgeless Graphs”, J. Appl. Ind. Math., 15:4 (2021), 711 |
→ |
The second Riddel relation and its consequences V. A. Voblyi Diskretn. Anal. Issled. Oper., 26:1 (2019), 20–32
|
|
6. |
A. V. Khorkov, Sh. I. Galiev, “Optimization of a k-covering of a bounded set with circles of two given radii”, Open Comput. Sci., 11:1 (2021), 232–240 |
→ |
On the number and arrangement of sensors for the multiple covering of bounded plane domains Sh. I. Galiev, A. V. Khorkov Diskretn. Anal. Issled. Oper., 26:1 (2019), 33–54
|
|
7. |
K. A. Popkov, “O skhemakh, dopuskayuschikh korotkie edinichnye proveryayuschie testy pri proizvolnykh neispravnostyakh funktsionalnykh elementov”, PDM, 2021, № 51, 85–100 |
→ |
Short complete fault detection tests for logic networks with fan-in two K. A. Popkov Diskretn. Anal. Issled. Oper., 26:1 (2019), 89–113
|
8. |
N. E. Aleksandrova, D. S. Romanov, “Lower Bound of the Length of a Single Fault Diagnostic Test with Respect to Insertions of a Mod-2 Adder”, Comput Math Model, 32:4 (2021), 500 |
→ |
Short complete fault detection tests for logic networks with fan-in two K. A. Popkov Diskretn. Anal. Issled. Oper., 26:1 (2019), 89–113
|
|
9. |
Yury Nikulin, Vladimir Emelichev, Lecture Notes in Computer Science, 13078, Optimization and Applications, 2021, 303 |
→ |
Estimating the stability radius of an optimal solution to the simple assembly line balancing problem K. G. Kuzmin, V. R. Haritonova Diskretn. Anal. Issled. Oper., 26:2 (2019), 79–97
|
|
10. |
Dennis Schüsselbauer, Andreas Schmid, Raphael Wimmer, Proceedings of the Fifteenth International Conference on Tangible, Embedded, and Embodied Interaction, 2021, 1 |
→ |
On a construction of easily decodable sub-de Bruijn arrays D. A. Makarov, A. D. Yashunsky Diskretn. Anal. Issled. Oper., 26:2 (2019), 98–114
|
|
11. |
Stanislav S. Malakhov, Mikhail I. Rozhkov, 2021 International Conference Engineering Technologies and Computer Science (EnT), 2021, 56 |
→ |
Experimental methods for constructing MDS matrices of a special form M. I. Rozhkov, S. S. Malakhov Diskretn. Anal. Issled. Oper., 26:2 (2019), 115–128
|
|
12. |
S. N. Selezneva, “O svoistvakh multiaffinnykh predikatov na konechnom mnozhestve”, Diskret. matem., 33:4 (2021), 141–152 |
→ |
On $m$-junctive predicates on a finite set S. N. Selezneva Diskretn. Anal. Issled. Oper., 26:3 (2019), 46–59
|
|
13. |
R. Yu. Simanchev, P. V. Soloveva, I. V. Urazova, “Affinnaya obolochka mnogogrannika raspisanii obsluzhivaniya identichnykh trebovanii parallelnymi priborami”, Diskretn. analiz i issled. oper., 28:1 (2021), 48–67 |
→ |
The branch and cut method for the clique partitioning problem R. Yu. Simanchev, I. V. Urazova, Yu. A. Kochetov Diskretn. Anal. Issled. Oper., 26:3 (2019), 60–87
|
14. |
R. Yu. Simanchev, I. V. Urazova, Communications in Computer and Information Science, 1476, Mathematical Optimization Theory and Operations Research: Recent Trends, 2021, 257 |
→ |
The branch and cut method for the clique partitioning problem R. Yu. Simanchev, I. V. Urazova, Yu. A. Kochetov Diskretn. Anal. Issled. Oper., 26:3 (2019), 60–87
|
|
15. |
V. A. Voblyi, “Asimptoticheskoe perechislenie pomechennykh posledovatelno-parallelnykh $k$-tsiklicheskikh grafov bez mostov”, Diskretn. analiz i issled. oper., 28:4 (2021), 61–69 |
→ |
On the number of labeled outerplanar $k$-cyclic bridgeless graphs V. A. Voblyi Diskretn. Anal. Issled. Oper., 27:1 (2020), 5–16
|
16. |
V. A. Voblyi, “Asymptotic Enumeration of Labeled Series-Parallel $k$-Cyclic Bridgeless Graphs”, J. Appl. Ind. Math., 15:4 (2021), 711 |
→ |
On the number of labeled outerplanar $k$-cyclic bridgeless graphs V. A. Voblyi Diskretn. Anal. Issled. Oper., 27:1 (2020), 5–16
|
|
17. |
Yu. V. Kosolapov, E. A. Lelyuk, “O razlozhimosti proizvedeniya Shura — Adamara summy tenzornykh proizvedenii kodov Rida — Mallera”, PDM. Prilozhenie, 2021, № 14, 158–161 |
→ |
A graph-theoretical method for decoding some group MLD-codes V. M. Deundyak, E. A. Lelyuk Diskretn. Anal. Issled. Oper., 27:2 (2020), 17–42
|
|
18. |
I. N. Kulachenko, P. A. Kononova, “Gibridnyi algoritm resheniya zadachi marshrutizatsii burovykh ustanovok”, Diskretn. analiz i issled. oper., 28:2 (2021), 35–59 |
→ |
A hybrid local search algorithm for consistent periodic vehicle routing problem I. N. Kulachenko, P. A. Kononova Diskretn. Anal. Issled. Oper., 27:2 (2020), 43–64
|
|
19. |
M. B. Abrosimov, I. V. Los, S. V. Kostin, “Primitivnye odnorodnye grafy s eksponentom 2 i chislom vershin do 16”, Izv. Sarat. un-ta. Nov. ser. Ser.: Matematika. Mekhanika. Informatika, 21:2 (2021), 238–245 |
→ |
Exact formula for exponents of mixing digraphs for register transformations V. M. Fomichev, Ya. E. Avezova Diskretn. Anal. Issled. Oper., 27:2 (2020), 117–135
|
20. |
M. B. Abrosimov, S. V. Kostin, I. V. Los, “O naibolshem chisle vershin primitivnykh odnorodnykh grafov poryadka $2, 3, 4$ s eksponentom, ravnym $2$”, PDM, 2021, № 52, 97–104 |
→ |
Exact formula for exponents of mixing digraphs for register transformations V. M. Fomichev, Ya. E. Avezova Diskretn. Anal. Issled. Oper., 27:2 (2020), 117–135
|
|
|
Total publications: |
1346 |
Scientific articles: |
1294 |
Authors: |
710 |
Citations: |
4096 |
Cited articles: |
734 |
|
Scopus Metrics |
|
2023 |
CiteScore |
1.000 |
|
2023 |
SNIP |
0.561 |
|
2023 |
SJR |
0.348 |
|
2022 |
SJR |
0.417 |
|
2021 |
SJR |
0.391 |
|
2020 |
SJR |
0.396 |
|
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 |
|