|
Author Index, 1998, Volume 5
E. N. Kuz'min On an arithmetic property of graphs Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 55–60
|
V. E. Alekseev, V. V. Lozin On local transformations of graphs that preserve the independence number Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 3–19
|
S. V. Avgustinovich On the structure of minimal distance graphs of perfect binary $(n,3)$-codes Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 3–5
|
D. L. Belotserkovskii On a problem of the enumeration of extremal graphs Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 3–27
|
V. L. Beresnev An efficient algorithm for the problem of locating production with a totally balanced matrix Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 20–31
|
V. L. Beresnev, E. N. Goncharov An approximate algorithm for the problem of minimizing polynomials of Boolean variables Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:2, 3–19
|
V. A. Boiarshinov Edge and total coloring of interval graphs Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 18–24
|
O. V. Borodin, D. V. Loparev The height of small faces in planar normal maps Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 6–17
|
A. V. Chashkin On the mean time for computing Boolean operators Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 88–103
|
A. V. Chashkin Self-correcting schemes that realize “narrow” systems of linear Boolean functions Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:3, 80–95
|
A. A. Chernyak On the algorithmic complexity of the classical reliability problem Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 71–80
|
A. A. Dobrynin, I. Gutman The Wiener index for trees and graphs of hexagonal systems Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:2, 34–60
|
V. A. Emelichev, O. A. Yanushkevich On problems of lexicographic optimization Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 30–37
|
F. V. Fomin Search costs and interval graphs Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:3, 70–79
|
A. È. Frid The frequency of the occurrence of words in a DOL sequence Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 82–87
|
E. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov On a problem of the choice of a cyclic route and loading of transport vehicles Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 12–18
|
E. Kh. Gimadi, N. I. Glebov, V. V. Zalyubovskii On problems of efficient barter Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 3–11
|
N. I. Glebov, see E. Kh. Gimadi Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 12–18
|
N. I. Glebov, see E. Kh. Gimadi Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 3–11
|
E. N. Goncharov The branch and bound method for the simplest two-level problem of facility location Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 19–39
|
E. N. Goncharov, see V. L. Beresnev Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:2, 3–19
|
L. Y. Gorbachevskaya Algorithms for and the complexity of the solution of two-level standardization problems with correction of revenue Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:2, 20–33
|
M. I. Grinchuk, V. V. Kochergin On a search for the optimal order of variables in the synthesis of circuits by the cascade method Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 28–39
|
I. Gutman, see A. A. Dobrynin Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:2, 34–60
|
V. P. Il'ev An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a supermodular function Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 45–60
|
V. V. Kochergin, see M. I. Grinchuk Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 28–39
|
A. V. Kononov Problems in scheduling theory on a single machine with job durations proportional to an arbitrary function Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:3, 17–37
|
A. D. Korshunov New books for discrete mathematics Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 97–98
|
A. D. Korshunov New books for discrete mathematics Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 97–99
|
D. V. Loparev, see O. V. Borodin Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 6–17
|
V. V. Lozin, see V. E. Alekseev Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 3–19
|
A. A. Makhnev, D. V. Paduchikh On the structure of connected locally $GQ(3,9)$-graphs Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 61–77
|
S. S. Marchenkov $A$-closed classes of idempotent functions of many-valued logic that are defined by two-place relations Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 32–59
|
Yu. V. Merekin Upper bounds for the complexity of symbol sequences generated by symmetric Boolean functions Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:3, 38–43
|
V. A. Orlov On the complexity of the realization of functions of $k$-valued logic by schemes and formulas in functionally complete bases Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 78–89
|
D. V. Paduchikh, see A. A. Makhnev Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 61–77
|
Yu. N. Pavlovsky Keeping the armed forces structure in the armed struggle process Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 40–55
|
A. L. Perezhogin On cyclic $\langle m,n\rangle$-numerations Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 61–70
|
N. P. Red'kin Minimal self-correcting schemes for a sequence of Boolean functions Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:3, 44–63
|
A. I. Serdyukov, see E. Kh. Gimadi Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 12–18
|
A. I. Serdyukov On the problem of the maximum spanning tree of bounded radius Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:3, 64–69
|
M. P. Sharova Fast coding of Markov sources with low entropy Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 81–96
|
M. I. Sviridenko An approximate algorithm for solving the $p$-center problem with the triangle inequality Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 60–63
|
S. T. Topalova Enumeration of 2-(21,5,2) block designs with automorphisms of odd prime order Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:1, 64–81
|
A. J. van Zanten Distance-preserving cyclic codes on a linear basis Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 38–44
|
A. Yu. Vasil'eva On the distance between perfect binary codes Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 25–29
|
O. A. Yanushkevich, see V. A. Emelichev Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:4, 30–37
|
V. V. Yashchenko On two characteristics of nonlinearity of Boolean mappings Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 90–96
|
V. V. Zalyubovskii, see E. Kh. Gimadi Diskretn. Anal. Issled. Oper., Series 2, 1998, Volume 5:1, 3–11
|
N. Yu. Zolotykh On threshold and nearly threshold functions defined at integer points of a polytope Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:2, 40–54
|
I. É. Zverovich Locally bounded hereditary subclasses of $k$-colorable graphs Diskretn. Anal. Issled. Oper., Series 1, 1998, Volume 5:3, 3–16
|
|
|