The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
1988, volume: 20, number: 3


  1. Maximal chordal subgraphs. [Citation Graph (, )][DBLP]


  2. A new distance metric on strings computable in linear time. [Citation Graph (, )][DBLP]


  3. A unified approach for price directive decomposition procedures in integer programming. [Citation Graph (, )][DBLP]


  4. Enumeration of irreducible binary words. [Citation Graph (, )][DBLP]


  5. Multiprocessor scheduling: combining LPT and MULTIFIT. [Citation Graph (, )][DBLP]


  6. On the joint distribution of the insertion path length and the number of comparisons in search trees. [Citation Graph (, )][DBLP]


  7. Matching polynomials of two classes of graphs. [Citation Graph (, )][DBLP]


  8. Partial information in public key cryptography. [Citation Graph (, )][DBLP]


  9. Can the catenation of two weakly sparse languages be dense? [Citation Graph (, )][DBLP]

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