The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
1995, volume: 59, number: 3

  1. Lars Døvling Andersen, Herbert Fleischner
    The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:203-214 [Journal]
  2. Michal Benelli, Refael Hassin
    optimal Separable Partitioning in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:215-224 [Journal]
  3. Martin C. Carlisle, Errol L. Lloyd
    on the K-coloring of Intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:225-235 [Journal]
  4. Yuri N. Sotskov, Natalia V. Shakhlevich
    NP-hardness of Shop-scheduling Problems with Three Jobs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:237-266 [Journal]
  5. Ramjee P. Swaminathan, Donald K. Wagner
    The Arborescence-realization Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:267-283 [Journal]
  6. Arthur T. Benjamin, Cherlyn Converse, Henry A. Krieger
    How Do I Marry Thee? Let Me Count the Ways!. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:285-292 [Journal]
  7. Marco Carpentieri
    Some Democratic Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:293-298 [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