Maurizio Patrignani
Maurizio Patrignani
Professor of Computer Science, Roma Tre University
Verified email at dia.uniroma3.it - Homepage
Title
Cited by
Cited by
Year
Computing the types of the relationships between autonomous systems
G Di Battista, M Patrignani, M Pizzonia
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003
289*2003
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
289*2003
Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers
M Patrignani, IG Tollis
Springer, 2009
115*2009
Computing the types of the relationships between autonomous systems
G Di Battista, T Erlebach, A Hall, M Patrignani, M Pizzonia, T Schank
IEEE/ACM Transactions on networking 15 (2), 267-280, 2007
982007
Graph Drawing
IG Tollis, M Patrignani
LNCS 5417, 2009
852009
Dynamic analysis of the autonomous system graph
M Gaertler, M Patrignani
IPS 2004, International Workshop on Inter-domain Performance and Simulation …, 2004
802004
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
692010
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
682015
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
681999
Orthogonal and quasi-upward drawings with vertices of prescribed size
G Di Battista, W Didimo, M Patrignani, M Pizzonia
Graph Drawing, 297-310, 1999
681999
Visualizing interdomain routing with BGPlay
L Colitti, G Di Battista, F Mariani, M Patrignani, M Pizzonia
Journal on Graph Algorithms and Applications, 2005
642005
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
Network and Parallel Computing
W DIDIMO, M PATRIGNANI
vol 5515, 30, 2008
612008
On extending a partial straight-line drawing
M Patrignani
Graph Drawing, 380-385, 2006
612006
Clustering cycles into cycles of clusters
P Cortese, G Di Battista, M Patrignani, M Pizzonia
Graph Drawing, 100-110, 2005
522005
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
502012
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
452015
Monotone drawings of graphs
P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani
Graph Drawing, 13-24, 2011
452011
The complexity of the matching-cut problem
M Patrignani, M Pizzonia
Graph-Theoretic Concepts in Computer Science, 284-295, 2001
452001
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
442008
The system can't perform the operation now. Try again later.
Articles 1–20