Discrete Applied Mathematics, Volume 114

Volume 114, Number 1-3, October 2001

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