# Volume 18, No 1, 2011
Content
A. A. Balaghura, O. V. Kuzmin
The enumerative properties of combinatorial partition polynomials
P. 3–14
A. A. Valyuzhenich
Some properties of well-based sequences
P. 15–19
V. T. Dementiev, Yu. V. Shamardin
On a polinomial solving case of decentralized transportation problem
P. 20–26
A. V. Eremeev
On perfect colorings of line graphs
P. 27–40
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya
Approximation algorithms for graph approximation problems
P. 41–60
A. V. Kel'manov, S. M. Romanchenko
The approximation algorithm for one problem of searching for subset of vectors
P. 61–69
D. S. Malyshev
Minimal hard classes of graphs for the edge list-ranking problem
P. 70–76
E. A. Monakhova
On an extremal family of circulant networks
P. 77–84
R. Yu. Simanchev, I. V. Urazova
Scheduling unit-time jobs on parallel processors polytope
P. 85–97 |