Leslie A. Hall A Note on Generalizing the Maximum Lateness Criterion for Scheduling. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:47, n:2, pp:129-137 [Journal]

Katta G. Murty On the Complexity of a Special Basis Problem in LP. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:47, n:2, pp:181-185 [Journal]

Pawel Winter Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:47, n:2, pp:187-206 [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