RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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, 2012, Volume 19

A B C D E G I K M P R S V Z Full List
V. E. Alekseev, D. B. Mokeev
König graphs with respect to $3$-paths
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  3–14
S. V. Avgustinovich, Yu. L. Vasil'ev, K. L. Rychkov
The computation complexity in the class of formulas
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  3–12
S. V. Avgustinovich, E. V. Gorkunov
On reconstruction of a binary code from dimensions of its subcodes
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  3–8
M. A. Bashov
Minimal in terms of double-sided shadow subsets of Boolean cube layer distinct from circles
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  3–20
I. D. Chernykh, see A. V. Pyatkin
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  65–78
A. Yu. Chirkov, see N. Yu. Zolotykh
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  35–46
I. P. Chukhrov
On minimal complexes of faces in the unit cube
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  79–99
I. A. Davydov
Tabu search for the discrete $(r|p)$-centroid problem
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  19–40
V. A. Emelichev, V. V. Korotkov
Stability analysis of Pareto optimal portfolio of multicriteria investment problem with Wald's maximin criteria
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  23–36
A. V. Eremeev
Genetic algorithm with tournament selection as a local search method
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  41–53
A. V. Eremeev, Yu. V. Kovalenko
On complexity of optimal recombination for one scheduling problem with setup times
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  13–26
E. Kh. Gimadi, E. V. Ivonina
Approximation algorithms for maximum-weight problem of two-peripatetic salesmen
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  17–32
E. Kh. Gimadi, A. A. Kurochkin
Effective algorithm for solving a two-level facility location problem on a tree-like network
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  9–22
E. V. Gorkunov, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  3–8
S. M. Grabovskaya
About the reliability of nonbranching programs in the basis of a generalized conjunction
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  33–40
E. V. Ivonina, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  17–32
A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin
Approximation algorithms for some NP-hard problems of searching a vectors subsequence
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  27–38
S. A. Khamidullin, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  27–38
Yu. A. Kochetov, see P. A. Kononova
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  63–82
N. A. Kolomeec
Enumeration of bent functions on the minimal distance from the quadratic bent function
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  41–58
Yu. A. Kombarov
On minimal realizations of linear Boolean functions
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  39–57
A. V. Kononov
On a two-machine routing open shop problem on a two-node network
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  54–74
P. A. Kononova
Lower and upper bounds for the optimal makespan in the multimedia problem
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  59–73
P. A. Kononova, Yu. A. Kochetov
Variable neighborhood search for two machine flowshop problem with a passive prefetch
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  63–82
V. V. Korotkov, see V. A. Emelichev
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  23–36
Yu. V. Kovalenko, see A. V. Eremeev
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  13–26
D. I. Kovalevskaya, F. I. Solov'eva
Steiner quadruple systems of small rank embedded into extended perfect binary codes
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  47–62
A. A. Kurochkin, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  9–22
D. S. Malyshev
The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  74–96
D. S. Malyshev
Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  58–64
D. S. Malyshev
Polynomial solvability of the independent set problem for one class of graphs with small diameter
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  66–72
D. S. Malyshev
Study of boundary graph classes for colorability problems
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  37–48
S. A. Malyugin
Affine nonsystematic codes
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  73–85
S. S. Marchenkov
On solutions to systems of automata-type functional equations
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  86–98
Yu. V. Merekin
The Shannon function of computation of the Arnold complexity of length $2^n$ binary words
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  49–55
D. B. Mokeev, see V. E. Alekseev
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  3–14
A. A. Panin, see A. V. Plyasunov
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  83–100
A. A. Panin, see A. V. Plyasunov
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  56–71
A. V. Plyasunov, A. A. Panin
The pricing problem. Part I. Exact and approximate algorithms
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  83–100
A. V. Plyasunov, A. A. Panin
The pricing problem. Part 2. The computational complexity
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  56–71
V. N. Potapov
Construction of Hamiltonian cycles with a given range of directions of edges in the Boolean $n$-dimensional cube
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  75–83
A. V. Pyatkin, I. D. Chernykh
Preemptive routing open shop on a link
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  65–78
S. M. Romanchenko, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  27–38
A. M. Romanov
On the admissible families of components of Hamming codes
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  84–91
A. A. Rubtsov, see M. N. Vyalyi
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  3–18
K. L. Rychkov, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  3–12
V. V. Shenmaier
Approximation scheme for one problem of a vector subset choice
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  92–100
L. A. Sholomov
Decomposition of underdetermined data
Diskretn. Anal. Issled. Oper., 2012, Volume 19:6,  72–98
F. I. Solov'eva, see D. I. Kovalevskaya
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  47–62
V. A. Vasil'ev
On existence of Walras equilibrium in a multi-regional economic model
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  15–34
Yu. L. Vasil'ev, see S. V. Avgustinovich
Diskretn. Anal. Issled. Oper., 2012, Volume 19:3,  3–12
A. Yu. Vasil'eva
On reconstructive sets of vertices in the Boolean cube
Diskretn. Anal. Issled. Oper., 2012, Volume 19:1,  3–16
Yu. Yu. Velikanova
Running time of local search algorithms for a scheduling problem on the parallel machines
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  21–34
V. G. Vizing
Multicoloring of incidentors of weighted undirected multigraph
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  35–47
V. A. Voblyi
A formula for the number of labeled connected graphs
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  48–59
K. V. Vorob'ev
Perfect multiple coverings of hypercube
Diskretn. Anal. Issled. Oper., 2012, Volume 19:4,  60–65
M. N. Vyalyi, A. A. Rubtsov
Decidability conditions for problems about automata reading infinite words
Diskretn. Anal. Issled. Oper., 2012, Volume 19:2,  3–18
N. Yu. Zolotykh, A. Yu. Chirkov
On an upper bound for the cardinality of a minimal teaching set of a threshold function
Diskretn. Anal. Issled. Oper., 2012, Volume 19:5,  35–46
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020