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, 2006, Volume 13

A B C E G I K L M N P R S T V Y Z Full List
A. A. Ageev, V. P. Il'ev, A. V. Kononov, A. S. Televnin
Computational complexity of the graph approximation problem
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  3–15
A. A. Ageev, A. E. Baburin, E. Kh. Gimadi
A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  11–20
M. A. Alekhina, V. V. Chugunova
On schemes that are asymptotically best with respect to reliability in the basis $\{&,\vee,^-\}$ with inverse faults at the inputs of elements
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  3–17
A. E. Baburin, see A. A. Ageev
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  11–20
A. E. Baburin, E. Kh. Gimadi
An approximate algorithm for finding a maximum-weight $d$-homogeneous connected spanning subgraph in a complete graph with random edge weights
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  3–20
A. E. Baburin, A. V. Pyatkin
Polynomial algorithms for solving the vector sum problem
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  3–10
A. E. Baburin, E. Kh. Gimadi
Certain generalization of the maximum traveling salesman problem
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  3–12
T. I. Belykh, see V. P. Bulatov
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  3–9
O. V. Borodin, A. O. Ivanova, A. V. Kostochka
Oriented 5-coloring of sparse plane graphs
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  16–32
Yu. I. Brodskii, V. I. Novitskii, Yu. N. Pavlovsky
An algorithm for the formation of a hierarchical system of invariants of isomorphisms of mappings of finite sets
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  21–30
V. P. Bulatov, T. I. Belykh
Global optimization and methods for finding all the roots of systems of nonlinear algebraic equations
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  3–9
A. V. Chashkin
On the complexity of a cyclic shift of a set of real numbers
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  89–92
S. S. Chauhan, see A. V. Eremeev
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  27–39
D. A. Chemisova, see S. V. Sevast'yanov
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  83–102
I. D. Chernykh, see S. V. Sevast'yanov
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  83–102
A. Yu. Chirkov, V. N. Shevchenko
On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a restriction on the cardinality
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  56–73
V. V. Chugunova, see M. A. Alekhina
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  3–17
A. V. Eremeev, A. A. Romanova, V. V. Servakh, S. S. Chauhan
Approximation solution of the supply management problem
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  27–39
M. S. Ershova
The branch and bound method for a quadratic problem of bilevel programming
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  40–56
A. F. Gainutdinova
On simulating the quantum and classical branching programs
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  45–64
E. Kh. Gimadi, Yu. V. Glazkov
An asymptotically exact algorithm for one modification of planar three-index assignment
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  10–26
E. Kh. Gimadi, see A. A. Ageev
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  11–20
E. Kh. Gimadi, see A. E. Baburin
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  3–20
E. Kh. Gimadi, see A. E. Baburin
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  3–12
Yu. V. Glazkov, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  10–26
D. V. Gruzdev, see V. N. Shevchenko
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  77–94
V. P. Il'ev, see A. A. Ageev
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  3–15
A. O. Ivanova, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  16–32
M. R. Khoshmand Asl, see V. K. Leont'ev
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  65–76
V. V. Kochergin
Asymptotics of the complexity of systems of integer linear forms for additive computations
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  38–58
R. M. Kolpakov
On the number of repetition-free words
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  27–37
A. V. Kononov, see A. A. Ageev
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  3–15
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  100–101
A. V. Kostochka, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  16–32
V. Yu. Krasin
On the weak isometries of the Boolean cube
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  26–32
A. A. Lazarev, R. R. Sadykov, S. V. Sevast'yanov
A scheme of approximation solution of problem $1|R_j|L_{\max}$
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  57–76
V. K. Leont'ev, M. R. Khoshmand Asl
Characterization of binary words by subwords
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  65–76
S. A. Malyugin
On enumeration of nonequivalent perfect binary codes of length 15 and rank 15
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  77–98
S. S. Marchenkov
A criterion for positive completeness in ternary logic
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  27–39
S. S. Marchenkov
Superpositions of elementary arithmetic functions
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  33–48
V. I. Novitskii, see Yu. I. Brodskii
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  21–30
I. A. Pankratova
Conditions for realization of a function on a semilattice over real bases of switching elements
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  40–61
V. I. Panteleev, see A. S. Zinchenko
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  13–26
T. A. Panyukova
By-passes with ordered enclosing in planar graphs
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  31–43
N. G. Parvatov
A completeness theorem in the class of quasimonotonic functions
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  62–82
Yu. N. Pavlovsky, see Yu. I. Brodskii
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  21–30
V. N. Potapov
A lower bound for the number of transitive perfect codes
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  49–59
A. V. Pyatkin, see V. G. Vizing
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  33–44
A. V. Pyatkin, see A. E. Baburin
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  3–10
A. M. Romanov
A survey of methods for constructing nonlinear perfect binary codes
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  60–88
A. A. Romanova, see A. V. Eremeev
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  27–39
K. L. Rychkov
Sufficient conditions for the existence of a graph with a given variety of balls
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  99–108
R. R. Sadykov, see A. A. Lazarev
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  57–76
V. V. Servakh, see A. V. Eremeev
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  27–39
V. V. Servakh
A polynomially solvable case of the three-stage Johnson problem
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  44–55
S. V. Sevast'yanov, see A. A. Lazarev
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  57–76
S. V. Sevast'yanov, D. A. Chemisova, I. D. Chernykh
Some properties of optimal schedules for the Johnson problem with preemption
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  83–102
V. N. Shevchenko, D. V. Gruzdev
A modification of the Fourier–Motskin algorithm for constructing a triangulation and its star coloring
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:1,  77–94
V. N. Shevchenko, see A. Yu. Chirkov
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  56–73
V. I. Shmyrev
A generalized linear exchange model
Diskretn. Anal. Issled. Oper., Series 2, 2006, Volume 13:2,  74–102
A. S. Televnin, see A. A. Ageev
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  3–15
V. G. Vizing, A. V. Pyatkin
On the coloring of incidentors in an oriented weighted multigraph
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:1,  33–44
V. G. Vizing
On bounds for the incidentor chromatic number of a directed weighted multigraph
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:4,  18–25
A. D. Yashunskii
Asymptotics of the probability of values of random Boolean expressions
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:2,  59–99
A. S. Zinchenko, V. I. Panteleev
Polynomial operator representations of functions of $k$-valued logic
Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13:3,  13–26
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020