Fabrizio Frati Vis

*	2009
23	EE	Patrizio Angelini, Fabrizio Frati, Michael Kaufmann: Straight-Line Rectangular Drawings of Clustered Graphs. WADS 2009: 25-36
22	EE	Giuseppe Di Battista, Fabrizio Frati: Small Area Drawings of Outerplanar Graphs. Algorithmica 54(1): 25-53 (2009)
21	EE	Fabrizio Frati, Markus Geyer, Michael Kaufmann: Planar packing of trees and spider trees. Inf. Process. Lett. 109(6): 301-307 (2009)
	2008
20	EE	Patrizio Angelini, Fabrizio Frati, Luca Grilli: An Algorithm to Construct Greedy Drawings of Triangulations. Graph Drawing 2008: 26-37
19	EE	Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Non-convex Representations of Graphs. Graph Drawing 2008: 390-395
18	EE	Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov: Upward Straight-Line Embeddings of Directed Graphs into Point Sets. WG 2008: 122-133
17	EE	Fabrizio Frati: A Lower Bound on the Area Requirements of Series-Parallel Graphs. WG 2008: 159-170
16	EE	Fabrizio Frati: On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Int. J. Comput. Geometry Appl. 18(3): 251-271 (2008)
15	EE	Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia: C-Planarity of C-Connected Clustered Graphs. J. Graph Algorithms Appl. 12(2): 225-262 (2008)
	2007
14		Fabrizio Frati: Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. CCCG 2007: 225-228
13	EE	Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263
12	EE	Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. FUN 2007: 1-13
11	EE	Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov: Constrained Simultaneous and Near-Simultaneous Embeddings. Graph Drawing 2007: 268-279
10	EE	Giuseppe Di Battista, Fabrizio Frati: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Graph Drawing 2007: 291-302
9	EE	Fabrizio Frati, Maurizio Patrignani: A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. Graph Drawing 2007: 339-344
8	EE	Fabrizio Frati: Straight-Line Orthogonal Drawings of Binary and Ternary Trees. Graph Drawing 2007: 76-87
7	EE	Fabrizio Frati, Markus Geyer, Michael Kaufmann: Packing and Squeezing Subgraphs into Planar Graphs. MFCS 2007: 394-405
6	EE	Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati: How to Draw a Clustered Tree. WADS 2007: 89-101
5	EE	Fabrizio Frati: On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. WG 2007: 133-144
	2006
4	EE	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. CAAN 2006: 31-44
3	EE	Fabrizio Frati: Embedding Graphs Simultaneously with Fixed Edges. Graph Drawing 2006: 108-113
2	EE	Fabrizio Frati, Giuseppe Di Battista: Three-Dimensional Drawings of Bounded Degree Trees. Graph Drawing 2006: 89-94
	2005
1	EE	Giuseppe Di Battista, Fabrizio Frati: Small Area Drawings of Outerplanar Graphs. Graph Drawing 2005: 89-100

Coauthor Index

1	Patrizio Angelini	[20] [23]
2	Giuseppe Di Battista	[1] [2] [4] [6] [10] [12] [15] [19] [22]
3	Ulrik Brandes	[13]
4	Pier Francesco Cortese	[4] [15]
5	Guido Drovandi	[6]
6	Cesim Erten	[13]
7	Alejandro Estrella-Balderrama	[18]
8	J. Joseph Fowler	[13]
9	Markus Geyer	[7] [13] [21]
10	Luca Grilli	[4] [20]
11	Carsten Gutwenger	[13]
12	Seok-Hee Hong	[13]
13	Michael Kaufmann	[7] [11] [13] [21] [23]
14	Stephen G. Kobourov	[11] [13] [18]
15	Giuseppe Liotta	[4] [13]
16	Petra Mutzel	[13]
17	Maurizio Patrignani	[4] [9] [12] [15] [19]
18	Maurizio Pizzonia	[15]
19	Antonios Symvonis	[13]
20	Ioannis G. Tollis	[4]
21	Francesco Trotta	[4]
22	Katharina Anna Zweig (Katharina Anna Lehmann)	[4]