The SCEAS System
| |||||||

## Search the dblp DataBase
Fabrizio Frati:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Giuseppe Di Battista, Fabrizio Frati
**Small Area Drawings of Outerplanar Graphs.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:89-100 [Conf] - Fabrizio Frati, Giuseppe Di Battista
**Three-Dimensional Drawings of Bounded Degree Trees.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:89-94 [Conf] - Fabrizio Frati
**Embedding Graphs Simultaneously with Fixed Edges.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:108-113 [Conf] - 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] - 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] - Fabrizio Frati, Markus Geyer, Michael Kaufmann
**Packing and Squeezing Subgraphs into Planar Graphs.**[Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:394-405 [Conf] - Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati
**How to Draw a Clustered Tree.**[Citation Graph (0, 0)][DBLP] WADS, 2007, pp:89-101 [Conf] - 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] **Planar Packing of Diameter-Four Trees.**[Citation Graph (, )][DBLP]**On Directed Graphs with an Upward Straight-line.**[Citation Graph (, )][DBLP]**Succinct Greedy Drawings Do Not Always Exist.**[Citation Graph (, )][DBLP]**On the Perspectives Opened by Right Angle Crossing Drawings.**[Citation Graph (, )][DBLP]**Non-convex Representations of Graphs.**[Citation Graph (, )][DBLP]**An Algorithm to Construct Greedy Drawings of Triangulations.**[Citation Graph (, )][DBLP]**Splitting Clusters to Get C-Planarity.**[Citation Graph (, )][DBLP]**Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.**[Citation Graph (, )][DBLP]**Straight-Line Orthogonal Drawings of Binary and Ternary Trees.**[Citation Graph (, )][DBLP]**Constrained Simultaneous and Near-Simultaneous Embeddings.**[Citation Graph (, )][DBLP]**A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.**[Citation Graph (, )][DBLP]**Testing Planarity of Partially Embedded Graphs.**[Citation Graph (, )][DBLP]**Straight-Line Rectangular Drawings of Clustered Graphs.**[Citation Graph (, )][DBLP]**Upward Straight-Line Embeddings of Directed Graphs into Point Sets.**[Citation Graph (, )][DBLP]**On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs.**[Citation Graph (, )][DBLP]**A Lower Bound on the Area Requirements of Series-Parallel Graphs.**[Citation Graph (, )][DBLP]**Crossings between Curves with Many Tangencies.**[Citation Graph (, )][DBLP]**Acyclically 3-Colorable Planar Graphs.**[Citation Graph (, )][DBLP]**Small Area Drawings of Outerplanar Graphs.**[Citation Graph (, )][DBLP]**Upward straight-line embeddings of directed graphs into point sets.**[Citation Graph (, )][DBLP]
Search in 0.027secs, Finished in 0.028secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |