Richard Koch Increasing the Size of a Network by a Constant Factor can Increase Performance by more than a Constant Factor. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:5, pp:801-823 [Journal]

Bettina Just Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:5, pp:909-926 [Journal]

Egon Balas, Jue Xue Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:5, pp:1000- [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