CONTENTS
THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
Barotov D. N., Barotov R. N. On the order of smoothness of the smallest concave extension of a Boolean function ... 5
Panpurin A. A. Curvature of some classes of Boolean functions ... 16
Fomin D. B., Trifonov D. I. Computational work for some TU-based permutations ... 29
Komathi M., Ragukumar P. Role coloring of graphs from rooted products ... 94
Zabudsky G. G. Approximate solution of the maximin problem of locating facilities on a network with constraints on minimum distances ... 114
THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
Barotov D. N., Barotov R. N. On the order of smoothness of the smallest concave extension of a Boolean function ... 5
Panpurin A. A. Curvature of some classes of Boolean functions ... 16
Fomin D. B., Trifonov D. I. Computational work for some TU-based permutations ... 29
APPLIED CODING THEORY
Chizhov I. V. A non-asymptotic estimate of the probability that a Shur — Hadamard square of long random linear code has a maximum dimension ... 56APPLIED GRAPH THEORY
Prolubnikov A. V. Graph traversals implemented by iterative methods for solving systems of linear equations ... 71Komathi M., Ragukumar P. Role coloring of graphs from rooted products ... 94
COMPUTATIONAL METHODS IN DISCRETE MATHEMATICS
Volkov M. S. A., Gordeev E. N., Leontiev V. K. On the average number of solutions in the knapsack problem ... 103Zabudsky G. G. Approximate solution of the maximin problem of locating facilities on a network with constraints on minimum distances ... 114
BRIEF INFORMATION ABOUT THE AUTHORS ... 123