Mark Jerrum A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1995, v:7, n:2, pp:157-166 [Journal]
Joel Spencer Asymptotic Packing via a Branching Process. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1995, v:7, n:2, pp:167-172 [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