Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii

Most published authors of the journal
1. E. Kh. Gimadi 45
2. A. V. Pyatkin 32
3. V. G. Vizing 27
4. D. S. Malyshev 26
5. S. V. Sevast'yanov 24
6. V. L. Beresnev 23
7. S. S. Marchenkov 23
8. O. V. Borodin 22
9. N. I. Glebov 20
10. Yu. A. Kochetov 20
40 most published authors of the journal

Most cited authors of the journal
1. O. V. Borodin 262
2. A. V. Kel'manov 183
3. A. V. Pyatkin 182
4. E. Kh. Gimadi 180
5. A. N. Glebov 136
6. S. V. Avgustinovich 111
7. Yu. A. Kochetov 108
8. V. G. Vizing 92
9. A. O. Ivanova 88
10. V. A. Emelichev 86
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. Generalizations of bent functions
N. N. Tokareva
Diskretn. Anal. Issled. Oper., 2010, 17:1, 34–64 		32
3. 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
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. 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 		26
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 		26
7. 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
8. $Z_4$-linear perfect codes
D. S. Krotov
Diskretn. Anal. Issled. Oper., 1, 2000, 7:4, 78–90 		24
9. The approximation algorithm for one problem of searching for subset of vectors
A. V. Kel'manov, S. M. Romanchenko
Diskretn. Anal. Issled. Oper., 2011, 18:1, 61–69 		22
10. 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
40 most cited articles of the journal

Most requested articles of the journal
| this week | this month | all time |
1. On construction of vertex-transitive partitions of $n$-cube into perfect codes
F. I. Solov'eva, G. K. Guskov
Diskretn. Anal. Issled. Oper., 2010, 17:3, 84–100 		7
2. A cut generation algorithm of finding an optimal solution in a market competition
V. L. Beresnev, A. A. Melnikov
Diskretn. Anal. Issled. Oper., 2019, 26:2, 5–29 		7
3. Polynomial solvability of scheduling problems with storable resources and directive deadlines
E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov
Diskretn. Anal. Issled. Oper., 2, 2000, 7:1, 9–34 		6
4. Independence sets of graphs with bounded minors of the augmented incidence matrix
V. E. Alekseev, D. V. Zakharova
Diskretn. Anal. Issled. Oper., 2010, 17:1, 3–10 		6
5. Multiple circle coverings of an equilateral triangle, square, and circle
Sh. I. Galiev, A. V. Khorkov
Diskretn. Anal. Issled. Oper., 2015, 22:6, 5–28 		6
6. 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., 2018, 25:3, 95–125 		6
7. A local search algorithm for the single machine scheduling problem with setups and a storage
P. A. Kononova, Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., 2019, 26:2, 60–78 		6
8. 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 		6
9. On degree of nonlinearity of the coordinate polynomials for a product of transformations of a binary vector space
V. M. Fomichev
Diskretn. Anal. Issled. Oper., 2021, 28:2, 74–91 		6
10. The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem
Yu. A. Kochetov, A. A. Stolyar
Diskretn. Anal. Issled. Oper., 2, 2003, 10:2, 29–55 		5
Дискретный анализ и исследование операций
Total publications: 1274
Scientific articles: 1223
Authors: 641
Citations: 3068
Cited articles: 656

Impact-factor Math-Net.Ru
for 2020: 0.556
for 2019: 0.358
for 2018: 0.780
for 2017: 0.607
for 2016: 0.390
for 2015: 0.384
for 2014: 0.537
for 2013: 0.506
for 2012: 0.553
for 2011: 0.716
for 2010: 0.456
for 2009: 0.438
for 2008: 0.368
for 2007: 0.250
for 2006: 0.203
for 2005: 0.206
for 2004: 0.185
for 2003: 0.338

Scopus Metrics
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

Most published authors
Most cited authors
Most cited articles
Most requested articles
 
Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021