Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnyj analiz i issledovanie operacij
Tome 30 (2023)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Pure Nash equilibrium in a two-step pricing game: covering sell points in a tourist city
V. V. Gusev
p. 5-27
On a countable family of boundary graph classes for the dominating set problem
G. S. Dakhno
;
D. S. Malyshev
p. 28-39
Simulation of COVID-19 propagation scenarios in the Republic of Kazakhstan based on regularization of agent model
O. I. Krivorotko
;
S. I. Kabanikhin
;
M. A. Bektemesov
;
M. I. Sosnovskaya
;
A. V. Neverov
p. 40-66
On search of Nash equilibrium in quasiconcave quadratic games
I. M. Minarchenko
p. 67-84
New cases of polynomial solvability of the independent set problem for graphs with forbidden triods
S. V. Sorochan
p. 85-109
On the number of minimum total dominating sets in trees
D. S. Taletskii
p. 110-129
Sommaire du
Fascicule no. 2
A testing set for Preparata-like codes
A. Yu. Vasil'eva
p. 5-14
Mathematical modelling of COVID-19 incidence in Moscow with an agent-based model
V. V. Vlasov
;
A. M. Deryabin
;
O. V. Zatsepin
;
G. D. Kaminskiy
;
E. V. Karamov
;
A. L. Karmanov
;
S. N. Lebedev
;
G. N. Rykovanov
;
A. V. Sokolov
;
N. A. Teplykh
;
A. S. Turgiyev
;
K. E. Khatuntsev
p. 15-47
The problem of scheduling for call-centre operators
A. V. Eremeev
;
M. A. Sakhno
p. 48-66
$\mathrm{S}$
-blocks of a special type with a small number of variables
D. A. Zyubina
;
N. N. Tokareva
p. 67-80
Equivalence relations in convex optimization
E. A. Nurminski
p. 81-90
Connection of two approaches to the Fisher model
V. I. Shmyrev
p. 91-108
Sommaire du
Fascicule no. 3
Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
A. O. Bakharev
p. 5-42
Additional constraints for dynamic competitive facility location problem
V. L. Beresnev
;
A. A. Melnikov
p. 43-56
On a lower bound for the number of bent functions at the minimum distance from a bent function in the Maiorana–McfFrland class
D. A. Bykov
;
N. A. Kolomeec
p. 57-80
Hypergraph edge representations with the use of homological paths
M. N. Vyalyi
;
V. E. Karpov
p. 81-95
Ptas for problems of vector choice and clustering with different centers
A. V. Pyatkin
p. 96-110
On trees with given diameter and extremal number of distance-
$k$
independent sets
D. S. Taletskii
p. 111-131
Sommaire du
Fascicule no. 4
A parallel “Go with the winners” algorithm for some scheduling problems
P. A. Borisovsky
p. 5-23
Enumeration of labeled bi-block graphs
V. A. Voblyi
p. 24-34
On relations associated with the Euler function
V. K. Leontiev
;
E. N. Gordeev
p. 35-45
Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
E. S. Malygina
;
A. V. Kutsenko
;
S. A. Novoselov
;
N. S. Kolesnikov
;
A. O. Bakharev
;
I. S. Khilchuk
;
A. S. Shaporenko
;
N. N. Tokareva
p. 46-90
A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs
D. S. Malyshev
;
O. I. Duginov
p. 91-109