RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Author Index, 2016, Volume 23

A B I K L M N O P R S T V Z Full List
V. E. Alekseev, D. V. Zakharova
Independent sets in graphs without subtrees with many leaves
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  5–16
T. A. Angelov, see G. Sh. Tamasyan
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  100–123
Ts. Ch.-D. Batueva
Discrete dynamical systems with threshold functions of up to three variables
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  17–34
V. L. Beresnev, A. A. Melnikov
A capacitated competitive facility location problem
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  35–50
I. S. Bykov
On locally balanced Gray codes
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  51–64
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya
Graph clustering with a constraint on cluster sizes
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  5–20
S. D. Il'eva, see V. P. Il'ev
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  5–20
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev
Fully polynomial-time approximation scheme for a sequence $2$-clustering problem
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  21–40
A. V. Kel'manov, A. V. Motkova
Exact pseudopolinomial algorithms for a balanced $2$-clustering problem
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  21–34
S. A. Khamidullin, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  21–40
V. I. Khandeev, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  21–40
A. V. Kononov, P. A. Kononova
On minimizing dataset transfer time in an acyclic network with four servers
Diskretn. Anal. Issled. Oper., 2016, Volume 23:4,  5–25
P. A. Kononova, see A. V. Kononov
Diskretn. Anal. Issled. Oper., 2016, Volume 23:4,  5–25
Yu. V. Kovalenko
On complexity of optimal recombination for flowshop scheduling problems
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  41–62
A. Yu. Krylatov
Network flow assignment as a fixed point problem
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  63–87
S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov
Comparison of models of planning public-private partnership
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  35–60
A. N. Maksimenko
Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  61–80
S. S. Marchenkov
On maximal subalgebras of the algebras of unary recursive functions
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  81–92
A. A. Melnikov, see V. L. Beresnev
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  35–50
A. V. Motkova, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  21–34
A. A. Navrotskaya, see V. P. Il'ev
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  5–20
A. K. Oblaukhov
Metric complements to subspaces in the Boolean cube
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  93–106
A. A. Panin, see S. M. Lavlinskyi
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  35–60
A. V. Plyasunov, see S. M. Lavlinskyi
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  35–60
D. P. Pokrasenko
On the maximal component algebraic immunity of vectorial Boolean functions
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  88–99
E. V. Prosolupov, see G. Sh. Tamasyan
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  100–123
A. M. Romanov
On full-rank perfect codes over finite fields
Diskretn. Anal. Issled. Oper., 2016, Volume 23:3,  107–123
A. M. Romanov
On the embedding of constant-weight codes into perfect codes
Diskretn. Anal. Issled. Oper., 2016, Volume 23:4,  26–34
V. V. Shenmaier
Solving some vector subset problems by Voronoi diagrams
Diskretn. Anal. Issled. Oper., 2016, Volume 23:4,  102–115
G. Sh. Tamasyan, E. V. Prosolupov, T. A. Angelov
Comparative study of two fast algorithms for projecting a point to the standard simplex
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  100–123
A. A. Taranenko
Permanents of multidimensional matrices: properties and applications
Diskretn. Anal. Issled. Oper., 2016, Volume 23:4,  35–101
N. S. Veremchuk, see G. G. Zabudskii
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  82–96
V. A. Vitkup
On symmetric properties of APN functions
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  65–81
V. A. Voblyi
Enumeration of labeled connected graphs with given order and number of edges
Diskretn. Anal. Issled. Oper., 2016, Volume 23:2,  5–20
G. G. Zabudsky, N. S. Veremchuk
An algorithm for approximate solution to the Weber problem on a line with forbidden gaps
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  82–96
D. V. Zakharova, see V. E. Alekseev
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  5–16
A. B. Zinchenko
Polytopes of special classes of balanced games with transferable utility
Diskretn. Anal. Issled. Oper., 2016, Volume 23:1,  97–112
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018