Geodesic

Sommaire du Fascicule no. 1

Construction of cyclic schedules in presence of parallel machines
p. 5-20
On list incidentor (k,l)-colorings
p. 21-30
On teaching sets for 2-threshold functions of two variables
p. 31-55
1-Triangle graphs and perfect neighborhood sets
p. 56-80
Critical elements in combinatorially closed families of graph classes
p. 81-96
Local primitivity of matrices and graphs
p. 97-119

Sommaire du Fascicule no. 2

On distance Gray codes
p. 5-17
Enumeration of labeled outerplanar bicyclic and tricyclic graphs
p. 18-31
The mixing properties of modified additive generators
p. 32-52
Perfect binary codes of infinite length
p. 53-67
Asymptotic approximation for the number of graphs
p. 68-86
Proof of covering minimality by generalizing the notion of independence
p. 87-106

Sommaire du Fascicule no. 3

An asymptotically optimal algorithm for the m-peripatetic salesman problem on random inputs with discrete distribution
p. 5-19
Perfect colorings of the infinite circulant graph with distances~1 and~2
p. 20-34
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
p. 35-60
On K\"onig graphs with respect to~P4
p. 61-79
On the exact value of the length of the minimal single diagnostic test for a particular class of circuits
p. 80-103
Computational complexity of the original and extended Diophantine Frobenius problem
p. 104-124

Sommaire du Fascicule no. 4

An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
p. 5-21
Lattice complete graphs
p. 22-33
On (1,l)-coloring of incidentors of multigraphs
p. 34-46
On computational complexity of the electric power flow optimization problem in market environment
p. 47-59
On the operations of bounded suffix summation and multiplication
p. 60-76
The network equilibrium problem with mixed demand
p. 77-94
On facet-inducing inequalities for combinatorial polytopes
p. 95-110
An exact algorithm for finding a~vector subset with the longest sum
p. 111-129