Fabrizio Frati
Fabrizio Frati
Associate Professor, Roma Tre University
Подтвержден адрес электронной почты в домене dia.uniroma3.it - Главная страница
Название
Процитировано
Процитировано
Год
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
94*2015
An Algorithm to Construct Greedy Drawings of Triangulations.
P Angelini, F Frati, L Grilli
J. Graph Algorithms Appl. 14 (1), 19-51, 2010
842010
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
54*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
542009
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
442011
Monotone drawings of graphs
P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani
International Symposium on Graph Drawing, 13-24, 2010
442010
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
432008
Small area drawings of outerplanar graphs
G Di Battista, F Frati
Algorithmica 54 (1), 25-53, 2009
42*2009
Embedding graphs simultaneously with fixed edges
F Frati
International Symposium on Graph Drawing, 108-113, 2006
392006
Increasing-chord graphs on point sets
HR Dehkordi, F Frati, J Gudmundsson
International Symposium on Graph Drawing, 464-475, 2014
36*2014
On the queue number of planar graphs
G Di Battista, F Frati, J Pach
SIAM Journal on Computing 42 (6), 2243-2285, 2013
352013
A note on minimum-area straight-line drawings of planar graphs
F Frati, M Patrignani
International Symposium on Graph Drawing, 339-344, 2007
292007
Strip planarity testing for embedded planar graphs
P Angelini, G Da Lozzo, G Di Battista, F Frati
Algorithmica 77 (4), 1022-1059, 2017
28*2017
Augmenting graphs to minimize the diameter
F Frati, S Gaspers, J Gudmundsson, L Mathieson
Algorithmica 72 (4), 995-1010, 2015
262015
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
262013
Constrained simultaneous and near-simultaneous embeddings
F Frati, M Kaufmann, S Kobourov
262009
Succinct greedy drawings do not always exist
P Angelini, G Di Battista, F Frati
Networks 59 (3), 267-274, 2012
252012
Colored Simultaneous Geometric Embeddings and Universal Pointsets
U Brandes, C Erten, A Estrella-Balderrama, JJ Fowler, F Frati, M Geyer, ...
Algorithmica, 1-24, 2011
25*2011
Straight-line orthogonal drawings of binary and ternary trees
F Frati
International Symposium on Graph Drawing, 76-87, 2007
252007
Nonrepetitive Colourings of Planar Graphs with Colours
V Dujmović, G Joret, F Frati, DR Wood
the electronic journal of combinatorics, P51-P51, 2013
232013
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20