RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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 31
2. A. V. Pyatkin 31
3. V. G. Vizing 26
4. O. V. Borodin 22
5. S. S. Marchenkov 22
6. D. S. Malyshev 19
7. V. A. Emelichev 18
8. S. V. Avgustinovich 17
9. A. V. Kel'manov 15
10. Yu. A. Kochetov 15
11. S. V. Sevast'yanov 15
40 most published authors of the journal

Most cited authors of the journal
1. O. V. Borodin 244
2. E. Kh. Gimadi 151
3. A. V. Pyatkin 150
4. A. V. Kel'manov 140
5. A. N. Glebov 117
6. V. G. Vizing 90
7. S. V. Avgustinovich 85
8. A. O. Ivanova 82
9. Yu. A. Kochetov 76
10. V. E. Alekseev 75
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 		30
3. 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
4. Generalizations of bent functions
N. N. Tokareva
Diskretn. Anal. Issled. Oper., 2010, 17:1, 34–64 		24
5. $Z_4$-linear perfect codes
D. S. Krotov
Diskretn. Anal. Issled. Oper., 1, 2000, 7:4, 78–90 		23
6. 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 		22
7. 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 		22
8. 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 		21
9. 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 		21
10. Oriented 5-coloring of sparse plane graphs
O. V. Borodin, A. O. Ivanova, A. V. Kostochka
Diskretn. Anal. Issled. Oper., 1, 2006, 13:1, 16–32 		20
11. Lower bounds for the number of $m$-quasigroups of order four and of the number of perfect binary codes
D. S. Krotov
Diskretn. Anal. Issled. Oper., 1, 2000, 7:2, 47–53 		20
40 most cited articles of the journal

Most requested articles of the journal
| this week | this month | all time |
1. Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes
K. L. Rychkov
Diskretn. Anal. Issled. Oper., 2018, 25:3, 36–94 		9
2. On existence of Walras equilibrium in a multi-regional economic model
V. A. Vasil'ev
Diskretn. Anal. Issled. Oper., 2012, 19:4, 15–34 		7
3. Finding the distance between the ellipsoids
G. Sh. Tamasyan, A. A. Chumakov
Diskretn. Anal. Issled. Oper., 2014, 21:3, 87–102 		6
4. A three-phase heuristic for the vehicle fleet and route optimization
A. V. Khmelev
Diskretn. Anal. Issled. Oper., 2015, 22:6, 55–77 		5
5. On teaching sets for $2$-threshold functions of two variables
E. M. Zamaraeva
Diskretn. Anal. Issled. Oper., 2017, 24:1, 31–55 		5
6. Distributive coloring of graph vertices
V. G. Vizing
Diskretn. Anal. Issled. Oper., 1995, 2:4, 3–12 		4
7. An exact algorithm for solving the discrete Weber problem for a $k$-tree
A. V. Panyukov, R. E. Shangin
Diskretn. Anal. Issled. Oper., 2014, 21:3, 64–75 		4
8. On an extremal inverse problem in graph theory
A. B. Dainiak, A. D. Kurnosov
Diskretn. Anal. Issled. Oper., 2015, 22:1, 19–31 		4
9. Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes
A. N. Maksimenko
Diskretn. Anal. Issled. Oper., 2016, 23:3, 61–80 		4
10. Certain generalization of the maximum traveling salesman problem
A. E. Baburin, E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., 1, 2006, 13:3, 3–12 		3
Дискретный анализ и исследование операций
Total publications: 901
Scientific articles: 857
Authors: 438
Citations: 2491
Cited articles: 582

Impact-factor Math-Net.Ru
for 2017: 0.607
for 2016: 0.390
for 2015: 0.384
for 2014: 0.537
for 2013: 0.494
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
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  Logotypes © Steklov Mathematical Institute RAS, 2018