Dipartimento di Ingegneria
Università Roma Tre
Via della Vasca Navale, 79
00146, Rome, Italy
Phone: +39-06-57333233 Fax: +39-06-57333612
Maurizio Patrignani received the "Laurea" degree in Electronic Engineering at the University of Rome "La Sapienza" in 1996 and a Ph.D. in Computer Science from the same institution in 2001. He is currently Full Professor at the Department of Engineering of the Roma Tre University.
His current research interests include Computer Networks, Graph Drawing, Information Visualization, and Computational Geometry.
He published 25 articles in international journals and 48 papers in peer-reviewed international conferences in the above topics. He co-edited the Proceedings of the 16th International Symposium on Graph Drawing (GD 2008) and of the 20th International Symposium on Graph Drawing (GD 2012).
He participated in the following projects:
Nov 2002 - Jun 2006: MAIS (Multichannel Adaptive Information Systems) funded by MIUR-FIRB (Fondo per gli Investimenti della Ricerca di Base)
Dec 2002 - Nov 2004: ALINWEB (Algorithms for Internet and the Web) funded by MIUR (PRIN02).
Jan 2004 - Dec 2007: DELIS, (Dynamically Evolving, Large Scale Information Systems) funded by European Community (6th Framework Program, Future and Emerging Technologies, Information Society Technologies)
Dec 2004 - Dec 2006: ALGO-NEXT (Algorithms for the Next Generation Internet and Web: Methodologies, Design and Applications) funded by MIUR (PRIN04). In this project he coordinated the WorkPart 2 "Internet Algorithmics: Design and Experiments".
Feb 2007 - Feb 2009: MAINSTREAM (Algorithms for Massive Information Structures and Data Streams) funded by MIUR (PRIN06)
Mar 2010 - Mar 2012: AlgoDEEP (Algorithmic challenges for Data-intensivE processing on Emerging computing Platforms) funded by MIUR (PRIN08)
Jan 2011 - Jan 2014: GraDR (Graph Drawings and Representations) ESF EUROCORES EuroGIGA Programme
Nov 2012 - May 2015: LEONE (From global measurements to local management) funded by European Commission (EU FP7 STREP)
Mar 2014 - Mar 2017: AMANDA (Algorithmics for MAssive and Networked DAta) funded by MIUR (PRIN12)
In 2006 he was member of the Testing Committee of the Italian Authority for Information Technologies in Public Administration for the services provided in the OPA Framework Contracts and for the Qualified Exchange Network (QXN) within the multi-provider tender for the Public Connection System (SPC) of the Italian Public Administration. In 2008 he was member of the National Testing Committee of the Italian Worldwide Embassies and Consulates Computer Network (RIPA).
He was Program Committee member of the following conferences:
The 24th International Symposium on Graph Drawing & Network Visualization (GD 2016)
The Special session on Algorithm and Computation of the International Conference on Computational Intelligence in Information System (CIIS 2016)
The International Conference on Data Communication Networking (DCNET 2016; DCNET 2017). DCNET is part of ICETE, the International Joint Conference on e-Business and Telecommunications
He was member of the Organizing Committee of Graph Drawing 1997, 2003, 2008 (co-chair).
He taught many courses of Computer Science Fundamentals, Theory of Computing, Computer Networks, Algorithms and Data Structures, Information Visualization, and Information Systems at the Third University of Rome.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Intersection-Link Representations of Graphs. Journal of Graph Algorithms and Applications. 2017. To appear.
Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri. Efficiently Clustering Very Large Attributed Graphs. In, Jana Diesner, Elena Ferrari, Guandong Xu, editors, International Conference on Advances in Social Network Analysis and Mining (ASONAM 2017), 2017. To appear.
Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone. Fast Enumeration of Large k-Plexes. In, Tina Eliassi-Rad, Ravi Kumar, editors, 23rd SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2017), 2017. To appear.
Patrizio Angelini, Giordano Dal Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis. Algorithms and Bounds for L-Drawings of Directed Graphs. International Journal of Foundations of Computer Science (IJFCS). 2017. Accepted.