Spremljaj
Patrizio Angelini
Patrizio Angelini
John Cabot University
Preverjeni e-poštni naslov na dia.uniroma3.it - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
672015
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
632010
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
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
502017
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
482010
An Algorithm to Construct Greedy Drawings of Triangulations.
P Angelini, F Frati, L Grilli
J. Graph Algorithms Appl. 14 (1), 19-51, 2010
482010
An algorithm to construct greedy drawings of triangulations
P Angelini, F Frati, L Grilli
International Symposium on Graph Drawing, 26-37, 2008
462008
Monotone drawings of graphs
P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani
International Symposium on Graph Drawing, 13-24, 2010
452010
Advancements on SEFE and partitioned book embedding problems
P Angelini, G Da Lozzo, D Neuwirth
Theoretical Computer Science 575, 71-89, 2015
43*2015
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
On the perspectives opened by right angle crossing drawings
P Angelini, L Cittadini, W Didimo, F Frati, G Di Battista, M Kaufmann, ...
Journal of Graph Algorithms and Applications 15 (1), 53-78, 2011
352011
Strip planarity testing for embedded planar graphs
P Angelini, G Da Lozzo, G Di Battista, F Frati
Algorithmica 77, 1022-1059, 2017
34*2017
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
342017
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
322015
Morphing planar graph drawings optimally
P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
312014
Multi-level Steiner trees
R Ahmed, P Angelini, FD Sahneh, A Efrat, D Glickenstein, M Gronemann, ...
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019
302019
Succinct greedy drawings do not always exist
P Angelini, G Di Battista, F Frati
Networks 59 (3), 267-274, 2012
302012
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
Morphing planar graph drawings efficiently
P Angelini, F Frati, M Patrignani, V Roselli
Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France …, 2013
272013
On the perspectives opened by right angle crossing drawings
P Angelini, L Cittadini, G Di Battista, W Didimo, F Frati, M Kaufmann, ...
Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA …, 2010
252010
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20