David R. Wood An algorithm for finding a maximum clique in a graph. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:5, pp:211-217 [Journal]

Zeev Nutov, Michal Penn Faster approximation algorithms for weighted triconnectivity augmentation problems. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:5, pp:219-223 [Journal]