External Links

    Journal: Discrete Applied Mathematics

    Volume 135, Issue 1-3

    1 -- 0Oleg V. Borodin. Preface: Russian Translations II
    3 -- 16Vladimir E. Alekseev. Polynomial algorithm for finding the largest independent sets in graphs without forks
    17 -- 30Vladimir E. Alekseev, Vadim V. Lozin. Local transformations of graphs preserving independence number
    31 -- 39Oleg V. Borodin, D. V. Loparev. Height of minor faces in plane normal maps
    41 -- 54A. V. Chashkin. Average time of computing Boolean operators
    55 -- 64A. V. Chashkin. Local complexity of Boolean functions
    65 -- 82A. V. Chashkin. Computation of Boolean functions by randomized programs
    83 -- 95Arkady A. Chernyak. Residual reliability of P-threshold graphs
    97 -- 104Fedor V. Fomin. Searching expenditure and interval graphs
    105 -- 111E. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov. On finding a cyclic tour and a vehicle loading plan yielding maximum profit
    113 -- 123M. I. Grinchuk, V. V. Kochergin. On the search of optimal order of variables in the synthesis of switching circuits by cascade technique
    125 -- 142Roman M. Kolpakov. Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
    143 -- 156A. A. Makhnev, D. V. Paduchikh. On the structure of connected locally GQ(3, 9)-graphs
    183 -- 203S. S. Marchenkov. A-classification of idempotent functions of many-valued logic
    205 -- 222Elizaveta A. Okol nishnikova. Comparing the sizes of nondeterministic branching read-k-times programs
    223 -- 233V. A. Orlov. Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
    235 -- 243A. L. Perezhogin. On cyclic <m,n>-enumerations
    245 -- 254V. N. Potapov. Redundancy estimates for the Lempel-Ziv algorithm of data compression
    255 -- 258A. M. Romanov. On nonsystematic perfect binary codes of length 15
    259 -- 265F. I. Salimov. Finitely generated distribution algebras
    267 -- 279V. V. Shenmaier. A greedy algorithm for maximizing a linear objective function
    281 -- 300L. A. Sholomov. On complexity of minimization and compression problems for models of sequential choice
    301 -- 307Anastasia Yu. Vasil eva. Local spectra of perfect binary codes
    runs on