Geodesic

Sommaire du Fascicule no. 1

Independent sets in graphs without subtrees with many leaves
p. 5-16
Discrete dynamical systems with threshold functions of up to three variables
p. 17-34
A capacitated competitive facility location problem
p. 35-50
On locally balanced Gray codes
p. 51-64
On symmetric properties of APN functions
p. 65-81
An algorithm for approximate solution to the Weber problem on a~line with forbidden gaps
p. 82-96
Polytopes of special classes of balanced games with transferable utility
p. 97-112

Sommaire du Fascicule no. 2

Enumeration of labeled connected graphs with given order and number of edges
p. 5-20
Fully polynomial-time approximation scheme for a~sequence 2-clustering problem
p. 21-40
On complexity of optimal recombination for flowshop scheduling problems
p. 41-62
Network flow assignment as a~fixed point problem
p. 63-87
On the maximal component algebraic immunity of vectorial Boolean functions
p. 88-99
Comparative study of two fast algorithms for projecting a~point to the standard simplex
p. 100-123
On the jubilee of A. D. Korshunov

Sommaire du Fascicule no. 3

Graph clustering with a~constraint on cluster sizes
p. 5-20
Exact pseudopolinomial algorithms for a~balanced 2-clustering problem
p. 21-34
Comparison of models of planning public-private partnership
p. 35-60
Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes
p. 61-80
On maximal subalgebras of the algebras of unary recursive functions
p. 81-92
Metric complements to subspaces in the Boolean cube
p. 93-106
On full-rank perfect codes over finite fields
p. 107-123

Sommaire du Fascicule no. 4

On minimizing dataset transfer time in an acyclic network with four servers
p. 5-25
On the embedding of constant-weight codes into perfect codes
p. 26-34
Permanents of multidimensional matrices: properties and applications
p. 35-101
Solving some vector subset problems by Voronoi diagrams
p. 102-115