RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

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 218
2. E. Kh. Gimadi 142
3. A. V. Pyatkin 140
4. A. V. Kel'manov 111
5. A. N. Glebov 105
6. V. G. Vizing 90
7. A. O. Ivanova 79
8. S. V. Avgustinovich 75
9. V. A. Emelichev 71
10. Yu. A. Kochetov 71
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 		27
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 		22
4. 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 		20
5. 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
6. 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 		20
7. 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 		20
8. 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 		19
9. $Z_4$-linear perfect codes
D. S. Krotov
Diskretn. Anal. Issled. Oper., 1, 2000, 7:4, 78–90 		19
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 		18
40 most cited articles of the journal

Most requested articles of the journal
| this week | this month | all time |
1. Independent sets in graphs without subtrees with many leaves
V. E. Alekseev, D. V. Zakharova
Diskretn. Anal. Issled. Oper., 2016, 23:1, 5–16 		5
2. Word-representable graphs: a survey
s. V. Kitaev, A. V. Pyatkin
Diskretn. Anal. Issled. Oper., 2018, 25:2, 19–53 		4
3. An algorithm for the formation of a hierarchical system of invariants of isomorphisms of mappings of finite sets
Yu. I. Brodskii, V. I. Novitskii, Yu. N. Pavlovsky
Diskretn. Anal. Issled. Oper., 2, 2006, 13:2, 21–30 		3
4. Nonsystematic perfect binary codes
S. A. Malyugin
Diskretn. Anal. Issled. Oper., 1, 2001, 8:1, 55–76 		3
5. 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 		3
6. An efficient method for the randomization of messages based on arithmetic coding
A. N. Fionov
Diskretn. Anal. Issled. Oper., 1, 1997, 4:2, 51–74 		3
7. In memory of Oleg Borisovich Lupanov (1932–2006)
Diskretn. Anal. Issled. Oper., 1, 2007, 14:1, 3–20 		2
8. Генетический локальный поиск для задачи о $p$-медиане с предпочтениями клиентов
E. V. Alekseeva, Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., 2, 2007, 14:1, 3–31 		2
9. On the construction of schemes for adders of small depth
S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev
Diskretn. Anal. Issled. Oper., 1, 2007, 14:1, 27–44 		2
10. Метод декомпозиции для задачи о $p$-медиане на несвязном графе
I. L. Vasiliev
Diskretn. Anal. Issled. Oper., 2, 2007, 14:1, 43–58 		2
Дискретный анализ и исследование операций
Total publications: 896
Scientific articles: 852
Authors: 436
Citations: 2244
Cited articles: 552

Impact-factor Math-Net.Ru
for 2015: 0.372
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