The SCEAS System
Navigation Menu

Search the dblp DataBase


Fabrizio Frati: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta
    On the Topologies of Local Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:31-44 [Conf]
  2. Giuseppe Di Battista, Fabrizio Frati
    Small Area Drawings of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:89-100 [Conf]
  3. Fabrizio Frati, Giuseppe Di Battista
    Three-Dimensional Drawings of Bounded Degree Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:89-94 [Conf]
  4. Fabrizio Frati
    Embedding Graphs Simultaneously with Fixed Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:108-113 [Conf]
  5. Fabrizio Frati
    Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:225-228 [Conf]
  6. Ulrik Brandes, Cesim Erten, J. Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, S. Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
    Colored Simultaneous Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:254-263 [Conf]
  7. Fabrizio Frati, Markus Geyer, Michael Kaufmann
    Packing and Squeezing Subgraphs into Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:394-405 [Conf]
  8. Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati
    How to Draw a Clustered Tree. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:89-101 [Conf]
  9. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
    On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:1-13 [Conf]

  10. Planar Packing of Diameter-Four Trees. [Citation Graph (, )][DBLP]

  11. On Directed Graphs with an Upward Straight-line. [Citation Graph (, )][DBLP]

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

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

  14. Non-convex Representations of Graphs. [Citation Graph (, )][DBLP]

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

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

  17. Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. [Citation Graph (, )][DBLP]

  18. Straight-Line Orthogonal Drawings of Binary and Ternary Trees. [Citation Graph (, )][DBLP]

  19. Constrained Simultaneous and Near-Simultaneous Embeddings. [Citation Graph (, )][DBLP]

  20. A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. [Citation Graph (, )][DBLP]

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

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

  23. Upward Straight-Line Embeddings of Directed Graphs into Point Sets. [Citation Graph (, )][DBLP]

  24. On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. [Citation Graph (, )][DBLP]

  25. A Lower Bound on the Area Requirements of Series-Parallel Graphs. [Citation Graph (, )][DBLP]

  26. Crossings between Curves with Many Tangencies. [Citation Graph (, )][DBLP]

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

  28. Small Area Drawings of Outerplanar Graphs. [Citation Graph (, )][DBLP]

  29. Upward straight-line embeddings of directed graphs into point sets. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002