| Bitconeview: visualization of flows in the bitcoin transaction graph G Di Battista, V Di Donato, M Patrignani, M Pizzonia, V Roselli, ... 2015 IEEE symposium on visualization for cyber security (VizSec), 1-8, 2015 | 165 | 2015 |
| 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 | 50 | 2017 |
| 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 | 37 | 2013 |
| 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 | 32 | 2015 |
| 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 | 31 | 2014 |
| Monotone drawings of graphs with fixed embedding P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ... Algorithmica 71, 233-257, 2015 | 27 | 2015 |
| Morphing planar graph drawings efficiently P Angelini, F Frati, M Patrignani, V Roselli Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France …, 2013 | 27 | 2013 |
| Optimal morphs of convex drawings P Angelini, G Da Lozzo, F Frati, A Lubiw, M Patrignani, V Roselli arXiv preprint arXiv:1503.09021, 2015 | 24 | 2015 |
| 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 | 22 | 2015 |
| Small point sets for simply-nested planar graphs P Angelini, G Di Battista, M Kaufmann, T Mchedlidze, V Roselli, ... International Symposium on Graph Drawing, 75-85, 2011 | 20 | 2011 |
| Vertex-coloring with defects P Angelini, M Bekos, F De Luca, W Didimo, M Kaufmann, S Kobourov, ... Journal of Graph Algorithms and Applications 21 (3), 313-340, 2017 | 19 | 2017 |
| Upward planar morphs G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli Algorithmica 82 (10), 2985-3017, 2020 | 17 | 2020 |
| LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs F Frati, M Patrignani, V Roselli Journal of Computer and System Sciences 107, 28-53, 2020 | 13 | 2020 |
| Anchored drawings of planar graphs P Angelini, G Da Lozzo, M Di Bartolomeo, G Di Battista, SH Hong, ... International Symposium on Graph Drawing, 404-415, 2014 | 13 | 2014 |
| Algorithms and bounds for L-drawings of directed graphs P Angelini, GD Lozzo, MD Bartolomeo, VD Donato, M Patrignani, ... International Journal of Foundations of Computer Science 29 (04), 461-480, 2018 | 11 | 2018 |
| Drawing planar graphs with many collinear vertices G Da Lozzo, V Dujmović, F Frati, T Mchedlidze, V Roselli Journal of Computational Geometry 9 (1), 94–130-94–130, 2018 | 10 | 2018 |
| Monotone drawings of graphs with fixed embedding P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ... International Symposium on Graph Drawing, 379-390, 2011 | 10 | 2011 |
| How to morph a tree on a small grid F Barrera-Cruz, M Borrazzo, G Da Lozzo, G Di Battista, F Frati, ... Discrete & Computational Geometry 67 (3), 743-786, 2022 | 9 | 2022 |
| Upward planar morphs G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli International Symposium on Graph Drawing and Network Visualization, 92-105, 2018 | 8 | 2018 |
| An exact algorithm for a multicommodity min-cost flow over time problem E Grande, G Nicosia, A Pacifici, V Roselli Electronic Notes in Discrete Mathematics 64, 125-134, 2018 | 8 | 2018 |
Patrizio AngeliniJohn Cabot University在 dia.uniroma3.it 的电子邮件经过验证
