Volume 27, No 2, 2020
Content

I. A. Borisova
Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space
P. 5-16

V. M. Deundyak and E. A. Lelyuk
A graph-theoretical method for decoding some group MLD-codes
P. 17-42

I. N. Kulachenko and P. A. Kononova
A hybrid local search algorithm for consistent periodic vehicle routing problem
P. 43-64

Ya. A. Loverov and Yu. L. Orlovich
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
P. 65-89

D. B. Mokeev and D. S. Malyshev
On the König graphs for a 5-path and its spanning supergraphs
P. 90-116

V. M. Fomichev and Ya. E. Avezova
Exact formula for exponents of mixing digraphs for register transformations
P. 117-135