The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Comput. Geometry Appl.
2001, volume: 11, number: 4

  1. Mikhail J. Atallah, Danny Z. Chen
    On Connecting Red and Blue Rectilinear Polygonal Obstacles with Nonintersecting Monotone Rectilinear Paths. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:373-400 [Journal]
  2. Alejandro López-Ortiz, Sven Schuierer
    Lower Bounds for Streets and Generalized Streets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:401-421 [Journal]
  3. Thomas Christof, Gerhard Reinelt
    Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:423-437 [Journal]
  4. J. Rafael Sendra, Carlos Villarino
    Optimal Reparametrization of Polynomial Algebraic Curves. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:439-453 [Journal]
  5. Binhai Zhu, Chung Keung Poon
    Efficient Approximation Algorithms for Two-Label Point Labeling. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:455-464 [Journal]
  6. Gill Barequet, Sariel Har-Peled
    Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:4, pp:465-474 [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