Volume 25, 2018
Content

No 1

V. A. Bondarenko and A. V. Nikolaev
On the skeleton of the polytope of pyramidal tours
P. 5-24

A. A. Evdokimov and T. I. Fedoryaeva
Tree-like structure graphs with full diversity of balls
P. 25-41

V. V. Kochergin and A. V. Mikhailovich
On the complexity of multivalued logic functions over some infinite basis
P. 42-74

A. Yu. Krylatov
Reduction of a minimization problem of a separable convex function under linear constraints to a fixed point problem
P. 75-97

A. V. Kutsenko
The Hamming distance spectrum between self-dual Maiorana–McFarland bent functions
P. 98-119

I. S. Sergeev
Rectifier circuits of bounded depth
P. 120-141

No 2

V. E. Alekseev and S. V. Sorochan
New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths
P. 5-18

S. V. Kitaev and A. V. Pyatkin
Word-representable graphs: A survey
P. 19-53

V. K. Leontiev
On a partial order related to divisibility
P. 54-61

K. A. Popkov
Complete fault detection tests of length 2 for logic networks under stuck-at faults of gates
P. 62-81

E. V. Prosolupov and G. Sh. Tamasyan
Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
P. 82-100

D. S. Taletskii and D. S. Malyshev
On trees of bounded degree with maximal number of greatest independent sets
P. 101-123

V. M. Fomichev
Semigroup and metric characteristics of locally primitive matrices and graphs
P. 124-143

No 3

V. L. Beresnev, I. A. Davydov, P. A. Kononova, and A. A. Melnikov
Bilevel “defender–attacker” model with multiple attack scenarios
P. 5-22

S. I. Veselov, D. V. Gribanov, N. Yu. Zolotykh, and A. Yu. Chirkov
Minimizing a symmetric quasiconvex function on a two-dimensional lattice
P. 23-35

K. L. Rychkov
Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes
P. 36-94

V. M. Fomichev, Ya. E. Avezova, A. M. Koreneva, and S. N. Kyazhin
Primitivity and local primitivity of digraphs and nonnegative matrices
P. 95-125

I. P. Chukhrov
On the complexity of minimizing quasicyclic Boolean functions
P. 126-151

No 4

A. A. Dobrynin
On 2-connected transmission irregular graphs
P. 5-14

Yu. A. Zuev
Maximal $k$-intersecting families of subsets and Boolean functions
P. 15-26

S. V. Ivanov
A bilevel stochastic programming problem with random parameters in follower’s objective function
P. 27-45

S. S. Marchenkov
Extensions of the positive closure operator by using logical connectives
P. 46-58

A. V. Miloserdov
Permutation binomial functions over finite fields
P. 59-80

A. S. Parfinenko and A. L. Perezhogin
The functional graph of a linear discrete dynamical system with two dominating vertices
P. 81-96

A. A. Sapozhenko and V. G. Sargsyan
The number of $k$-sumsets in an Abelian group
P. 97-111

D. V. Sirotkin and D. S. Malyshev
On the complexity of the vertex 3-coloring problem for the hereditary graph classes with forbidden
subgraphs of small size
P. 112-130

V. V. Shenmaier
Approximability of the problem of finding a vector subset with the longest sum
P. 131-148