Leizhen Cai The complexity of the locally connected spanning tree problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:63-75 [Journal]

Eowyn Cenek, Lorna Stewart Maximum independent set and maximum clique algorithms for overlap graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:77-91 [Journal]

Gerhard J. Woeginger On the approximability of average completion time scheduling under precedence constraints. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:237-252 [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