The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence -- Locally Isometric Embeddings of Graphs and the Metric Prolongation Property -- Local Complementations of Simple and Directed Graphs -- An Approximation Algorithm for the Traveling Salesman Problem and Its Probabilistic Analysis -- On Minimum Independent Dominating Sets in Graphs -- Regular Partitions and Cuts in Integer Programming -- Complexity of Coverings of Number Sets by Arithmetical Progressions -- Circuit Realization of the Sorting Problem -- A Refinement of the Frank-Seb?-Tardos Theorem and Its Applications -- On the Length of the Chinese Postman Tour in Regular Graphs -- An Integer Linear Programming Algorithm Polynomial in the Average Case -- Projections of the Hypercube on the Line and the Plane -- Canonical Decomposition of Graphs -- Fault Detection in Parts of the Circuits of Functional Elements -- On the External Stability Number of the Generalized De Bruijn Graphs -- On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions -- Efficient Scheduling in Open Shops -- Nonstrict Vector Summation in Scheduling Problems -- Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem -- On the Depth of Conditional Tests for Controlling "Negation" Type Faults in Circuits of Functional Gates -- Synthesis of Transitive Order Relations Compatible with the Power of Criteria.