|
Diskretnyi Analiz i Issledovanie Operatsii
Most published authors of the journal |
1. |
A. V. Pyatkin |
32 |
2. |
E. Kh. Gimadi |
31 |
3. |
V. G. Vizing |
26 |
4. |
D. S. Malyshev |
24 |
5. |
S. S. Marchenkov |
23 |
6. |
O. V. Borodin |
22 |
7. |
V. A. Emelichev |
19 |
8. |
S. V. Avgustinovich |
18 |
9. |
Yu. A. Kochetov |
17 |
10. |
A. N. Glebov |
16 |
|
40 most published authors of the journal |
|
Most cited authors of the journal |
1. |
O. V. Borodin |
253 |
2. |
A. V. Pyatkin |
176 |
3. |
E. Kh. Gimadi |
174 |
4. |
A. V. Kel'manov |
169 |
5. |
A. N. Glebov |
131 |
6. |
S. V. Avgustinovich |
99 |
7. |
Yu. A. Kochetov |
98 |
8. |
V. G. Vizing |
92 |
9. |
A. O. Ivanova |
86 |
10. |
V. A. Emelichev |
83 |
|
40 most cited authors of the journal |
|
Most cited articles of the journal |
1. |
On extensions of partial geometries containing small $\mu$-subgraphs A. A. Makhnev Diskretn. Anal. Issled. Oper., 1996, 3:3, 71–83 |
42 |
2. |
Minimal degrees and chromatic numbers of squares of planar graphs O. V. Borodin, H. Broersma, A. N. Glebov, J. van den Heuvel Diskretn. Anal. Issled. Oper., 1, 2001, 8:4, 9–33 |
31 |
3. |
Generalizations of bent functions N. N. Tokareva Diskretn. Anal. Issled. Oper., 2010, 17:1, 34–64 |
28 |
4. |
The problem of finding a subset of vectors with the maximum total weight A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 2, 2007, 14:1, 32–42 |
27 |
5. |
A polynomial algorithm for finding the largest independent sets in claw-free graphs V. E. Alekseev Diskretn. Anal. Issled. Oper., 1, 1999, 6:4, 3–19 |
25 |
6. |
Stability and regularization of vector problems of integer linear programming V. A. Emelichev, D. P. Podkopaev Diskretn. Anal. Issled. Oper., 2, 2001, 8:1, 47–69 |
25 |
7. |
NP-completeness of some problems of a vectors subset choice A. V. Kel'manov, A. V. Pyatkin Diskretn. Anal. Issled. Oper., 2010, 17:5, 37–45 |
24 |
8. |
$Z_4$-linear perfect codes D. S. Krotov Diskretn. Anal. Issled. Oper., 1, 2000, 7:4, 78–90 |
23 |
9. |
The structure of plane triangulations in terms of clusters and stars O. V. Borodin, H. Broersma, A. N. Glebov, J. van den Heuvel Diskretn. Anal. Issled. Oper., 1, 2001, 8:2, 15–39 |
22 |
10. |
On the average time for the computation of the values of Boolean functions A. V. Chashkin Diskretn. Anal. Issled. Oper., 1, 1997, 4:1, 60–78 |
21 |
|
40 most cited articles of the journal |
|
Most requested articles of the journal |
|
|
1. |
Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints F. S. Stonyakin, M. Alkousa, A. N. Stepanov, A. A. Titov Diskretn. Anal. Issled. Oper., 2019, 26:3, 88–114 | 13 |
2. |
Использование закона Ципфа для сжатия текстов M. P. Bakulina Diskretn. Anal. Issled. Oper., 2, 2007, 14:2, 3–13 | 8 |
3. |
Asymptotic approximation for the number of graphs T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 2017, 24:2, 68–86 | 8 |
4. |
The number of $k$-nonseparated families of subsets of an $n$-element set ($k$-nonseparated Boolean functions of $n$ variables). II. The case of odd $n$ and $k=2$ A. D. Korshunov Diskretn. Anal. Issled. Oper., 1, 2005, 12:1, 12–70 | 7 |
5. |
On the stochastic problem of compact vector summation R. A. Koryakin, S. V. Sevast'yanov Diskretn. Anal. Issled. Oper., 1, 2005, 12:1, 71–100 | 7 |
6. |
The number of $k$-nonseparated families of subsets of an $n$-element set ($k$-nonseparated Boolean functions of $n$-variables). III. The case of $k\geq 3$ and arbitrary $n$ A. D. Korshunov Diskretn. Anal. Issled. Oper., 1, 2005, 12:3, 60–73 | 7 |
7. |
Optimal matrix correction of incompatible systems of linear algebraic equations with block matrices of coefficients V. A. Gorelik, V. I. Erokhin, R. V. Pechenkin Diskretn. Anal. Issled. Oper., 2, 2005, 12:2, 3–23 | 7 |
8. |
New results in the theory of search M. B. Belyaeva, M. Yu. Mitrofanov Diskretn. Anal. Issled. Oper., 2, 2004, 11:1, 26–50 | 7 |
9. |
On the minor characteristics of orthogonal integer lattices S. I. Veselov, V. N. Shevchenko Diskretn. Anal. Issled. Oper., 2008, 15:4, 25–29 | 7 |
10. |
A branch and bound method for the facility location problem with customer preferences I. L. Vasiliev, K. B. Klimentova Diskretn. Anal. Issled. Oper., 2009, 16:2, 21–41 | 7 |
|
Total publications: |
956 |
Scientific articles: |
912 |
Authors: |
463 |
Citations: |
2871 |
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 |
|