Discrete Applied Mathematics, Volume 135

Volume 135, Number 1-3, 15 January 2004

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