The SCEAS System
Navigation Menu

Journals in DBLP

Comput. Geom.
2000, volume: 16, number: 4

  1. Alfredo García Olaverri, Marc Noy, Javier Tejel
    Lower bounds on the number of crossing-free subgraphs of KN. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:211-221 [Journal]
  2. Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
    Computing simple paths among obstacles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:223-233 [Journal]
  3. Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
    Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:235-243 [Journal]
  4. Timothy M. Chan
    Reporting curve segment intersections using restricted predicates. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:245-256 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002