Volume 23, 2016
Content
No 1
V. E. Alekseev and D. V. Zakharova
Independent sets in graphs without subtrees with many leaves
P. 516
Ts. Ch.D. Batueva
Discrete dynamical systems with threshold functions of up to three variables
P. 1734
V. L. Beresnev and A. A. Melnikov
A capacitated competitive facility location problem
P. 3550
I. S. Bykov
On locally balanced Gray codes
P. 5164
V. A. Vitkup
On symmetric properties of APNfunctions
P. 6581
G. G. Zabudsky and N. S. Veremchuk
An algorithm for approximate solution to the Weber problem on a line with forbidden gaps
P. 8296
A. B. Zinchenko
Polytopes of special classes of balanced games with transferable utility
P. 97112
No 2
V. A. Voblyi
Enumeration of labeled connected graphs with given order and number of edges
P. 520
A. V. Kel’manov, S. A. Khamidullin, and V. I. Khandeev
A fully polynomialtime approximation scheme for a sequence 2cluster partitioinig problem
P. 2140
Yu. V. Kovalenko
On complexity of optimal recombination for flowshop scheduling problems
P. 4162
A. Yu. Krylatov
Network flow assignment as a fixed point problem
P. 6387
D. P. Pokrasenko
On the maximal component algebraic immunity of vectorial Boolean functions
P.
8899
G. Sh. Tamasyan, E. V. Prosolupov, and T. A. Angelov
Comparative study of two fast algorithms for projecting a point to the standard simplex
P.
100123
No 3
V. P. Il’ev, S. D. Il’eva, and A. A. Navrotskaya
Graph clustering with a constraint on cluster sizes
P. 520
A. V. Kel’manov and A. V. Motkova
Exact pseudopolinomial algorithms for a balanced 2clustering problem
P. 2134
S. M. Lavlinskii, A. A. Panin, and A. V. Plyasunov
Comparison of models of planning publicprivate partnership
P. 3560
A. N. Maksimenko
Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes
P. 6180
S. S. Marchenkov
On maximal subalgebras of the algebras of unary recursive functions
P. 8192
A. K. Oblaukhov
Metric complements to subspaces in the Boolean cube
P. 93106
A. M. Romanov
On fullrank perfect codes over finite fields
P. 107123
No 4
A. V. Kononov and P. A. Kononova
On minimizing dataset transfer time in an acyclic network with four servers
P.
525
A. M. Romanov
On the embedding of constantweight codes into perfect codes
P.
2634
A. A. Taranenko
Permanents of multidimensional matrices: properties and applications
P.
35101
V. V. Shenmaier
Solving some vector subset problems by Voronoi diagrams
P.
102115
