| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
|
Kashyrskikh, K.N.
|
|
2001
|
114 |
1-3 |
p. 255-271
17 p.
|
article
|
| 2 |
A-closed classes of idempotent functions of many-valued logic definable by binary relations
|
Marchenkov, S.S.
|
|
2001
|
114 |
1-3 |
p. 203-225
23 p.
|
article
|
| 3 |
Acyclic colouring of 1-planar graphs
|
Borodin, O.V.
|
|
2001
|
114 |
1-3 |
p. 29-41
13 p.
|
article
|
| 4 |
An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function
|
Il'ev, Victor P.
|
|
2001
|
114 |
1-3 |
p. 131-146
16 p.
|
article
|
| 5 |
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
|
Beresnev, V.L.
|
|
2001
|
114 |
1-3 |
p. 13-22
10 p.
|
article
|
| 6 |
Author Index to Volume 114 (2001)
|
|
|
2001
|
114 |
1-3 |
p. 313-
1 p.
|
article
|
| 7 |
Average case complexity for finite Boolean functions
|
Chashkin, A.V.
|
|
2001
|
114 |
1-3 |
p. 43-59
17 p.
|
article
|
| 8 |
Complexity of finding a join of maximum weight
|
Ageev, A.A.
|
|
2001
|
114 |
1-3 |
p. 3-7
5 p.
|
article
|
| 9 |
Cyclic distance-preserving codes on a constant-weight basis
|
van Zanten, A.J.
|
|
2001
|
114 |
1-3 |
p. 289-294
6 p.
|
article
|
| 10 |
Edge and total coloring of interval graphs
|
Bojarshinov, V.A.
|
|
2001
|
114 |
1-3 |
p. 23-28
6 p.
|
article
|
| 11 |
Linear time approximation scheme for the multiprocessor open shop problem
|
Sevastianov, S.V.
|
|
2001
|
114 |
1-3 |
p. 273-288
16 p.
|
article
|
| 12 |
Locally bounded hereditary subclasses of k-colourable graphs
|
Zverovich, I.E.
|
|
2001
|
114 |
1-3 |
p. 301-311
11 p.
|
article
|
| 13 |
Lower bounds for the complexity of restrictions of Boolean functions
|
Chashkin, A.V.
|
|
2001
|
114 |
1-3 |
p. 61-93
33 p.
|
article
|
| 14 |
Minimal enumerations of subsets of a finite set and the middle level problem
|
Evdokimov, A.A.
|
|
2001
|
114 |
1-3 |
p. 109-114
6 p.
|
article
|
| 15 |
On an infinite sequence of improving Boolean bases
|
Cherukhin, D.U.
|
|
2001
|
114 |
1-3 |
p. 95-108
14 p.
|
article
|
| 16 |
On combinatorial properties of the Arshon sequence
|
Klepinin, A.V.
|
|
2001
|
114 |
1-3 |
p. 155-169
15 p.
|
article
|
| 17 |
On connected list colorings of graphs
|
Vizing, V.G.
|
|
2001
|
114 |
1-3 |
p. 295-300
6 p.
|
article
|
| 18 |
On factor graphs of DOL words
|
Frid, A.E.
|
|
2001
|
114 |
1-3 |
p. 121-130
10 p.
|
article
|
| 19 |
On finding a maximum spanning tree of bounded radius
|
Serdjukov, A.I
|
|
2001
|
114 |
1-3 |
p. 249-253
5 p.
|
article
|
| 20 |
On minimal coverings of the Boolean cube by centered antichains
|
Kasim-Zade, O.M.
|
|
2001
|
114 |
1-3 |
p. 147-153
7 p.
|
article
|
| 21 |
On the asymptotics of the number of binary words with a given length of a maximal series
|
Korshunov, A.D.
|
|
2001
|
114 |
1-3 |
p. 171-201
31 p.
|
article
|
| 22 |
On the number of connected sets with the neighborhood of a given size in a graph
|
Sapozhenko, A.A.
|
|
2001
|
114 |
1-3 |
p. 233-247
15 p.
|
article
|
| 23 |
On the subword complexity of iteratively generated infinite words
|
Frid, A.E.
|
|
2001
|
114 |
1-3 |
p. 115-120
6 p.
|
article
|
| 24 |
Perfect binary (n,3) codes: the structure of graphs of minimum distances
|
Avgustinovich, S.V.
|
|
2001
|
114 |
1-3 |
p. 9-11
3 p.
|
article
|
| 25 |
Preface
|
Borodin, Oleg
|
|
2001
|
114 |
1-3 |
p. 1-
1 p.
|
article
|
| 26 |
Upper bounds for the complexity of sequences generated by symmetric Boolean functions
|
Merekin, Yu.V.
|
|
2001
|
114 |
1-3 |
p. 227-231
5 p.
|
article
|
Journal description