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

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

Most published authors (scientific articles only) of the journal

scientific articles published in peer review journal, serial, conference publications, indexed in international bibliographical databases and/or having DOI index
1. E. Kh. Gimadi 45
2. A. V. Pyatkin 35
3. D. S. Malyshev 29
4. V. G. Vizing 27
5. V. L. Beresnev 26
6. S. V. Sevast'yanov 24
7. Yu. A. Kochetov 23
8. S. S. Marchenkov 23
9. O. V. Borodin 22
10. N. I. Glebov 20
11. S. V. Avgustinovich 19
12. V. A. Emelichev 19
13. A. I. Serdyukov 18
14. A. V. Plyasunov 17
15. A. A. Ageev 16
16. A. N. Glebov 16
17. A. V. Kel'manov 15
18. V. E. Alekseev 13
19. A. A. Melnikov 13
20. A. L. Perezhogin 13
21. T. I. Fedoryaeva 13
22. A. V. Chashkin 13
23. Yu. V. Shamardin 13
40 most published authors of the journal

Most cited authors of the journal
1. A. V. Kel'manov 290
2. O. V. Borodin 282
3. A. V. Pyatkin 253
4. E. Kh. Gimadi 228
5. Yu. A. Kochetov 152
6. A. N. Glebov 151
7. D. S. Malyshev 131
8. S. V. Avgustinovich 127
9. A. V. Plyasunov 116
10. A. O. Ivanova 104
11. V. E. Alekseev 99
12. A. V. Kononov 98
13. A. E. Baburin 94
14. V. G. Vizing 94
15. V. A. Emelichev 91
16. S. S. Marchenkov 91
17. V. V. Shenmaier 89
18. A. A. Panin 85
19. V. L. Beresnev 82
20. S. M. Romanchenko 75
21. N. N. Tokareva 75
40 most cited authors of the journal

Most cited articles of the journal
1. Generalizations of bent functions
N. N. Tokareva
Diskretn. Anal. Issled. Oper., 2010, 17:1, 34–64 		56
2. On extensions of partial geometries containing small $\mu$-subgraphs
A. A. Makhnev
Diskretn. Anal. Issled. Oper., 1996, 3:3, 71–83 		42
3. 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 		40
4. FPTAS for solving a problem of search for a vector subset
A. V. Kel'manov, S. M. Romanchenko
Diskretn. Anal. Issled. Oper., 2014, 21:3, 41–52 		34
5. 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 		33
6. 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 		32
7. On one variant of the vectors subset choice problem
A. V. Kel'manov, A. V. Pyatkin
Diskretn. Anal. Issled. Oper., 2008, 15:5, 20–34 		32
8. Approximation scheme for one problem of a vector subset choice
V. V. Shenmaier
Diskretn. Anal. Issled. Oper., 2012, 19:2, 92–100 		31
9. 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
10. Solving some vector subset problems by Voronoi diagrams
V. V. Shenmaier
Diskretn. Anal. Issled. Oper., 2016, 23:4, 102–115 		30
11. Computational complexity of the graph approximation problem
A. A. Ageev, V. P. Il'ev, A. V. Kononov, A. S. Televnin
Diskretn. Anal. Issled. Oper., 1, 2006, 13:1, 3–15 		30
12. An approximation algorithm for one problem of cluster analysis
A. V. Dolgushev, A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2011, 18:2, 29–40 		29
13. Upper bounds for goal functions of discrete competitive facility location problems
V. L. Beresnev
Diskretn. Anal. Issled. Oper., 2008, 15:4, 3–24 		29
14. 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 		28
15. 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 		28
16. Variable neighborhood search for two machine flowshop problem with a passive prefetch
P. A. Kononova, Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., 2012, 19:5, 63–82 		27
17. 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 		27
18. 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
19. On polynomial solvability of some vector subset problems in Euclidean space with fixed dimension
E. Kh. Gimadi, A. V. Pyatkin, I. A. Rykov
Diskretn. Anal. Issled. Oper., 2008, 15:6, 11–19 		25
20. 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 		25
21. $Z_4$-linear perfect codes
D. S. Krotov
Diskretn. Anal. Issled. Oper., 1, 2000, 7:4, 78–90 		25
40 most cited articles of the journal

Most requested articles of the journal
| one week | one month | one year | all time |
1. Generalizations of bent functions
N. N. Tokareva
Diskretn. Anal. Issled. Oper., 2010, 17:1, 34–64 		10
2. Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
E. S. Malygina, A. V. Kutsenko, S. A. Novoselov, N. S. Kolesnikov, A. O. Bakharev, I. S. Khilchuk, A. S. Shaporenko, N. N. Tokareva
Diskretn. Anal. Issled. Oper., 2023, 30:4, 46–90 		10
3. The functional graph of a linear discrete dynamical system with two dominating vertices
A. S. Parfinenko, A. L. Perezhogin
Diskretn. Anal. Issled. Oper., 2018, 25:4, 81–96 		8
4. Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
A. O. Bakharev
Diskretn. Anal. Issled. Oper., 2023, 30:3, 5–42 		8
5. A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem
A. G. Klyuchikov, M. N. Vyalyi
Diskretn. Anal. Issled. Oper., 2021, 28:4, 117–124 		7
6. On one of the possibilities of sharpening estimates for the delay of a parallel adder
V. M. Khrapchenko
Diskretn. Anal. Issled. Oper., 1, 2007, 14:1, 86–93 		6
7. On a property of perfect binary codes
S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., 1995, 2:1, 4–6 		6
8. On a generalization of $N$-nucleolus in cooperative games
N. V. Smirnova, S. I. Tarashina
Diskretn. Anal. Issled. Oper., 2011, 18:4, 77–93 		6
9. Permutation binomial functions over finite fields
A. V. Miloserdov
Diskretn. Anal. Issled. Oper., 2018, 25:4, 59–80 		6
10. Stability of vertex covers in a game with finitely many steps
V. L. Beresnev, A. A. Melnikov, S. Yu. Utyupin
Diskretn. Anal. Issled. Oper., 2024, 31:2, 28–45 		6
Дискретный анализ и исследование операций
Total publications: 1346
Scientific articles: 1294
Authors: 710
Citations: 4090
Cited articles: 734

Impact-factor Math-Net.Ru
for 2021: 0.431
for 2020: 0.741
for 2019: 0.453
for 2018: 1.200
for 2017: 0.714
for 2016: 0.636
for 2015: 0.523
for 2014: 0.537
for 2013: 0.506
for 2012: 0.553
for 2011: 0.743
for 2010: 0.494
for 2009: 0.450
for 2008: 0.395
for 2007: 0.250
for 2006: 0.203
for 2005: 0.206
for 2004: 0.185
for 2003: 0.338

Scopus Metrics
2023 CiteScore 1.000
2023 SNIP 0.561
2023 SJR 0.348
2022 SJR 0.417
2021 SJR 0.391
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, 2024