Geodesic

Sommaire du Fascicule no. 1

Independence sets of graphs with bounded minors of the augmented incidence matrix
p. 3-10
Monomial automorphisms of the linear and simple components of the Hamming code
p. 11-33
Generalizations of bent functions
p. 34-64
On graphs with given diameter, number of vertices, and local diversity of balls
p. 65-74
Linear-fractional exchange model. Part~1: Existence and characterization of equilibrium
p. 75-96

Sommaire du Fascicule no. 2

Perfect 2-colorings of Johnson graphs J(8,3) and J(8,4)
p. 3-19
Acyclic 4-colorability of planar graphs without 4- and 5-cycles
p. 20-38
On the issue of algorithmic complexity of one cluster analysis problem
p. 39-45
On a~connection between the switching separability of a~graph and of its subgraphs
p. 46-56
Solutions of a~cooperative differential group pursuit game
p. 57-78
Linear-fractional exchange model. Part~2: Algorithm of meeting trajectories for the fixed budget model
p. 79-96

Sommaire du Fascicule no. 3

On the complexity of linear Boolean operators with thin matrixes
p. 3-18
On probabilistic analysis of one approximation algorithm for the p-median problem
p. 19-31
On quasistability of the lexicographic minimax combinatorial problem with decomposing variables
p. 32-45
Clones with the majority function and their generalizations
p. 46-60
Equilibria in the economy model with overlapping generations of investors
p. 61-83
On construction of vertex-transitive partitions of n-cube into perfect codes
p. 84-100

Sommaire du Fascicule no. 4

A fully polynomial randomized approximation scheme based on an evolutionary algorithm
p. 3-17
The closure operator in many-valued logic based on functional equations
p. 18-31
About straight automorphisms of Hamilton cycles in the Boolean n-cube
p. 32-42
Simulated annealing based algorithm for the rectangular bin packing problem with impurities
p. 43-66
Mitigation of pattern-effects in optical fibre communications by using an adaptive block encoding
p. 67-83
An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a~finite-dimensional normed space
p. 84-91

Sommaire du Fascicule no. 5

A family of two-dimensional words with maximal pattern complexity~2k
p. 3-14
On reconstruction of binary codes by dimensions of their subcodes
p. 15-21
List 2-distance (Δ+1)-coloring of planar graphs with girth at least~7
p. 22-36
NP-completeness of~some problems of a~vectors subset choice
p. 37-45
Cycles of length seven in the pancake graph
p. 46-55
Multiplicative circulant networks
p. 56-66
A rule for the addition of entropies for underdetermined data
p. 67-90

Sommaire du Fascicule no. 6

Approximation algorithms for the competitive facility location problem
p. 3-19
Orbits of linear maps and regular languages properties
p. 20-49
The automorphism group of a~q-ary Hamming code
p. 50-55
On compact vector summation within minimal strip
p. 56-67
A lower bound for the complexity of generalized parallel-serial contact circuits for a~characteristic function of divisibility by~q
p. 68-76
On perfect colorings of line graphs
p. 77-95