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, 2009, Volume 16

A B C D E F G I K L M O P Q R S T V Z Full List
A. A. Ageev, A. V. Pyatkin
A 2-approximation algorithm for the metric 2-peripatetic salesman problem
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  3–20
A. A. Ageev, E. Kh. Gimadi, A. A. Kurochkin
Polynomial algorithm for the path facility location problem with uniform capacities
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  3–18
V. E. Alekseev, S. V. Sorochan
On the entropy minimal hereditary classes of coloured graphs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  19–25
S. N. Astrakov, A. I. Erzin, V. V. Zalyubovskiy
Sensor networks and covering of plane by discs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  3–19
Ph. Baptiste, J. Carlier, A. V. Kononov, M. Queyranne, S. V. Sevast'yanov, M. Sviridenko
Structural properties of optimal schedules with preemption
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  3–36
Ts. C.-D. Batueva
Arithmetical closure of two dimensional Toeplitz words
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  3–15
O. V. Borodin, A. O. Ivanova
Near-proper vertex 2-colorings of sparse graphs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  16–20
O. V. Borodin
Acyclic 3-choosability of plane graphs without cycles of length from 4 to 12
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  26–33
O. V. Borodin
Acyclic 4-coloring of plane graphs without cycles of length 4 and 6
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  3–11
J. Carlier, see Ph. Baptiste
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  3–36
D. A. Chemisova
On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  74–98
A. B. Dainiak
On the number of independent sets in trees of fixed diameter
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  61–73
N. S. Dyomin, A. V. Erlykova, E. A. Panshina
Research of one type of exotics options with flight and onflow of capital in binomial model of financial $(B,S)$-market
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  23–42
V. A. Emelichev, O. V. Karelkina
On quasistability of a lexicographic MINSUM arrangement problem
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  74–84
A. V. Erlykova, see N. S. Demin
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  23–42
A. I. Erzin, see S. N. Astrakov
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  3–19
T. I. Fedoryaeva
Exact upper estimates of the number of different balls of given radius for the graphs with fixed number of vertexes and diameter
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  74–92
E. Kh. Gimadi, see A. A. Ageev
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  3–18
A. O. Ivanova, see O. V. Borodin
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  16–20
O. V. Karelkina, see V. A. Emelichev
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  74–84
V. M. Kartak
The grouping method for the linear relaxation of 1d cutting stock problem
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  47–62
A. V. Kel'manov, L. V. Mikhaylova, S. A. Khamidullin
On one problem of searching for tuples of fragments in a numerical sequence
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  31–46
S. A. Khamidullin, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  31–46
D. B. Khoroshilova
On two-colour perfect colourings of circular graphs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  80–92
K. B. Klimentova, see I. L. Vasiliev
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  21–41
A. V. Kononov, see Ph. Baptiste
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  3–36
A. A. Kurochkin, see A. A. Ageev
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  3–18
A. V. Los', see F. I. Solov'eva
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  63–73
D. S. Malyshev
On infinity of the set of boundary classes for the 3-edge-colorability problem
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  37–43
D. S. Malyshev
Boundary classes of graphs for some recognition problems
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  85–94
D. S. Malyshev
Continued sets of boundary classes of graphs for colorability problems
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  41–51
D. S. Malyshev
On minimal hard classes of graphs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  43–51
S. A. Malyugin
On nonsystematic perfect codes over finite fields
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  44–63
S. S. Marchenkov
On closed classes of a $k$-valued logics functions defined by a single endomorphism
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  52–67
L. V. Mikhailova, see A. V. Kel'manov
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  31–46
I. Yu. Mogilnykh
On nonexistence of some perfect 2-colorings of Johnson graphs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  52–68
E. A. Monakhova
Optimal generalized Petersen graphs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  47–60
E. A. Okolnishnikova
Lower bound for the computation complexity of BCH-codes for branching programs
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  69–77
E. A. Pan'shina, see N. S. Demin
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  23–42
A. V. Pyatkin, see A. A. Ageev
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  3–20
A. V. Pyatkin
On the complexity of the maximum sum length vectors subset choice problem
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  68–73
M. Queyranne, see Ph. Baptiste
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  3–36
E. O. Rapoport
About optimal control of allotment of impartible resource
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  64–79
A. S. Rudnev
Probabilistic tabu search algorithm for the packing circles and rectangles into the strip
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  61–86
K. L. Rychkov
On the complexity of generalized contact circuits
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  78–87
S. V. Sevast'yanov, see Ph. Baptiste
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  3–36
P. V. Skums, R. I. Tyshkevich
Reconstruction conjecture for graphs with restrictions for 4-vertex paths
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  87–96
F. I. Solov'eva, A. V. Los'
On partitions into perfect $q$-ary codes
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  63–73
S. V. Sorochan, see V. E. Alekseev
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  19–25
M. Sviridenko, see Ph. Baptiste
Diskretn. Anal. Issled. Oper., 2009, Volume 16:1,  3–36
R. I. Tyshkevich, see P. V. Skums
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  87–96
I. L. Vasiliev, K. B. Klimentova
A branch and bound method for the facility location problem with customer preferences
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  21–41
A. V. Vasin
Synthesis of asymptotically optimal reliable circuits in basis $\{&,\lnot\}$
Diskretn. Anal. Issled. Oper., 2009, Volume 16:6,  12–22
V. G. Vizing
Vertex colorings of graph with the majority restrictions on the consuming colors
Diskretn. Anal. Issled. Oper., 2009, Volume 16:4,  21–30
V. G. Vizing
On one twocriterial graph problem
Diskretn. Anal. Issled. Oper., 2009, Volume 16:5,  34–40
S. A. Volkov
The class of Skolem elementary functions
Diskretn. Anal. Issled. Oper., 2009, Volume 16:2,  42–60
V. V. Zalyubovskiy, see S. N. Astrakov
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  3–19
D. Zh. Zambalayeva
Partition of a planar graph with girth 7 into two star forests
Diskretn. Anal. Issled. Oper., 2009, Volume 16:3,  20–46
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020