Folgen
Fabrizio Frati
Fabrizio Frati
Associate Professor, Roma Tre University
Bestätigte E-Mail-Adresse bei dia.uniroma3.it - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
112*2015
An Algorithm to Construct Greedy Drawings of Triangulations.
P Angelini, F Frati, L Grilli
J. Graph Algorithms Appl. 14 (1), 19-51, 2010
882010
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
62*2012
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
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
542011
Increasing-chord graphs on point sets
HR Dehkordi, F Frati, J Gudmundsson
International Symposium on Graph Drawing, 464-475, 2014
48*2014
Monotone drawings of graphs
P Angelini, E Colasante, GD Battista, F Frati, M Patrignani
International Symposium on Graph Drawing, 13-24, 2010
462010
Small area drawings of outerplanar graphs
G Di Battista, F Frati
Algorithmica 54 (1), 25-53, 2009
46*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
462008
On the queue number of planar graphs
G Di Battista, F Frati, J Pach
SIAM Journal on Computing 42 (6), 2243-2285, 2013
442013
Embedding graphs simultaneously with fixed edges
F Frati
International Symposium on Graph Drawing, 108-113, 2006
432006
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
382017
Augmenting graphs to minimize the diameter
F Frati, S Gaspers, J Gudmundsson, L Mathieson
Algorithmica 72 (4), 995-1010, 2015
352015
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
A note on minimum-area straight-line drawings of planar graphs
F Frati, M Patrignani
International Symposium on Graph Drawing, 339-344, 2007
322007
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
Straight-line orthogonal drawings of binary and ternary trees
F Frati
International Symposium on Graph Drawing, 76-87, 2007
302007
Succinct greedy drawings do not always exist
P Angelini, G Di Battista, F Frati
Networks 59 (3), 267-274, 2012
282012
Constrained simultaneous and near-simultaneous embeddings
F Frati, M Kaufmann, S Kobourov
Journal of Graph Algorithms and Applications 13 (3), 447-465, 2009
282009
Morphing planar graph drawings optimally
P Angelini, GD Lozzo, GD Battista, F Frati, M Patrignani, V Roselli
International Colloquium on Automata, Languages, and Programming, 126-137, 2014
272014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20