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 31
2. A. V. Pyatkin 31
3. V. G. Vizing 26
4. S. S. Marchenkov 23
5. O. V. Borodin 22
6. D. S. Malyshev 21
7. V. A. Emelichev 19
8. S. V. Avgustinovich 18
9. Yu. A. Kochetov 17
10. A. N. Glebov 15
11. A. V. Kel'manov 15
12. S. V. Sevast'yanov 15
40 most published authors of the journal

Most cited authors of the journal
1. O. V. Borodin 249
2. A. V. Pyatkin 165
3. E. Kh. Gimadi 163
4. A. V. Kel'manov 153
5. A. N. Glebov 123
6. S. V. Avgustinovich 92
7. V. G. Vizing 92
8. Yu. A. Kochetov 86
9. A. O. Ivanova 84
10. V. A. Emelichev 81
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. 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 		25
5. Generalizations of bent functions
N. N. Tokareva
Diskretn. Anal. Issled. Oper., 2010, 17:1, 34–64 		24
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 		24
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 		23
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 		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
12. 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 		20
40 most cited articles of the journal

Most requested articles of the journal
| this week | this month | all time |
1. 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 		12
2. The branch and bound method for the simplest two-level problem of facility location
E. N. Goncharov
Diskretn. Anal. Issled. Oper., 2, 1998, 5:1, 19–39 		11
3. On the minor characteristics of orthogonal integer lattices
S. I. Veselov, V. N. Shevchenko
Diskretn. Anal. Issled. Oper., 2008, 15:4, 25–29 		7
4. Rows of Pascal's triangle modulo a prime
V. V. Karachik
Diskretn. Anal. Issled. Oper., 2013, 20:2, 26–46 		7
5. Bounds on average number of iterations of the algorithms for solving some Boolean programming problems
L. A. Zaozerskaya, A. A. Kolokolov, N. G. Gofman
Diskretn. Anal. Issled. Oper., 2011, 18:3, 49–64 		6
6. The problem of locating rectangular plants with minimal cost for the connecting network
A. V. Panyukov
Diskretn. Anal. Issled. Oper., 2, 2001, 8:1, 70–87 		5
7. Генетический локальный поиск для задачи о $p$-медиане с предпочтениями клиентов
E. V. Alekseeva, Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., 2, 2007, 14:1, 3–31 		4
8. In memory of Oleg Borisovich Lupanov (1932–2006)
Diskretn. Anal. Issled. Oper., 1, 2007, 14:1, 3–20 		4
9. The set covering problem: complexity, algorithms, and experimental investigations
A. V. Eremeev, L. A. Zaozerskaya, A. A. Kolokolov
Diskretn. Anal. Issled. Oper., 2, 2000, 7:2, 22–46 		4
10. A 2-approximation algorithm for the metric 2-peripatetic salesman problem
A. A. Ageev, A. V. Pyatkin
Diskretn. Anal. Issled. Oper., 2009, 16:4, 3–20 		4
Дискретный анализ и исследование операций
Total publications: 937
Scientific articles: 893
Authors: 455
Citations: 2689
Cited articles: 604

Impact-factor Math-Net.Ru
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
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  Logotypes © Steklov Mathematical Institute RAS, 2020