Geodesic

Sommaire du Fascicule no. 1

From Editorial Board
p. 3-4
Locally isometric embeddings of graphs and metric continuation property
p. 5-12
Scheme realization of the sorting problem
p. 13-19
Efficient construction of schedules in open-type systems
p. 20-42
Local complementations of simple and oriented graphs
p. 43-62
On the depth of conditional tests for the control of failures of ``negation'' type in schemes consisting of functional elements
p. 63-74
Sixth school-seminar ``Synthesis and Complexity of Controlled Systems''
p. 75-84

Sommaire du Fascicule no. 2

The number of different subwords of given length in the Morse--Hedlund sequence
p. 3-7
An algorithm for the approximate solution of the traveling salesman problem and its probabilistic analysis
p. 8-17
Regular partitions and truncations in integer programming
p. 18-39
On the complexity of coverings of numerical sets by arithmetic progressions
p. 40-60
On the external stability number of generalized de Bruijn graphs
p. 61-66
Nonstrict summation of vectors in problems of scheduling theory
p. 67-99
New books for discrete mathematics
p. 100-102

Sommaire du Fascicule no. 3

A~refinement of the Frank--Seb\"o--Tardos theorem and its applications
p. 3-19
On the length of the path of a~Chinese postman in homogeneous graphs
p. 20-37
An algorithm that is polynomial in the mean in integer linear programming
p. 38-48
Canonical partitions of graphs and their application to the coding of graphs
p. 49-59
Fault detection of parts of the circuits of functional elements
p. 60-96

Sommaire du Fascicule no. 4

Sergei Vsevolodovich Yablonskii (on his 70th birthday)
p. 3-6
On the smallest independent dominating sets in graphs
p. 7-21
Projections of a~hypercube onto a~straight line and a~plane
p. 22-32
Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions
p. 33-52
On the accuracy of some algorithms for the loading of a~knapsack
p. 53-63
Synthesis of transitive order relations that are consistent with information on the strength of criteria
p. 64-92
New books for discrete mathematics
p. 93-95