The SCEAS System
Navigation Menu

Journals in DBLP

Comput. Geom.
1999, volume: 14, number: 4

  1. Jerzy W. Jaromczyk, Miroslaw Kowaluk
    A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:14, n:4, pp:187-196 [Journal]
  2. Christos Levcopoulos, Drago Krznaric
    The greedy triangulation can be computed from the Delaunay triangulation in linear time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:14, n:4, pp:197-220 [Journal]
  3. Kevin D. Hunter, Theodosios Pavlidis
    Non-interactive geometric probing: Reconstructing non-convex polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:14, n:4, pp:221-240 [Journal]
  4. Alon Efrat, Matthew J. Katz
    On the union of k-curved objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:14, n:4, pp:241-254 [Journal]
  5. Ruth Kuchem, Dorothea Wagner
    Wiring edge-disjoint layouts. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:14, n:4, pp:255-273 [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