Volume 16, 2009
Content
No 1
P. Baptiste, J. Carlier, A. V. Kononov, M. Queyranne, S. V. Sevastjanov, M. I. Sviridenko
Structural properties of optimal schedules with preemption
P. 3–36
D. S. Malyshev
On infinity of the set of boundary classes for the 3-edge-colorability problem
P. 37–43
S. A. Malyugin
On nonsystematic perfect codes over finite fields
P. 44–63
E. O. Rapoport
About optimal control of allotment of impartible resource
P. 64–79
D. B. Khoroshilova
On two-colour perfect colourings of circular graphs
P. 80–92
No 2
Ts. C.-D. Batueva
Arithmetical closure of two dimensional toeplitz words
P. 3–15
O. V. Borodin, A. O. Ivanova
Near-proper vertex 2-colorings of sparse graphs
P. 16–20
I. L.Vasiliev, K. B. Klimentova
A branch and bound method for the facility location problem with customer preferences
P. 21–41
S. A. Volkov
The class of skolem elementary functions
P. 42–60
A. B. Dainiak
On the number of independent sets in trees of fixed diameter
P. 61–73
V. A. Emelichev, O. V. Karelkina
On quasistability of a lexicographic MINSUM arrangement problem
P. 74–84
D. S. Malyshev
Boundary classes of graphs for some recognition problems
P. 85–94
No 3
S. N. Astrakov, A. I. Erzin, V. V. Zalyubovskiy
Sensor networks and covering of plane by discs
P. 3–19
D. Zh. Zambalayeva
Partition of a planar graph with girth 7 into two star forests
P. 20–46
V. M. Kartak
The grouping method for the linear relaxation of 1d cutting stock problem
P. 47–62
F. I. Solov’eva, À. V. Los’
On partitions into perfect $q$-ary codes
P. 63–73
D. A. Chemisova
On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
P. 74–98
No 4
A. A. Ageev, A. V. Pyatkin
A 2-approximation algorithm for the metric 2-peripatetic salesman problem
P. 3–20
V. G. Vizing
Vertex colorings of graph with the majority restrictions on the consuming colors
P. 21–30
A. V. Kel'manov, L. V. Mikhaylova, S. A. Khamidullin
On one problem of searching for tuples of fragments in a numerical sequence
P. 31–46
E. A. Monakhova
Optimal generalized Petersen graphs
P. 47–60
A. S. Rudnev
Probabilistic tabu search algorithm for the packing circles and rectangles into the strip
P. 61–86
P. V. Skums, R. I. Tyshkevich
Reconstruction conjecture for graphs with restrictions for 4-vertex paths
P. 87–96
No 5
A. A. Ageev, E. Kh. Gimadi, À. À. Kurochkin
The facility location problem with uniform capacities on path graphs is considered
P. 3–18
V. E. Alekseev, S. V. Sorochan
On the entropy minimal hereditary classes of coloured graphs
P. 19–25
O. V. Borodin
Acyclic 3-choosability of plane graphs without cycles of length from 4 to 12
P. 26–33
V. G. Vizing
On one twocriterial graph problem
P. 34–40
D. S. Malyshev
Continued sets of boundary classes of graphs for colorability problems
P. 41–51
I. Yu. Mogilnykh
On nonexistence of some perfect 2-colorings of Johnson graphs
P. 52–68
E. A. Okol'nishnikova
Lower bound for the computation complexity of BCH-codes for branching programs
P. 69–77
K. L. Rychkov
On the complexity of generalized contact circuits
P. 78–87
No 6
O. V. Borodin
Acyclic 4-coloring of plane graphs without cycles of length 4 and 6
P. 3–11
A. V. Vasin
Synthesis of asymptotically optimal reliable circuits in basis
P. 12–22
N. S. Dyomin, A. V. Erlykova, E. A. Panshina
Research of one type of exotics options with flight and onflowof capital in binomial model of financial (B, S)-market
P. 23–42
D. S. Malyshev
On minimal hard classes of graphs
P. 43–51
S. S. Marchenkov
On closed classes of a $k$-valued logics functions defined by a single endomorphism
P. 52–67
A. V. Pyatkin
On the complexity of the maximum sum length vectors subset choice problem
P. 68–73
T. I. Fedoryaeva
Exact upper estimates of the number of different balls of given radius for the graphs with fixed number of vertexes and diameter
P. 74–92
