Fabrizio Frati

	2012
55		Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood: Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours CoRR abs/1202.1569: (2012)
54		Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012)
53		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Succinct greedy drawings do not always exist. Networks 59(3): 267-274 (2012)
	2011
52		Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas: On the Page Number of Upward Planar Directed Acyclic Graphs. Graph Drawing 2011: 391-402
51		Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug: Orthogeodesic Point-Set Embedding of Trees. Graph Drawing 2011: 52-63
50		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Simultaneous Embedding of Embedded Planar Graphs. ISAAC 2011: 271-280
49		Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella: On the Area Requirements of Euclidean Minimum Spanning Trees. WADS 2011: 25-36
48		Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, 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 and Universal Pointsets. Algorithmica 60(3): 569-592 (2011)
47		Fabrizio Frati, Michael Kaufmann: Polynomial area bounds for MST embeddings of trees. Comput. Geom. 44(9): 529-543 (2011)
46		Patrizio Angelini, Fabrizio Frati, Michael Kaufmann: Straight-Line Rectangular Drawings of Clustered Graphs. Discrete & Computational Geometry 45(1): 88-140 (2011)
45		Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011)
	2010
44		Giuseppe Di Battista, Fabrizio Frati, János Pach: On the Queue Number of Planar Graphs. FOCS 2010: 365-374
43		Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. Graph Drawing 2010: 13-24
42		Fabrizio Frati: Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. Graph Drawing 2010: 220-225
41		Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Geometric Graph Embeddings into Point Sets. Graph Drawing 2010: 25-37
40		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter: Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. IWOCA 2010: 212-225
39		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter: Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221
38		Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi: Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8
37		Patrizio Angelini, Fabrizio Frati: Acyclically 3-Colorable Planar Graphs. WALCOM 2010: 113-124
36		Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta: Upward straight-line embeddings of directed graphs into point sets. Comput. Geom. 43(2): 219-232 (2010)
35		Fabrizio Frati: Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discrete Mathematics & Theoretical Computer Science 12(5): 139-174 (2010)
34		Fabrizio Frati: A note on isosceles planar graph drawing. Inf. Process. Lett. 110(12-13): 507-509 (2010)
33		Patrizio Angelini, Fabrizio Frati, Luca Grilli: An Algorithm to Construct Greedy Drawings of Triangulations. J. Graph Algorithms Appl. 14(1): 19-51 (2010)
	2009
32		Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta: On Directed Graphs with an Upward Straight-line. CCCG 2009: 21-24
31		Fabrizio Frati: Planar Packing of Diameter-Four Trees. CCCG 2009: 95-98
30		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Succinct Greedy Drawings Do Not Always Exist. Graph Drawing 2009: 171-182
29		Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. Graph Drawing 2009: 21-32
28		Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani: Splitting Clusters to Get C-Planarity. Graph Drawing 2009: 57-68
27		Patrizio Angelini, Fabrizio Frati, Michael Kaufmann: Straight-Line Rectangular Drawings of Clustered Graphs. WADS 2009: 25-36
26		Giuseppe Di Battista, Fabrizio Frati: Small Area Drawings of Outerplanar Graphs. Algorithmica 54(1): 25-53 (2009)
25		Fabrizio Frati, Markus Geyer, Michael Kaufmann: Planar packing of trees and spider trees. Inf. Process. Lett. 109(6): 301-307 (2009)
24		Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati: How to draw a clustered tree. J. Discrete Algorithms 7(4): 479-499 (2009)
23		Giuseppe Di Battista, Fabrizio Frati: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. J. Graph Algorithms Appl. 13(3): 349-378 (2009)
22		Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov: Constrained Simultaneous and Near-Simultaneous Embeddings. J. Graph Algorithms Appl. 13(3): 447-465 (2009)
21		Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory Comput. Syst. 44(2): 143-159 (2009)
	2008
20		Patrizio Angelini, Fabrizio Frati, Luca Grilli: An Algorithm to Construct Greedy Drawings of Triangulations. Graph Drawing 2008: 26-37
19		Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Non-convex Representations of Graphs. Graph Drawing 2008: 390-395
18		Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov: Upward Straight-Line Embeddings of Directed Graphs into Point Sets. WG 2008: 122-133
17		Fabrizio Frati: A Lower Bound on the Area Requirements of Series-Parallel Graphs. WG 2008: 159-170
16		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		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		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		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		Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov: Constrained Simultaneous and Near-Simultaneous Embeddings. Graph Drawing 2007: 268-279
10		Giuseppe Di Battista, Fabrizio Frati: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Graph Drawing 2007: 291-302
9		Fabrizio Frati, Maurizio Patrignani: A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. Graph Drawing 2007: 339-344
8		Fabrizio Frati: Straight-Line Orthogonal Drawings of Binary and Ternary Trees. Graph Drawing 2007: 76-87
7		Fabrizio Frati, Markus Geyer, Michael Kaufmann: Packing and Squeezing Subgraphs into Planar Graphs. MFCS 2007: 394-405
6		Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati: How to Draw a Clustered Tree. WADS 2007: 89-101
5		Fabrizio Frati: On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. WG 2007: 133-144
	2006
4		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		Fabrizio Frati: Embedding Graphs Simultaneously with Fixed Edges. Graph Drawing 2006: 108-113
2		Fabrizio Frati, Giuseppe Di Battista: Three-Dimensional Drawings of Bounded Degree Trees. Graph Drawing 2006: 89-94
	2005
1		Giuseppe Di Battista, Fabrizio Frati: Small Area Drawings of Outerplanar Graphs. Graph Drawing 2005: 89-100

Coauthor Index

1	Patrizio Angelini	[20] [27] [28] [29] [30] [33] [37] [39] [40] [41] [43] [45] [46] [49] [50] [53] [54]
2	Giuseppe Di Battista	[1] [2] [4] [6] [10] [12] [15] [19] [21] [23] [24] [26] [29] [30] [39] [40] [43] [44] [45] [50] [53] [54]
3	Carla Binucci	[32] [36]
4	Ulrik Brandes	[13] [48]
5	Till Bruckdorfer	[49]
6	Marco Chiesa	[49]
7	Luca Cittadini	[29] [45]
8	Enrico Colasante	[43] [54]
9	Pier Francesco Cortese	[4] [15]
10	Walter Didimo	[29] [32] [36] [45]
11	Guido Drovandi	[6] [24]
12	Vida Dujmovic	[55]
13	Cesim Erten	[13] [48]
14	Alejandro Estrella-Balderrama	[18] [32] [36] [48]
15	J. Joseph Fowler	[13] [48]
16	Jacob Fox	[38]
17	Radoslav Fulek	[51] [52]
18	Markus Geyer	[7] [13] [25] [41] [48]
19	Emilio Di Giacomo	[32] [36] [51]
20	Luca Grilli	[4] [20] [33] [51]
21	Carsten Gutwenger	[13] [48]
22	Seok-Hee Hong	[13] [48]
23	Vít Jelínek (Vítek Jelínek)	[39]
24	Gwenaël Joret	[55]
25	Michael Kaufmann	[7] [11] [13] [22] [25] [27] [29] [41] [45] [46] [47] [48] [49]
26	Stephen G. Kobourov	[11] [13] [18] [22] [32] [36] [48]
27	Jan Kratochvíl	[39]
28	Marcus Krug	[51]
29	Giuseppe Liotta	[4] [13] [32] [36] [48]
30	Tamara Mchedlidze	[41]
31	Petra Mutzel	[13] [48]
32	János Pach	[38] [44]
33	Maurizio Patrignani	[4] [9] [12] [15] [19] [21] [28] [39] [40] [43] [54]
34	Rom Pinchasi	[38]
35	Maurizio Pizzonia	[15]
36	Andres J. Ruiz-Vargas	[52]
37	Ignaz Rutter	[39] [40]
38	Claudio Squarcella	[49]
39	Antonios Symvonis	[13] [29] [41] [45] [48]
40	Ioannis G. Tollis	[4]
41	Francesco Trotta	[4]
42	David R. Wood	[55]
43	Katharina Anna Zweig (Katharina Anna Lehmann)	[4]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page