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, 2001, Volume 8

A B C D E F G H K L M N O P S T V Y Z Full List
M. A. Alekhina
On the reliability of schemes in the bases $\{x\mid y\}$, $\{x\downarrow y\}$ with single-type constant faults at the inputs of the elements
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  3–14
S. V. Avgustinovich, O. V. Borodin, A. È. Frid
Distributive colorings of plane triangulations of minimum degree five
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  3–16
S. V. Avgustinovich, F. I. Solov'eva, O. Heden
Perfect codes of complete rank with kernels of large dimensions
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  3–8
O. V. Borodin, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  3–16
O. V. Borodin, H. Broersma, A. N. Glebov, J. van den Heuvel
The structure of plane triangulations in terms of clusters and stars
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  15–39
O. V. Borodin, A. N. Glebov
On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  34–53
O. V. Borodin, H. Broersma, A. N. Glebov, J. van den Heuvel
Minimal degrees and chromatic numbers of squares of planar graphs
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  9–33
H. Broersma, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  15–39
H. Broersma, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  9–33
I. Charon, O. Hudry
The branch and bound method for solving the problem of linear ordering on weighted tournaments
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  73–91
A. V. Chashkin
On the randomized complexity of functions that approximate a voting function
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  77–93
I. D. Chernykh, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  23–39
D. Yu. Cherukhin
On the complexity of realization of powers of Boolean functions by formulas
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  103–111
V. T. Dement'ev, Yu. V. Shamardin
A three-level model for the choice of nomenclature of products
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  40–46
I. I. Dikin
A continuous process for the linear complementarity problem
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  27–30
V. A. Emelichev, D. P. Podkopaev
Stability and regularization of vector problems of integer linear programming
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  47–69
T. I. Fedoryaeva
Outerplanar graphs with the metric continuity property. II
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  88–112
A. Yu. Filatov, see O. N. Voitov
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  17–26
M. Yu. Filatov, see I. P. Voznyuk
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  3–16
S. A. Fomin
A new approximate algorithm for solving a positive linear programming problem
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  52–72
A. È. Frid, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  3–16
E. Kh. Gimadi, A. I. Serdyukov
On some results for the maximum traveling salesman problem
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  22–39
E. Kh. Gimadi, see I. P. Voznyuk
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  3–16
A. N. Glebov, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  15–39
A. N. Glebov, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  34–53
A. N. Glebov, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  9–33
N. I. Glebov
On the description of a class of problems solvable by a coordinate-wise ascent algorithm
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:3,  15–25
O. Heden, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  3–8
O. Hudry, see I. Charon
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  73–91
K. N. Kashirskich, A. V. Kononov, S. V. Sevast'yanov, I. D. Chernykh
A polynomially solvable case of a two-stage open shop problem with three machines
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  23–39
A. V. Kononov, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  23–39
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  92–93
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  114–116
A. D. Korshunov
For what $k$ in almost every $n$-vertex graph do there exist all nonisomorphic $k$-vertex subgraphs?
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  54–67
R. M. Larin, A. V. Pyatkin
A two-level assignment problem
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  42–51
L. M. Lebedeva, see V. I. Zorkal'tsev
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  31–41
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko
Some characteristics of “nonlinearity” of group mappings
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  40–54
S. A. Malyugin
Nonsystematic perfect binary codes
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  55–76
S. S. Marchenkov
Positive BE-representations of dictionary predicates
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  68–75
V. N. Noskov
On conditional tests for the control of automata networks
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:3,  46–72
E. A. Okolnishnikova
On a method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  76–102
A. V. Panyukov
The problem of locating rectangular plants with minimal cost for the connecting network
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  70–87
A. L. Perezhogin, V. N. Potapov
On the number of Hamiltonian cycles in a Boolean cube
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  52–62
D. P. Podkopaev, see V. A. Emelichev
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  47–69
V. N. Potapov, see A. L. Perezhogin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  52–62
A. V. Pyatkin, see R. M. Larin
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  42–51
A. A. Sal'nikov, see O. A. Logachev
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  40–54
A. I. Serdyukov, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  22–39
S. V. Sevast'yanov, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  23–39
Yu. V. Shamardin, see V. T. Dement'ev
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  40–46
L. A. Sholomov
Separating decomposition of relations in multicriterial choice problems
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  63–89
A. V. Sidorov, see V. A. Vasil'ev
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  3–21
F. I. Solov'eva, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  3–8
V. A. Tashkinov
On the isometric embedding of arbitrary graphs into a graph of a given diameter possessing the metric continuation property
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:3,  73–80
B. Toft, see V. G. Vizing
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:3,  3–14
J. van den Heuvel, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  15–39
J. van den Heuvel, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:4,  9–33
V. A. Vasil'ev, A. V. Sidorov
Equilibrium in a regulated market. I. Existence
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:1,  3–21
S. I. Veselov
A proof of a generalization of the Borosh–Treybig conjecture on Diophantine equations
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  17–22
V. G. Vizing
Interval coloring of the incidentors of a directed multigraph
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:2,  40–51
V. G. Vizing, B. Toft
The coloring of the incidentors and vertices of an undirected multigraph
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:3,  3–14
O. N. Voitov, V. I. Zorkal'tsev, A. Yu. Filatov
Oblique path algorithms for solving linear programming problems
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  17–26
I. P. Voznyuk, E. Kh. Gimadi, M. Yu. Filatov
An asymptotically exact algorithm for solving the location problem with constrained production volumes
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  3–16
V. V. Yashchenko, see O. A. Logachev
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:1,  40–54
L. P. Zhil'tsova
A lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages
Diskretn. Anal. Issled. Oper., Series 1, 2001, Volume 8:3,  26–45
V. I. Zorkal'tsev, see O. N. Voitov
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  17–26
V. I. Zorkal'tsev, L. M. Lebedeva
The use of the interior point method for the realization of a model for the estimation of the power deficit of electrical power systems
Diskretn. Anal. Issled. Oper., Series 2, 2001, Volume 8:2,  31–41
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019