Paul Chew There is a Planar Graph Almost as Good as the Complete Graph. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1986, pp:169-177 [Conf]
Paul Chew There are Planar Graphs Almost as Good as the Complete Graph. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1989, v:39, n:2, pp:205-219 [Journal]
Paul Chew, Michael Machtey A Note on Structure and Looking Back Applied to the Complexity of Computable Functions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1981, v:22, n:1, pp:53-59 [Journal]
Automated Optic Disk Segmentation Via a Modified Snake Technique. [Citation Graph (, )][DBLP]
Search in 0.017secs, Finished in 0.018secs
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