Patrizio Angelini
Patrizio Angelini
John Cabot University
Verified email at dia.uniroma3.it - Homepage
Title
Cited by
Cited by
Year
Testing planarity of partially embedded graphs
P Angelini, GD Battista, F Frati, V Jelínek, J Kratochvíl, M Patrignani, ...
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
652010
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
522012
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
502015
Monotone drawings of graphs
P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani
International Symposium on Graph Drawing, 13-24, 2010
472010
An Algorithm to Construct Greedy Drawings of Triangulations.
P Angelini, F Frati, L Grilli
J. Graph Algorithms Appl. 14 (1), 19-51, 2010
442010
On a tree and a path with no geometric simultaneous embedding
P Angelini, M Geyer, M Kaufmann, D Neuwirth
International Symposium on Graph Drawing, 38-49, 2010
432010
An algorithm to construct greedy drawings of triangulations
P Angelini, F Frati, L Grilli
International Symposium on Graph Drawing, 26-37, 2008
432008
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
322017
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
322013
Strip planarity testing for embedded planar graphs
P Angelini, G Da Lozzo, G Di Battista, F Frati
Algorithmica 77 (4), 1022-1059, 2017
30*2017
Advancements on SEFE and partitioned book embedding problems
P Angelini, G Da Lozzo, D Neuwirth
Theoretical Computer Science 575, 71-89, 2015
30*2015
Monotone drawings of graphs with fixed embedding
P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ...
Algorithmica 71 (2), 233-257, 2015
272015
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
272011
Succinct greedy drawings do not always exist
P Angelini, G Di Battista, F Frati
Networks 59 (3), 267-274, 2012
262012
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
252015
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
252014
On the perspectives opened by right angle crossing drawings
P Angelini, L Cittadini, G Di Battista, W Didimo, F Frati, M Kaufmann, ...
International Symposium on Graph Drawing, 21-32, 2009
252009
Relaxing the constraints of clustered planarity
P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli
Computational Geometry 48 (2), 42-75, 2015
212015
Morphing planar graph drawings efficiently
P Angelini, F Frati, M Patrignani, V Roselli
International Symposium on Graph Drawing, 49-60, 2013
212013
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
202017
The system can't perform the operation now. Try again later.
Articles 1–20