Sledovat
Fabrizio Frati
Fabrizio Frati
Full Professor, Roma Tre University
E-mailová adresa ověřena na: dia.uniroma3.it - Domovská stránka
Název
Citace
Citace
Rok
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), 1-42, 2015
122*2015
An Algorithm to Construct Greedy Drawings of Triangulations.
P Angelini, F Frati, L Grilli
J. Graph Algorithms Appl. 14 (1), 19-51, 2010
912010
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
622012
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
572011
On the queue number of planar graphs
G Di Battista, F Frati, J Pach
SIAM Journal on Computing 42 (6), 2243-2285, 2013
552013
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
492017
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
472008
Embedding graphs simultaneously with fixed edges
F Frati
International Symposium on Graph Drawing, 108-113, 2006
462006
Monotone drawings of graphs
P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani
International Symposium on Graph Drawing, 13-24, 2010
452010
Small area drawings of outerplanar graphs
G Di Battista, F Frati
Algorithmica 54, 25-53, 2009
452009
Augmenting graphs to minimize the diameter
F Frati, S Gaspers, J Gudmundsson, L Mathieson
Algorithmica 72, 995-1010, 2015
422015
Intersection-link representations of graphs
P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter
Journal of Graph Algorithms and Applications 21 (4), 731-755, 2017
402017
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
372013
Strip planarity testing for embedded planar graphs
P Angelini, G Da Lozzo, G Di Battista, F Frati
Algorithmica 77, 1022-1059, 2017
34*2017
Increasing-chord graphs on point sets
HR Dehkordi, F Frati, J Gudmundsson
International Symposium on Graph Drawing, 464-475, 2014
342014
Stack and queue layouts via layered separators
V Dujmović, F Frati
International Symposium on Graph Drawing and Network Visualization, 511-518, 2016
332016
A note on minimum-area straight-line drawings of planar graphs
F Frati, M Patrignani
Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008
322008
Computing NodeTrix representations of clustered graphs
G Da Lozzo, G Di Battista, F Frati, M Patrignani
International Symposium on Graph Drawing and Network Visualization, 107-120, 2016
312016
Drawing partially embedded and simultaneously planar graphs
T Chan, F Frati, C Gutwenger, A Lubiw, P Mutzel, M Schaefer
Journal of Graph Algorithms and Applications 19 (2), 681-706, 2015
312015
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20