| Computing the types of the relationships between autonomous systems G Di Battista, M Patrignani, M Pizzonia INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and …, 2003 | 325* | 2003 |
| 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 | 171 | 2015 |
| Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers M Patrignani, IG Tollis Springer, 2009 | 168* | 2009 |
| Visual analysis of large graphs using (x, y)-clustering and hybrid visualizations V Batagelj, W Didimo, G Liotta, P Palladino, M Patrignani Pacific Visualization Symposium (PacificVis), 2010 IEEE, 209-216, 2010 | 94 | 2010 |
| Network and Parallel Computing W DIDIMO, M PATRIGNANI vol 5013, 19, 2008 | 89 | 2008 |
| Dynamic analysis of the autonomous system graph M Gaertler, M Patrignani IPS 2004, International Workshop on Inter-domain Performance and Simulation …, 2004 | 87 | 2004 |
| On extending a partial straight-line drawing M Patrignani Graph Drawing, 380-385, 2006 | 74 | 2006 |
| Orthogonal and quasi-upward drawings with vertices of prescribed size GD Battista, W Didimo, M Patrignani, M Pizzonia Proceedings of the 7th International Symposium on Graph Drawing, 310, 1999 | 74 | 1999 |
| Visualizing interdomain routing with BGPlay L Colitti, G Di Battista, F Mariani, M Patrignani, M Pizzonia Journal on Graph Algorithms and Applications, 2005 | 72 | 2005 |
| 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 | 69 | 2015 |
| 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 | 65 | 2010 |
| Fast enumeration of large k-plexes A Conte, D Firmani, C Mordente, M Patrignani, R Torlone Proceedings of the 23rd ACM SIGKDD international conference on knowledge …, 2017 | 62 | 2017 |
| 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 | 61 | 2012 |
| Clustering cycles into cycles of clusters P Cortese, G Di Battista, M Patrignani, M Pizzonia Graph Drawing, 100-110, 2005 | 59 | 2005 |
| The complexity of the matching-cut problem M Patrignani, M Pizzonia Graph-Theoretic Concepts in Computer Science, 284-295, 2001 | 59 | 2001 |
| On the complexity of orthogonal compaction M Patrignani Computational Geometry 19 (1), 47-67, 2001 | 54 | 2001 |
| Fan-planarity: Properties and complexity C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ... Theoretical Computer Science 589, 76-86, 2015 | 52 | 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 | 49 | 2017 |
| C-planarity of c-connected clustered graphs PF Cortese, G Di Battista, F Frati, M Patrignani, M Pizzonia J. Graph Alg. Appl 12 (2), 225-262, 2008 | 47 | 2008 |
| Finding all maximal cliques in very large social networks A Conte, R De Virgilio, A Maccioni, M Patrignani, R Torlone Advances in Database Technology-EDBT 2016, 173-184, 2016 | 45 | 2016 |
Giuseppe Di BattistaDipartimento di Ingegneria Universitŕ Roma TreVerified email at dia.uniroma3.it
