The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2000, volume: 102, number: 3

  1. H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee
    An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:159-173 [Journal]
  2. Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman
    The even adjacency split problem for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:175-188 [Journal]
  3. Peter C. Fishburn, Paul E. Wright
    Interference patterns in bijective colorings of 2-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:189-204 [Journal]
  4. Raymond Greenlaw, Rossella Petreschi
    Computing Prüfer codes efficiently in parallel. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:205-222 [Journal]
  5. Nicholas G. Hall, Chris N. Potts, Chelliah Sriskandarajah
    Parallel machine scheduling with a common server. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:223-243 [Journal]
  6. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Approximation algorithms for some optimum communication spanning tree problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:245-266 [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