The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patrizio Angelini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
    Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:287-299 [Conf]

  2. Succinct Greedy Drawings Do Not Always Exist. [Citation Graph (, )][DBLP]


  3. On the Perspectives Opened by Right Angle Crossing Drawings. [Citation Graph (, )][DBLP]


  4. An Algorithm to Construct Greedy Drawings of Triangulations. [Citation Graph (, )][DBLP]


  5. Splitting Clusters to Get C-Planarity. [Citation Graph (, )][DBLP]


  6. Topological Morphing of Planar Graphs. [Citation Graph (, )][DBLP]


  7. Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]


  8. Straight-Line Rectangular Drawings of Clustered Graphs. [Citation Graph (, )][DBLP]


  9. Acyclically 3-Colorable Planar Graphs. [Citation Graph (, )][DBLP]


  10. On a Tree and a Path with no Geometric Simultaneous Embedding [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
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