External Links

    Journal: Discrete Applied Mathematics

    Volume 114, Issue 1-3

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