Patrizio Angelini

	2012
25		Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth: On a Tree and a Path with no Geometric Simultaneous Embedding. J. Graph Algorithms Appl. 16(1): 37-83 (2012)
24		Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012)
23		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Succinct greedy drawings do not always exist. Networks 59(3): 267-274 (2012)
	2011
22		Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath: Monotone Drawings of Graphs with Fixed Embedding. Graph Drawing 2011: 379-390
21		Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella: Small Point Sets for Simply-Nested Planar Graphs. Graph Drawing 2011: 75-85
20		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Simultaneous Embedding of Embedded Planar Graphs. ISAAC 2011: 271-280
19		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
18		Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani: Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. Algorithmica 60(4): 890-937 (2011)
17		Patrizio Angelini, Fabrizio Frati, Michael Kaufmann: Straight-Line Rectangular Drawings of Clustered Graphs. Discrete & Computational Geometry 45(1): 88-140 (2011)
16		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
15		Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. Graph Drawing 2010: 13-24
14		Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Geometric Graph Embeddings into Point Sets. Graph Drawing 2010: 25-37
13		Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth: On a Tree and a Path with No Geometric Simultaneous Embedding. Graph Drawing 2010: 38-49
12		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
11		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
10		Patrizio Angelini, Fabrizio Frati: Acyclically 3-Colorable Planar Graphs. WALCOM 2010: 113-124
9		Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth: On a Tree and a Path with no Geometric Simultaneous Embedding CoRR abs/1001.0555: (2010)
8		Patrizio Angelini, Fabrizio Frati, Luca Grilli: An Algorithm to Construct Greedy Drawings of Triangulations. J. Graph Algorithms Appl. 14(1): 19-51 (2010)
	2009
7		Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Succinct Greedy Drawings Do Not Always Exist. Graph Drawing 2009: 171-182
6		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
5		Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani: Splitting Clusters to Get C-Planarity. Graph Drawing 2009: 57-68
4		Patrizio Angelini, Fabrizio Frati, Michael Kaufmann: Straight-Line Rectangular Drawings of Clustered Graphs. WADS 2009: 25-36
	2008
3		Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani: Topological Morphing of Planar Graphs. Graph Drawing 2008: 145-156
2		Patrizio Angelini, Fabrizio Frati, Luca Grilli: An Algorithm to Construct Greedy Drawings of Triangulations. Graph Drawing 2008: 26-37
	2007
1		Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani: Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. WADS 2007: 287-299

Coauthor Index

1	Giuseppe Di Battista	[1] [3] [6] [7] [11] [12] [15] [16] [18] [20] [21] [23] [24]
2	Till Bruckdorfer	[19]
3	Marco Chiesa	[19]
4	Luca Cittadini	[6] [16]
5	Enrico Colasante	[15] [24]
6	Pier Francesco Cortese	[3]
7	Walter Didimo	[6] [16] [22]
8	Fabrizio Frati	[2] [4] [5] [6] [7] [8] [10] [11] [12] [14] [15] [16] [17] [19] [20] [23] [24]
9	Markus Geyer	[9] [13] [14] [25]
10	Luca Grilli	[2] [8]
11	Vít Jelínek (Vítek Jelínek)	[11]
12	Michael Kaufmann	[4] [6] [9] [13] [14] [16] [17] [19] [21] [25]
13	Stephen G. Kobourov	[22]
14	Jan Kratochvíl	[11]
15	Tamara Mchedlidze	[14] [21] [22]
16	Daniel Neuwirth	[9] [13] [25]
17	Maurizio Patrignani	[1] [3] [5] [11] [12] [15] [18] [24]
18	Vincenzo Roselli	[21] [22]
19	Ignaz Rutter	[11] [12]
20	Claudio Squarcella	[19] [21]
21	Antonios Symvonis	[6] [14] [16] [22]
22	Stephen K. Wismath	[22]

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page