René Peeters The maximum edge biclique problem is NP-complete. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:3, pp:651-654 [Journal]

Nicolai N. Pisaruk A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:3, pp:655-663 [Journal]

Michel Rigo The commutative closure of a binary slip-language is context-free: a new proof. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:3, pp:665-672 [Journal]