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, 2014, Volume 21

A B C D E F G I K M N O P R S T V Z Full List
A. A. Ageev, A. V. Kel'manov, A. V. Pyatkin
Complexity of the Euclidean max cut problem
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  3–11
M. A. Alekhina, O. Yu. Barsukova
On reliability of circuits realizing ternary logic functions
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  12–24
O. Yu. Barsukova, see M. A. Alekhina
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  12–24
Ts. Ch.-D. Batueva
Discrete dynamical systems with threshold functions at the vertices
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  25–32
V. L. Beresnev, A. A. Melnikov
Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  3–23
A. Yu. Bernshtein
$3$-regular subgraphs and $(3,1)$-colorings of $4$-regular pseudographs
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  3–16
V. A. Bulavskii, N. V. Shestakova
On the calculation of rent estimates
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  4–10
I. P. Chukhrov
Minimal complexes of faces of a random Boolean function
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  76–94
A. A. Chumakov, see G. Sh. Tamasyan
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  87–102
I. A. Davydov, P. A. Kononova, Yu. A. Kochetov
Local search with exponential neighborhood for the servers load balancing problem
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  21–34
A. A. Evdokimov, T. I. Fedoryaeva
On the description problem of the diversity vectors of balls
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  44–52
A. A. Evdokimov, S. E. Kochemazov, I. V. Otpushennikov, A. A. Semenov
Analysis of discrete automaton models of gene networks with irregular structure using symbolic algorithms
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  25–40
T. I. Fedoryaeva, see A. A. Evdokimov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  44–52
S. Yu. Filyuzin
On algebraic immunity of Dillon's bent functions
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  67–75
R. A. Gimadeev, see M. N. Vyalyi
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  3–14
E. Kh. Gimadi, Yu. V. Glazkov, O. Yu. Tsidulko
The probabilistic analysis of an algorithm for solving the $m$-planar $3$-dimensional assignment problem on one-cycle permutations
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  15–29
Yu. V. Glazkov, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  15–29
A. N. Glebov, D. Zh. Zambalaeva
A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  33–51
A. N. Glebov, D. Zh. Zambalaeva, A. A. Skretneva
$2/3$-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  11–20
E. N. Goncharov
A stochastic greedy algorithm for the resource-constrained project scheduling problem
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  11–24
S. M. Grabovskaya
On upper bound of non-branching programs unreliability at one-type constant faults on the computational operators outputs
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  30–43
A. M. Istomin
Probabilistic analysis of one routing problem
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  42–53
A. V. Kelmanov, S. A. Khamidullin
Approximation algorithm for one problem of partitioning a sequence
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  53–66
A. V. Kel'manov, S. M. Romanchenko
FPTAS for solving a problem of search for a vector subset
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  41–52
A. V. Kel'manov, see A. A. Ageev
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  3–11
S. A. Khamidullin, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  53–66
S. E. Kochemazov, see A. A. Evdokimov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  25–40
V. V. Kochergin
Improvement of complexity bounds of monomials and sets of powers computations in Bellman's and Knuth's problems
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  51–72
Yu. A. Kochetov, see I. A. Davydov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  21–34
N. A. Kolomeec
A threshold property of quadratic Boolean functions
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  52–58
P. A. Kononova, see I. A. Davydov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  21–34
I. V. Kozin, S. I. Polyuga
Evolutionary-fragmentary model of pentamino packing
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  35–50
D. S. Krotov, see K. V. Vorob'ev
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  3–10
A. A. Kurochkin
Capacitated facility location problem on random input data
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  23–39
S. A. Malyugin
Affine $3$-nonsystematic codes
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  54–61
S. S. Marchenkov
Positive closed classes in the three-valued logic
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  67–83
A. K. Meleshko, see V. A. Voblyi
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  24–32
A. K. Meleshko, see V. A. Voblyi
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  17–22
A. K. Meleshko, see V. A. Voblyi
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  95
A. A. Melnikov, see V. L. Beresnev
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  3–23
A. A. Mel'nikov
Computational complexity of the discrete competitive facility location problem
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  62–79
Yu. V. Merekin
The Shannon function for calculating the Arnold complexity of length $2^n$ binary words for arbitrary $n$
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  59–75
I. M. Minarchenko
Numerical search of equilibrium in Cournot model with $S$-like costs functions
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  40–53
O. V. Muraveva
Stability of compatible systems of linear inequalities and linear separability
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  53–63
A. M. Nazhmidenova, A. L. Perezhogin
A discrete dynamical system on a double circulant
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  80–88
I. V. Otpushchennikov, see A. A. Evdokimov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  25–40
A. A. Panin, A. V. Plyasunov
On complexity of bilevel problems of location and pricing
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  54–66
A. V. Panyukov, R. E. Shangin
An exact algorithm for solving the discrete Weber problem for a $k$-tree
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  64–75
O. G. Parshina
Perfect $2$-colorings of infinite circulant graphs with a continuous set of distances
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  76–83
A. L. Perezhogin, see A. M. Nazhmidenova
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  80–88
A. V. Plyasunov, see A. A. Panin
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  54–66
S. I. Polyuga, see I. V. Kozin
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  35–50
K. A. Popkov
Estimates for lengths of check and diagnostic tests of functional elements
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  73–89
A. V. Pyatkin
On edge muticoloring of unicyclic graphs
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  76–81
A. V. Pyatkin, see A. A. Ageev
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  3–11
S. M. Romanchenko, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  41–52
A. V. Seliverstov
Polytopes and connected subgraphs
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  82–86
A. A. Semenov, see A. A. Evdokimov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  25–40
R. E. Shangin, see A. V. Panyukov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  64–75
N. Yu. Shereshik, see R. Yu. Simanchev
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  89–101
N. V. Shestakova, see V. A. Bulavskii
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  4–10
V. I. Shmyrev
Polyhedral complementarity algorithms for searching an equilibrium in linear models of competitive economy
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  84–101
R. Yu. Simanchev, N. Yu. Shereshik
Integer models for the interrupt-oriented services of jobs by single machine
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  89–101
A. A. Skretneva, see A. N. Glebov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  11–20
I. I. Takhonov
On some problems of covering the plane with circles
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  84–102
G. Sh. Tamasyan, A. A. Chumakov
Finding the distance between the ellipsoids
Diskretn. Anal. Issled. Oper., 2014, Volume 21:3,  87–102
O. Yu. Tsidulko, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  15–29
V. G. Vizing
On multicoloring of incidentors of a weighted oriented multigraph
Diskretn. Anal. Issled. Oper., 2014, Volume 21:4,  33–41
V. A. Voblyi, A. K. Meleshko
The number of labeled block-cactus graphs
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  24–32
V. A. Voblyi, A. K. Meleshko
Enumeration of labeled Eulerian tetracyclic graphs
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  17–22
V. A. Voblyi, A. K. Meleshko
Letter to the Editor
Diskretn. Anal. Issled. Oper., 2014, Volume 21:5,  95
K. V. Vorob'ev, D. S. Krotov
Bounds on the cardinality of a minimal $1$-perfect bitrade in the Hamming graph
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  3–10
M. N. Vyalyi, R. A. Gimadeev
Separation of words by positions of subwords
Diskretn. Anal. Issled. Oper., 2014, Volume 21:1,  3–14
D. Zh. Zambalayeva, see A. N. Glebov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:2,  33–51
D. Zh. Zambalayeva, see A. N. Glebov
Diskretn. Anal. Issled. Oper., 2014, Volume 21:6,  11–20
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021