Geodesic

Sommaire du Fascicule no. 1

Structural properties of optimal schedules with preemption
p. 3-36
On infinity of the set of boundary classes for the 3-edge-colorability problem
p. 37-43
On nonsystematic perfect codes over finite fields
p. 44-63
About optimal control of allotment of impartible resource
p. 64-79
On two-colour perfect colourings of circular graphs
p. 80-92

Sommaire du Fascicule no. 2

Arithmetical closure of two dimensional Toeplitz words
p. 3-15
Near-proper vertex 2-colorings of sparse graphs
p. 16-20
A branch and bound method for the facility location problem with customer preferences
p. 21-41
The class of Skolem elementary functions
p. 42-60
On the number of independent sets in trees of fixed diameter
p. 61-73
On quasistability of a~lexicographic MINSUM arrangement problem
p. 74-84
Boundary classes of graphs for some recognition problems
p. 85-94

Sommaire du Fascicule no. 3

Sensor networks and covering of plane by discs
p. 3-19
Partition of a~planar graph with girth~7 into two star forests
p. 20-46
The grouping method for the linear relaxation of 1d cutting stock problem
p. 47-62
On partitions into perfect q-ary codes
p. 63-73
On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
p. 74-98

Sommaire du Fascicule no. 4

A 2-approximation algorithm for the metric 2-peripatetic salesman problem
p. 3-20
Vertex colorings of graph with the majority restrictions on the consuming colors
p. 21-30
On one problem of searching for tuples of fragments in a~numerical sequence
p. 31-46
Optimal generalized Petersen graphs
p. 47-60
Probabilistic tabu search algorithm for the packing circles and rectangles into the strip
p. 61-86
Reconstruction conjecture for graphs with restrictions for 4-vertex paths
p. 87-96

Sommaire du Fascicule no. 5

Polynomial algorithm for the path facility location problem with uniform capacities
p. 3-18
On the entropy minimal hereditary classes of coloured graphs
p. 19-25
Acyclic 3-choosability of plane graphs without cycles of length from~4 to~12
p. 26-33
On one twocriterial graph problem
p. 34-40
Continued sets of boundary classes of graphs for colorability problems
p. 41-51
On nonexistence of some perfect 2-colorings of Johnson graphs
p. 52-68
Lower bound for the computation complexity of BCH-codes for branching programs
p. 69-77
On the complexity of generalized contact circuits
p. 78-87

Sommaire du Fascicule no. 6

Acyclic 4-coloring of plane graphs without cycles of length~4 and~6
p. 3-11
Synthesis of asymptotically optimal reliable circuits in basis {¬}
p. 12-22
Research of one type of exotics options with flight and onflow of capital in binomial model of financial (B,S)-market
p. 23-42
On minimal hard classes of graphs
p. 43-51
On closed classes of a~k-valued logics functions defined by a~single endomorphism
p. 52-67
On the complexity of the maximum sum length vectors subset choice problem
p. 68-73
Exact upper estimates of the number of different balls of given radius for the graphs with fixed number of vertexes and diameter
p. 74-92