Geodesic

Sommaire du Fascicule no. 1

Convex continuation of a Boolean function and its applications
p. 5-18
Definability of relations by semigroups of isotone transformations
p. 19-34
A probabilistic approach to the game of guessing in a random environment
p. 35-51
Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
p. 52-84
A method for automatic search for families of optimal chordal ring networks
p. 85-108
On the number of $k$-dominating independent sets in planar graphs
p. 109-128

Sommaire du Fascicule no. 2

Ant colony algorithm for single processor scheduling with minimization of peak resource usage
p. 5-27
Stability of vertex covers in a game with finitely many steps
p. 28-45
Cooperative games with preferences: Application of the weight rule to problems of public space in St. Petersburg
p. 46-62
Enumeration of even and odd chord diagrams
p. 63-79
Comparative analysis of algorithms for estimating fish population dynamics
p. 80-95
A method for optimal value measurement of some parameters of fault attacks on cryptographic algorithms
p. 96-107
Additive differentials for ARX mappings with probability exceeding $1/4$
p. 108-135
On the complexity of the problem of choice of large clusters
p. 136-143
On the complexity of the sequential sampling method
p. 144-154

Sommaire du Fascicule no. 3

Convex continuations of some discrete functions
p. 5-23
A new quantum oracle model for a hybrid quantum-classical attack on post-quantum lattice-based cryptosystems
p. 24-53
Perfect colorings of submatrix hypergraphs
p. 54-78
A study of the threshold stability of the bilevel problem of facility location and discriminatory pricing
p. 79-104
The problem of one machine with equal processing time and preemption
p. 105-122
Search for locally optimal strategies in a linear game problem with favorable situations
p. 123-143
On the maximum number of open triangles in graphs with few edges
p. 144-152

Sommaire du Fascicule no. 4

A branch, bound, and cuts algorithm for the dynamic competitive facility location problem
p. 5-26
A greedy algorithm for the resource-constrained project scheduling problem
p. 27-39
Approximation algorithms for graph clustering problems with clusters of bounded size
p. 40-57
The number of impossible additive differentials for the composition of XOR and bit rotation
p. 58-89
Updated estimates for algorithms for packing $2$-bar charts in a strip
p. 90-115
Variable neighborhood descent for finding the threshold stability radius in the facility location and discriminatory pricing problem
p. 116-133
An algorithm to search a solution to the production scheduling problem
p. 134-150
On the complexity of fanout-bounded parallel prefix circuits
p. 151-167
Methods of nonsmooth analysis in application to the problem of minimizing the sum of affine functions' modules
p. 168-185
Decomposition approach for a two echelon inventory management system
p. 186-212