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

Author Index, 2017, Volume 24

B C D E F G I K L M O P S T V Z Full List
V. L. Beresnev, A. A. Melnikov
An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  5–21
Yu. E. Bessonov, A. A. Dobrynin
Lattice complete graphs
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  22–33
E. A. Bobrova, V. V. Servakh
Construction of cyclic schedules in presence of parallel machines
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  5–20
I. S. Bykov, A. L. Perezhogin
On distance Gray codes
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  5–17
I. P. Chukhrov
Proof of covering minimality by generalizing the notion of independence
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  87–106
A. A. Dobrynin, see Yu. E. Bessonov
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  22–33
A. V. Eremeev
On computational complexity of the electric power flow optimization problem in market environment
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  47–59
T. I. Fedoryaeva
Asymptotic approximation for the number of graphs
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  68–86
V. M. Fomichev, S. N. Kyazhin
Local primitivity of matrices and graphs
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  97–119
V. M. Fomichev, see A. M. Koreneva
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  32–52
V. M. Fomichev
Computational complexity of the original and extended Diophantine Frobenius problem
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  104–124
E. Kh. Gimadi, O. Yu. Tsidulko
An asymptotically optimal algorithm for the $m$-peripatetic salesman problem on random inputs with discrete distribution
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  5–19
M. O. Golovachev, A. V. Pyatkin
On $(1,l)$-coloring of incidentors of multigraphs
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  34–46
P. A. Irzhavskii, Yu. A. Kartynnik, Yu. L. Orlovich
$1$-Triangle graphs and perfect neighborhood sets
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  56–80
Yu. A. Kartynnik, see P. A. Irzhavski
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  56–80
A. M. Koreneva, V. M. Fomichev
The mixing properties of modified additive generators
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  32–52
S. N. Kyazhin, see V. M. Fomichev
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  97–119
M. A. Lisitsyna, O. G. Parshina
Perfect colorings of the infinite circulant graph with distances 1 and 2
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  20–34
D. S. Malyshev
Critical elements in combinatorially closed families of graph classes
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  81–96
D. S. Malyshev, D. V. Sirotkin
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  35–60
S. A. Malyugin
Perfect binary codes of infinite length
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  53–67
S. S. Marchenkov
On the operations of bounded suffix summation and multiplication
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  60–76
A. K. Meleshko, see V. A. Voblyi
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  18–31
A. A. Melnikov, see V. L. Beresnev
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  5–21
D. B. Mokeev
On König graphs with respect to $P_4$
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  61–79
Yu. L. Orlovich, see P. A. Irzhavski
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  56–80
O. G. Parshina, see M. A. Lisitsyna
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  20–34
A. L. Perezhogin, see I. S. Bykov
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  5–17
O. V. Pinyagina
The network equilibrium problem with mixed demand
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  77–94
K. A. Popkov
On the exact value of the length of the minimal single diagnostic test for a particular class of circuits
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  80–103
A. V. Pyatkin, see E. I. Vasilyeva
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  21–30
A. V. Pyatkin, see M. O. Golovachev
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  34–46
V. V. Servakh, see E. A. Bobrova
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  5–20
V. V. Shenmaier
An exact algorithm for finding a vector subset with the longest sum
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  111–129
R. Yu. Simanchev
On facet-inducing inequalities for combinatorial polytopes
Diskretn. Anal. Issled. Oper., 2017, Volume 24:4,  95–110
D. V. Sirotkin, see D. S. Malyshev
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  35–60
O. Yu. Tsidulko, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., 2017, Volume 24:3,  5–19
E. I. Vasilyeva, A. V. Pyatkin
On list incidentor $(k,l)$-colorings
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  21–30
V. A. Voblyi, A. K. Meleshko
Enumeration of labeled outerplanar bicyclic and tricyclic graphs
Diskretn. Anal. Issled. Oper., 2017, Volume 24:2,  18–31
E. M. Zamaraeva
On teaching sets for $2$-threshold functions of two variables
Diskretn. Anal. Issled. Oper., 2017, Volume 24:1,  31–55
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021