Geodesic

Sommaire du Fascicule no. 1

On the number of labeled outerplanar k-cyclic~bridgeless graphs
p. 5-16
Minimization of even conic functions on~the~two-dimensional integral lattice
p. 17-42
Inexact partial linearization methods for~network equilibrium problems
p. 43-60
The set of all values of the domination number in~trees with~a~given degree sequence
p. 61-87
On the annihilators of Boolean polynomials
p. 88-109
Finding the subsets of variables of~a~partial~Boolean~function which~are~sufficient for~its~implementation in~the~classes defined by predicates
p. 110-126
Constructing an instance of the cutting stock problem of~minimum size which does not possess the integer round-up property
p. 127-140

Sommaire du Fascicule no. 2

Computational complexity of the problem of~choosing typical representatives in~a~2-clustering of a~finite set of~points in~a~metric~space
p. 5-16
A graph-theoretical method for~decoding~some~group~MLD-codes
p. 17-42
A hybrid local search algorithm for consistent periodic vehicle routing problem
p. 43-64
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite~graphs
p. 65-89
On the K\"onig graphs for a 5-path and~its~spanning~supergraphs
p. 90-116
Exact formula for exponents of mixing digraphs~for~register~transformations
p. 117-135

Sommaire du Fascicule no. 3

Planning a defense that minimizes a~resource~deficit in~the~worst-case scenario of~supply network destruction
p. 5-27
A polynomial algorithm with~asymptotic ratio~2/3 for~the~asymmetric maximization version of~the~m-PSP
p. 28-52
On a routing Open Shop Problem on two nodes with unit processing times
p. 53-70
Efficient solvability of the weighted vertex coloring problem for some hereditary class of~graphs with 5-vertex prohibitions
p. 71-87
2-Approximation algorithms for~two~graph~clustering~problems
p. 88-108
On the approximation of random variables on~a~finite~chain
p. 109-125

Sommaire du Fascicule no. 4

A~maximum dicut in~a~digraph induced by~a~minimal~dominating~set
p. 5-20
On the Sixth International Olympiad in~Cryptography NSUCRYPTO
p. 21-57
Numerical methods for constructing suboptimal~packings of~nonconvex domains with~curved~boundary
p. 58-79
Variable neighborhood search algorithms for~a~competitive location problem with~elastic~demand
p. 80-103
Complete complexity dichotomy for~7-edge~forbidden subgraphs in~the~edge~coloring~problem
p. 104-130
Estimating nonlinearity characteristics for~iterative transformations of~a~vector space
p. 131-151