Guochuan Zhang Short Communication: Worst-Case Analysis of the FFH Algorithm for Online Variable-Sized Bin Packing. [Citation Graph (0, 0)][DBLP] Computing, 1996, v:56, n:2, pp:165-172 [Journal]
B. Bodenstorfer Short Communication/Kureze Mitteilung. How many Minimal Upper Bounds of Minimal Upper Bounds. [Citation Graph (0, 0)][DBLP] Computing, 1996, v:56, n:2, pp:173-178 [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