The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2004, volume: 135, number: 1-3

  1. Oleg V. Borodin
    Preface: Russian Translations II. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:1-0 [Journal]
  2. Vladimir E. Alekseev
    Polynomial algorithm for finding the largest independent sets in graphs without forks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:3-16 [Journal]
  3. Vladimir E. Alekseev, Vadim V. Lozin
    Local transformations of graphs preserving independence number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:17-30 [Journal]
  4. Oleg V. Borodin, D. V. Loparev
    Height of minor faces in plane normal maps. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:31-39 [Journal]
  5. A. V. Chashkin
    Local complexity of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:55-64 [Journal]
  6. A. V. Chashkin
    Computation of Boolean functions by randomized programs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:65-82 [Journal]
  7. Arkady A. Chernyak
    Residual reliability of P-threshold graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:83-95 [Journal]
  8. Fedor V. Fomin
    Searching expenditure and interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:97-104 [Journal]
  9. E. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov
    On finding a cyclic tour and a vehicle loading plan yielding maximum profit. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:105-111 [Journal]
  10. M. I. Grinchuk, V. V. Kochergin
    On the search of optimal order of variables in the synthesis of switching circuits by cascade technique. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:113-123 [Journal]
  11. Roman M. Kolpakov
    Criterion of generativeness of sets of rational probabilities by a class of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:125-142 [Journal]
  12. A. A. Makhnev, D. V. Paduchikh
    On the structure of connected locally GQ(3, 9)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:143-156 [Journal]
  13. S. A. Malyugin
    On a lower bound on the number of perfect binary codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:157-160 [Journal]
  14. S. A. Malyugin
    On enumeration of the perfect binary codes of length 15. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:161-181 [Journal]
  15. S. S. Marchenkov
    A-classification of idempotent functions of many-valued logic. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:183-203 [Journal]
  16. Elizaveta A. Okol'nishnikova
    Comparing the sizes of nondeterministic branching read-k-times programs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:205-222 [Journal]
  17. V. A. Orlov
    Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:223-233 [Journal]
  18. A. L. Perezhogin
    On cyclic <m,n>-enumerations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:235-243 [Journal]
  19. V. N. Potapov
    Redundancy estimates for the Lempel-Ziv algorithm of data compression. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:245-254 [Journal]
  20. A. M. Romanov
    On nonsystematic perfect binary codes of length 15. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:255-258 [Journal]
  21. F. I. Salimov
    Finitely generated distribution algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:259-265 [Journal]
  22. V. V. Shenmaier
    A greedy algorithm for maximizing a linear objective function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:267-279 [Journal]
  23. L. A. Sholomov
    On complexity of minimization and compression problems for models of sequential choice. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:281-300 [Journal]
  24. Anastasia Yu. Vasil'eva
    Local spectra of perfect binary codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:301-307 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002