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 20 (2013)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Half-chromatic number of graph
V. G. Vizing
p. 3-11
Some polynomially solvable cases and approximation algorithms for optimal communication tree construction problem
A. I. Erzin
;
R. V. Plotnikov
;
Yu. V. Shamardin
p. 12-27
Perfect
3
-colorings of prisms and M\"obius ladders
M. A. Lisitsyna
p. 28-36
A new attainable lower bound on the number of nodes in quadruple circulant networks
E. A. Monakhova
p. 37-44
On optimal cycles for regular balanced no-wait robotic cell problems
S. V. Pavlov
p. 45-57
Majorants and minorants in the graph class with given number of vertices and diameter
T. I. Fedoryaeva
p. 58-76
Essential dependence of the Kasami bent functions on the products of variables
A. A. Frolova
p. 77-92
The smallest
k
-enclosing ball problem
V. V. Shenmaier
p. 93-99
Sommaire du
Fascicule no. 2
On Deza graphs with parameters of complement graphs to lattice and triangular graphs
S. V. Goryainov
;
L. V. Shalaginov
p. 3-14
On partitions of an
n
-cube into perfect binary codes
G. K. Guskov
p. 15-25
Rows of Pascal's triangle modulo a~prime
V. V. Karachik
p. 26-46
On the complexity of some vector sequence clustering problems
A. V. Kel'manov
;
A. V. Pyatkin
p. 47-57
Identity checking tests for circuits of functional elements in fan-in~2 bases
S. S. Kolyada
p. 58-74
Extending operators for the independent set problem
D. S. Malyshev
p. 75-87
On maximal and minimal elements in partially ordered sets of Boolean degrees
S. S. Marchenkov
p. 88-101
Sommaire du
Fascicule no. 3
Steiner triple systems of small rank embedded into perfect binary codes
D. I. Kovalevskaya
;
F. I. Solov'eva
;
E. S. Filimonova
p. 3-25
Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable
D. S. Malyshev
p. 26-44
On the maximum cardinality of a~
k
-zero-free set in an Abelian group
V. G. Sargsyan
p. 45-64
On monomials in quadratic forms
A. V. Seliverstov
p. 65-70
Universal encoding of Markov's sources by symbols with varying durations
V. K. Trofimov
;
T. V. Khramova
p. 71-83
On the complexity of the satisfiability problem for a~system of functional Boolean equations
V. S. Fedorova
p. 84-100
Sommaire du
Fascicule no. 4
The complexity of cyclic scheduling for identical jobs
E. A. Bobrova
;
A. A. Romanova
;
V. V. Servakh
p. 3-14
A lower bound on formula size of a~ternary linear function
Yu. L. Vasil'ev
;
K. L. Rychkov
p. 15-26
Stability analysis of the efficient solution to a~vector problem of a~maximum cut
V. A. Emelichev
;
K. G. Kuzmin
p. 27-35
A
2
-approximation polynomial algorithm for one clustering problem
A. V. Kelmanov
;
V. I. Khandeev
p. 36-45
Steiner quadruple systems of small ranks and extended perfect binary codes
D. I. Kovalevskaya
;
F. I. Solov'eva
p. 46-64
On minimal circuts in Sheffer basis for linear Boolean functions
Yu. A. Kombarov
p. 65-87
Simple cycles in the
n
-cube with a~large group of automorphisms
A. L. Perezhogin
p. 88-97
Sommaire du
Fascicule no. 5
On the embedding of eigenfunctions of the Johnson graph into eigenfunctions of the Hamming graph
K. V. Vorobev
p. 3-12
On
m
-capacitated peripatetic salesman problem
E. Kh. Gimadi
;
A. M. Istomin
;
I. A. Rykov
p. 13-30
On extremely transitive extended perfect codes
G. K. Guskov
;
F. I. Solov'eva
p. 31-44
Graph classification for quadratic bent functions in~6 variables
E. P. Korsakova
p. 45-57
An impact of the two values difference's Hamming weight on its preserving probability after addition and subtraction
A. I. Pestunov
p. 58-65
On solvability of the axial
8
-index assignment problem on one-cycle permutations
O. Yu. Tsidulko
p. 66-83
A deterministic algorithm for solving the Weber problem for an
n
-sequentially connected chain
R. E. Shangin
p. 84-96
Sommaire du
Fascicule no. 6
Asymptotically reliability optimal schemes in special bases
A. V. Vasin
p. 3-15
The online algorithms for the problem of finding the maximum of the unimodal function
Yu. Yu. Velikanova
p. 16-29
On factorial subclasses of
K
1
,
3
-free graphs
V. A. Zamaraev
p. 30-39
Asymptotic enumeration of Eulerian orientations for graphs with strong mixing properties
M. I. Isaev
;
K. V. Isaeva
p. 40-58
Critical graph classes for the edge list-ranking problem
D. S. Malyshev
p. 59-76
On complexity measures for complexes of faces in the unit cube
I. P. Chukhrov
p. 77-94
Letter to the Editor
D. I. Kovalevskaya
;
F. I. Solov'eva
p. 95-96