The SCEAS System
Navigation Menu

Journals in DBLP

Discrete & Computational Geometry
2006, volume: 36, number: 2

  1. Nathan Linial, Isabella Novik
    How Neighborly Can a Centrally Symmetric Polytope Be? [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:273-281 [Journal]
  2. Seok-Hee Hong, Brendan D. McKay, Peter Eades
    A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:283-311 [Journal]
  3. Sonja Lj. Cukic, Dmitry N. Kozlov
    Homotopy Type of Complexes of Graph Homomorphisms between Cycles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:313-329 [Journal]
  4. Hiroshi Hirai
    A Geometric Study of the Split Decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:331-361 [Journal]
  5. Michael J. Mossinghoff
    Isodiametric Problems for Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:363-379 [Journal]
  6. Michal Krízek
    There Is No Face-to-Face Partition of R5 into Acute Simplices. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:381-390 [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