Volume 24, 2017
Content
No 1
E. A. Bobrova and V. V. Servakh
Construction of cyclic schedules in presence of parallel machines
P. 520
E. I. Vasilyeva and A. V. Pyatkin
On list incidentor $(k, l)$colorings
P.
2130
E. M. Zamaraeva
On teaching sets for 2threshold functions of two variables
P. 3155
P. A. Irzhavskii, Yu. A. Kartynnik, and Yu. L. Orlovich
1Triangle graphs and perfect neighborhood sets
P. 5680
D. S. Malyshev
Critical elements in combinatorially closed families of graph classes
P. 8196
V. M. Fomichev and S. N. Kyazhin
Local primitivity of matrices and graphs
P. 97119
No 2
I. S. Bykov and A. L. Perezhogin
On distance Gray codes
P.
517
V. A. Voblyi and A. K. Meleshko
Enumeration of labeled outerplanar bicyclic and tricyclic graphs
P.
1831
A. M. Koreneva and V. M. Fomichev
The mixing properties of modified additive generators
P.
3252
S. A. Malyugin
Perfect binary codes of infinite length
P.
5367
T. I. Fedoryaeva
Asymptotic approximation for the number of nvertex graphs of given diameter
P.
6886
I. P. Chukhrov
Proof of covering minimality by generalizing the notion of independence
P.
87106
No 3
E. Kh. Gimadi and O. Yu. Tsidulko
An asymptotically optimal algorithm for the $m$Peripatetic Salesman Problem on random inputs
with discrete distribution
P.
519
M. A. Lisitsyna and O. G. Parshina
Perfect colorings of the infinite circulant graph with distances 1 and 2
P.
2034
D. S. Malyshev and D. V. Sirotkin
Polynomialtime solvability of the independent set problem in a certain class of subcubic planar graphs
P.
3560
D. B. Mokeev
On König graphs with respect to $P_4$
P.
6179
K. A. Popkov
On the exact value of the length of the minimal single diagnostic test for a particular class of circuits
P.
80103
V. M. Fomichev
Computational complexity of the original and extended Diophantine Frobenius problem
P. 104124
No 4
V. L. Beresnev and A. A. Melnikov
An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
P.
521
Yu. E. Bessonov and A. A. Dobrynin
Lattice complete graphs
P.
2233
M. O. Golovachev and A. V. Pyatkin
On ($1, l$)coloring of incidentors of multigraphs
P.
3446
A. V. Eremeev
On computational complexity of the electric power flow optimization problem in market environment
P.
4759
S. S. Marchenkov
On the operations of bounded suffix summation and multiplication
P.
6076
O. V. Pinyagina
The network equilibrium problem with mixed demand
P.
7794
R. Yu. Simanchev
On facetinducing inequalities for combinatorial polytopes
P.
95110
V. V. Shenmaier
An exact algorithm for finding a vector subset with the longest sum
P.
111129
