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, 2000, Volume 7

A B C D E F G K L M N O P R S T V Z Full List
V. A. Aksenov, O. V. Borodin, A. N. Glebov
On a structural property of plane graphs
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  5–19
V. E. Alekseev, S. V. Sorochan
On the entropy of hereditary classes of oriented graphs
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  20–28
S. V. Avgustinovich
On the strong isometry of binary codes
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:3,  3–5
O. V. Borodin, see V. A. Aksenov
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  5–19
A. V. Chashkin
$(s,d,\varepsilon)$-decomposition of Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  94–101
I. D. Chernykh, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  59–77
D. Yu. Cherukhin
Superquadratic lower bounds for the complexity of formulas in some bases
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  86–95
D. Yu. Cherukhin
Lower bounds for the formula complexity of symmetric Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:3,  86–98
M. V. Devyaterikova, see A. A. Kolokolov
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  47–53
A. A. Dobrynin, see L. S. Mel'nikov
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  60–73
V. A. Emelichev, A. V. Pashkevich
On a linear convolution of criteria in vector discrete optimization
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  12–21
A. V. Eremeev
A genetic algorithm for the covering problem
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  47–60
A. V. Eremeev, L. A. Zaozerskaya, A. A. Kolokolov
The set covering problem: complexity, algorithms, and experimental investigations
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  22–46
A. A. Evdokimov
Coding of structured information and embeddings of discrete spaces
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  48–58
T. I. Fedoryaeva
Outerplanar graphs with the metric continuation property. I
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  83–112
D. G. Fon-Der-Flaass, see V. V. Nyu
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  65–70
E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov
Polynomial solvability of scheduling problems with storable resources and directive deadlines
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  9–34
E. Kh. Gimadi, A. I. Serdyukov
An algorithm for finding the minimum spanning tree with a diameter bounded from below
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  3–11
A. N. Glebov, see V. A. Aksenov
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  5–19
N. I. Glebov, V. V. Shenmaier
On the applicability of a coordinate-wise ascent algorithm to integer programming problems
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  38–47
L. Y. Gorbachevskaya
Two-level standardization problems under conditions when the optimal consumer choice is not unique
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  35–46
L. Y. Gorbachevskaya
A two-level problem of the choice of reusable products with the uniqueness condition for consumer choice
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  5–11
V. V. Kabanov
An algorithm for minimal dynamic flow
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  12–20
K. N. Kashirskich, S. V. Sevast'yanov, I. D. Chernykh
A four-parameter analysis of the complexity of the open shop problem
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  59–77
O. V. Khamisov, see M. S. Nechayeva
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  74–88
V. M. Khrapchenko
The works of R. G. Nigmatullin on lower bounds for complexity
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  18–31
A. A. Kolokolov, see A. V. Eremeev
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  22–46
A. A. Kolokolov, M. V. Devyaterikova
Analysis of the stability of an $L$-partition of sets in a finite-dimensional space
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  47–53
A. V. Kononov, S. V. Sevast'yanov
On the complexity of determining a connected prescribed coloring of the vertices of a graph
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  21–46
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  99–100
A. D. Korshunov, I. Shmulevich
The number of special monotone Boolean functions and statistical properties of stack filters
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:3,  17–44
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  129–131
Yu. L. Kostyuk, S. A. Zhikharev
An efficient algorithm for the approximate solution of the metric traveling salesman problem
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  65–74
D. S. Krotov
On a perfect code that contains a given set of perfect codes as subcodes
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  40–48
D. S. Krotov
Lower bounds for the number of $m$-quasigroups of order four and of the number of perfect binary codes
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  47–53
D. S. Krotov
$Z_4$-linear perfect codes
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  78–90
R. M. Larin, A. V. Pyatkin
A two-level bimatrix game with payoff regulation
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  54–59
V. V. Lozin
$E$-free bipartite graphs
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  49–66
S. A. Malyugin
On the order of the automorphism group of perfect binary codes
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  91–100
L. S. Mel'nikov, A. A. Dobrynin
Construction of triply connected graphs with the same path layer matrices
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  60–73
L. S. Mel'nikov, see V. G. Vizing
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  29–37
Yu. V. Merekin
Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  54–64
M. Yu. Moshkov
On the works of R. G. Nigmatullin on approximate algorithms for solving discrete extremal problems
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  6–17
R. G. Mubarakzyanov
On complexity classes defined by binary programs of bounded width
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  67–78
M. S. Nechayeva, O. V. Khamisov
The branch-and-bound method for the problem of minimizing a nonconvex quadratic function under convex quadratic constraints
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  74–88
V. N. Noskov
On diagnostic and adjustment problems for circuits composed of unreliable automata
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:3,  45–71
V. V. Nyu, D. G. Fon-Der-Flaass
Estimates for the length of a universal sequence for permutations
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  65–70
E. A. Okolnishnikova
On two operations over Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  79–93
A. V. Pashkevich, see V. A. Emelichev
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  12–21
I. G. Perfil'eva, see A. S. Tonis
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  75–85
A. V. Plyasunov
A polynomially solvable class of two-level nonlinear programming problems
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  89–113
A. V. Pyatkin, see R. M. Larin
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  54–59
A. V. Pyatkin, see V. G. Vizing
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  29–37
A. M. Romanov
Perfect binary codes with a trivial kernel
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  71–74
A. I. Serdyukov, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  3–11
V. V. Servakh
An efficiently solvable case of the scheduling problem with renewable resources
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  75–82
S. V. Sevast'yanov, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  9–34
S. V. Sevast'yanov, see A. V. Kononov
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  21–46
S. V. Sevast'yanov, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  59–77
Yu. V. Shamardin
On a two-level location problem with constraints on the volume of production
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  114–118
V. V. Shenmaier
Generalization of the concept of the rank function of a matroid
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  111–125
V. V. Shenmaier, see N. I. Glebov
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  38–47
I. Shmulevich, see A. D. Korshunov
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:3,  17–44
F. I. Solov'eva, S. T. Topalova
Perfect binary codes and Steiner triple systems with maximum orders of automorphism groups
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  101–110
S. V. Sorochan, see V. E. Alekseev
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  20–28
V. A. Tashkinov
On an algorithm for the edge coloring of multigraphs
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:3,  72–85
A. S. Tonis, I. G. Perfil'eva
A functional system of infinite-valued propositional calculus
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:2,  75–85
S. T. Topalova, see F. I. Solov'eva
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  101–110
V. G. Vizing
The coloring of the incidentors of a multigraph into prescribed colors
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:1,  32–39
V. G. Vizing
The coloring of the incidentors and vertices of a directed multigraph
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:3,  6–16
V. G. Vizing, L. S. Mel'nikov, A. V. Pyatkin
On the $(k,l)$-coloring of incidentors
Diskretn. Anal. Issled. Oper., Series 1, 2000, Volume 7:4,  29–37
I. P. Voznyuk
The plant location problem on a two-tree with bounded communication capacities
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  3–8
G. G. Zabudskii
On the problem of the linear ordering of vertices of parallel-sequential graphs
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  61–64
V. V. Zalyubovskii, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  9–34
L. A. Zaozerskaya, see A. V. Eremeev
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:2,  22–46
S. A. Zhikharev, see Yu. L. Kostyuk
Diskretn. Anal. Issled. Oper., Series 2, 2000, Volume 7:1,  65–74
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020