Fabrizio Frati
Fabrizio Frati
Associate Professor, Roma Tre University
Verified email at dia.uniroma3.it - Homepage
Title
Cited by
Cited by
Year
Testing planarity of partially embedded graphs
P Angelini, G Di Battista, F Frati, V Jelínek, J Kratochvíl, M Patrignani, ...
ACM Transactions on Algorithms (TALG) 11 (4), 32, 2015
109*2015
An Algorithm to Construct Greedy Drawings of Triangulations.
P Angelini, F Frati, L Grilli
J. Graph Algorithms Appl. 14 (1), 19-51, 2010
852010
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
G Di Battista, F Frati
J. Graph Algorithms Appl. 13 (3), 30, 2009
602009
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
P Angelini, G Di Battista, F Frati, M Patrignani, I Rutter
Journal of Discrete Algorithms 14, 150-172, 2012
59*2012
On the Perspectives Opened by Right Angle Crossing Drawings.
P Angelini, L Cittadini, W Didimo, F Frati, G Di Battista, M Kaufmann, ...
J. Graph Algorithms Appl. 15 (1), 53-78, 2011
512011
Monotone drawings of graphs
P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani
International Symposium on Graph Drawing, 13-24, 2010
472010
Small area drawings of outerplanar graphs
G Di Battista, F Frati
Algorithmica 54 (1), 25-53, 2009
45*2009
C-Planarity of C-Connected Clustered Graphs.
PF Cortese, G Di Battista, F Frati, M Patrignani, M Pizzonia
J. Graph Algorithms Appl. 12 (2), 225-262, 2008
452008
Increasing-chord graphs on point sets
HR Dehkordi, F Frati, J Gudmundsson
International Symposium on Graph Drawing, 464-475, 2014
44*2014
On the queue number of planar graphs
G Di Battista, F Frati, J Pach
SIAM Journal on Computing 42 (6), 2243-2285, 2013
432013
Embedding graphs simultaneously with fixed edges
F Frati
International Symposium on Graph Drawing, 108-113, 2006
412006
How to morph planar graph drawings
S Alamdari, P Angelini, F Barrera-Cruz, TM Chan, GD Lozzo, GD Battista, ...
SIAM Journal on Computing 46 (2), 824-852, 2017
362017
Morphing planar graph drawings with a polynomial number of steps
S Alamdari, P Angelini, TM Chan, G Di Battista, F Frati, A Lubiw, ...
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
342013
Strip planarity testing for embedded planar graphs
P Angelini, G Da Lozzo, G Di Battista, F Frati
Algorithmica 77 (4), 1022-1059, 2017
31*2017
Augmenting graphs to minimize the diameter
F Frati, S Gaspers, J Gudmundsson, L Mathieson
Algorithmica 72 (4), 995-1010, 2015
312015
A note on minimum-area straight-line drawings of planar graphs
F Frati, M Patrignani
International Symposium on Graph Drawing, 339-344, 2007
312007
Straight-line orthogonal drawings of binary and ternary trees
F Frati
International Symposium on Graph Drawing, 76-87, 2007
292007
Morphing planar graph drawings optimally
P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli
International Colloquium on Automata, Languages, and Programming, 126-137, 2014
282014
Intersection-Link Representations of Graphs.
P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter
J. Graph Algorithms Appl. 21 (4), 731-755, 2017
272017
The importance of being proper:(in clustered-level planarity and T-level planarity)
P Angelini, G Da Lozzo, G Di Battista, F Frati, V Roselli
Theoretical Computer Science 571, 1-9, 2015
272015
The system can't perform the operation now. Try again later.
Articles 1–20