|
Journals in DBLP
Maximal chordal subgraphs. [Citation Graph (, )][DBLP]
A new distance metric on strings computable in linear time. [Citation Graph (, )][DBLP]
A unified approach for price directive decomposition procedures in integer programming. [Citation Graph (, )][DBLP]
Enumeration of irreducible binary words. [Citation Graph (, )][DBLP]
Multiprocessor scheduling: combining LPT and MULTIFIT. [Citation Graph (, )][DBLP]
On the joint distribution of the insertion path length and the number of comparisons in search trees. [Citation Graph (, )][DBLP]
Matching polynomials of two classes of graphs. [Citation Graph (, )][DBLP]
Partial information in public key cryptography. [Citation Graph (, )][DBLP]
Can the catenation of two weakly sparse languages be dense? [Citation Graph (, )][DBLP]
|