|
Author Index, 2003, Volume 10
V. A. Aksenov, O. V. Borodin, A. N. Glebov
Continuation of a 3-coloring from a 6-face to a plane graph without 3-cycles
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 3–11
|
M. A. Alekhina
On the reliability of schemes in the bases $\{\rightarrow,\bar \}$ and $\{\rightarrow,0\}$ with faults of type 0 at the outputs of the elements
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:1, 3–13
|
S. V. Avgustinovich, A. Yu. Vasil'eva
Computation of a centered function from its values on the middle layers of the Boolean cube
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:2, 3–16
|
O. V. Borodin, see V. A. Aksenov
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 3–11
|
S. E. Bukhtoyarov, V. A. Emelichev
Parametrization of the optimality principle (“from Pareto to Slater”) and the stability of multicriterial trajectory problems
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 3–18
|
E. V. Debrev
On unconditional edge tests for some families of graphs
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:4, 8–30
|
V. T. Dement'ev, Yu. V. Shamardin
A two-level assignment problem with a generalized Monge condition
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 19–28
|
A. A. Dobrynin, L. S. Mel'nikov, A. V. Pyatkin
Critical Erdős and Dirac graphs of even degree
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 12–22
|
V. A. Emelichev, see S. E. Bukhtoyarov
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 3–18
|
E. Kh. Gimadi, N. M. Korkishko
An algorithm for solving the three-index axial assignment problem on one-cycle permutations
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:2, 56–65
|
A. N. Glebov, see V. A. Aksenov
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 3–11
|
D. V. Gruzdev, see V. N. Shevchenko
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 53–64
|
V. P. Il'ev, A. S. Televnin
Two problems on hereditary systems
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 54–66
|
M. Yu. Khachay, see V. D. Mazurov
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 56–66
|
P. Khansen, see Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 11–43
|
Yu. A. Kochetov, N. Mladenovich, P. Khansen
Local search with alternating neighborhoods
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 11–43
|
Yu. A. Kochetov, A. A. Stolyar
The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 29–55
|
N. M. Korkishko, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:2, 56–65
|
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:4, 103–104
|
A. D. Korshunov
The number of $k$-nonseparated families of subsets of an $n$-element set ($k$-nonseparated Boolean functions). I. The case of even $n$ and $k=2$
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:4, 31–69
|
V. D. Mazurov, M. Yu. Khachai
Committee constructions as a generalization of contradictory problems of operations research
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 56–66
|
L. S. Mel'nikov, see A. A. Dobrynin
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 12–22
|
Yu. V. Merekin
On the generation of words using the composition operation
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:4, 70–78
|
N. Mladenović, see Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 11–43
|
V. N. Noskov
On the construction of controllable schemes with a small number of supplementary poles
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:4, 79–102
|
E. A. Okolnishnikova
On the complexity of nondeterministic branching programs that realize characteristic functions of Reed–Muller codes
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 67–81
|
E. A. Orekhova
A criterion for the implicit Sheffer property in three-valued logic
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 82–105
|
N. G. Parvatov
Functional completeness in closed classes of quasimonotone and monotone three-valued functions on a semilattice
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:1, 61–78
|
A. V. Plyasunov
A two-level linear programming problem with a multivariant knapsack at the lower level
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 44–52
|
A. V. Pyatkin
Some upper bounds for the incidentor $(k,l)$-chromatic number
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:2, 66–78
|
A. V. Pyatkin, see A. A. Dobrynin
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 12–22
|
Yu. V. Shamardin, see V. T. Dement'ev
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 19–28
|
I. K. Sharankhaev
On weakly repetitive Boolean functions in a pre-elementary basis
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:2, 79–101
|
V. N. Shevchenko, D. V. Gruzdev
A modification of the Fourier-Motskin algorithm for constructing a triangulation
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 53–64
|
V. I. Shmyrev
Finding equilibrium in a class of production-exchange models
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 65–91
|
S. V. Sorochan
On regular compositions of hereditary classes of colored graphs
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:1, 79–104
|
A. A. Stolyar, see Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:2, 29–55
|
A. S. Televnin, see V. P. Il'ev
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 54–66
|
V. A. Vasil'ev
Extreme points of the Weber polytope
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:2, 17–55
|
A. Yu. Vasil'eva, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:2, 3–16
|
V. G. Vizing
Interval colorings of the incidentors of an undirected multigraph
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:1, 14–40
|
V. G. Vizing
On linear factors of multigraphs
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:4, 3–7
|
L. P. Zhil'tsova
Patterns in trees used in the derivation of words in a stochastic context-free language and a lower bound on coding cost. A critical case
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:3, 23–53
|
N. Yu. Zolotykh
On the complexity of the solution of a class of integer linear programming problems
Diskretn. Anal. Issled. Oper., Series 2, 2003, Volume 10:1, 3–10
|
O. V. Zubkov
On the number of nonrepetitive Boolean functions in the basis $\{&,\vee,\oplus,-\}$
Diskretn. Anal. Issled. Oper., Series 1, 2003, Volume 10:1, 41–60
|
|
|
Terms of Use