Patrizio Angelini

Patrizio Angelini

Home

Research groups:
  Graph Drawing

Publications:
  By type
  By year
  By topic

Teaching:
  Courses (Italian)
  Theses & Labs


Best Paper Award


42nd International Conference on Current Trends in Theory and Practice of Computer Science.
Harrachov, Czech Republic
Jan 23-28, 2016

We will be at


12nd Bertinoro Workshop on Graph Drawing

March 05-10, 2017

Show all news

Patrizio Angelini

    Postdoctoral Researcher

        
    angelinidia.uniroma3.it
    Regular mail:
    Office DIA-212
    Dipartimento di Ingegneria
    Università Roma Tre
    Via della Vasca Navale, 79
    00146, Rome, Italy
    Phone: +39-06-57333215
    Fax: +39-06-57333612

    Bio Sketch

    Patrizio Angelini received the "Laurea" Bachelor degree in 2003 and the "Laurea Magistrale" Master degree in 2006 in Computer Science Engineering at Roma Tre University, and a Ph.D. in Computer Science from the same institution in 2010. He is currently a Postdoc fellow at the Department of Engineering of Roma Tre University.

    His main research interests are on Graph Algorithms, with particular focus on Graph Drawing and Network Visualization, Combinatorial Optimization, and Computational Geometry.

    He published more than 15 journal articles and more than 30 papers in reviewed international conferences.

    He participated in the following projects:

    • 2004 - 2007: DELIS, (Dynamically Evolving, Large Scale Information Systems) funded by European Community (6th Framework Program, Future and Emerging Technologies, Information Society Technologies)
    • 2007 - 2009: MAINSTREAM (Algorithms for Massive Information Structures and Data Streams) funded by MIUR (PRIN06)
    • 2010 - 2012: AlgoDEEP (Algorithmic challenges for Data-intensivE processing on Emerging computing Platforms) funded by MIUR (PRIN08)
    • 2010 - 2013: GraDr (Graph Drawing and Representation) funded by ESF EUROCORES EuroGIGA Programme of European Science Foundation
    • 2012 - 2014: LEONE (From global measurements to local management) funded by EU FP7 STREP of European Commission
    • 2014 - 2017: AMANDA (Algorithmics for MAssive and Networked DAta) funded by MIUR (PRIN12)

    He was Program Committee member of the following conferences:

    • The 22nd International Symposium on Graph Drawing (GD 2014)

    He was appointed as main teacher for the course Tecniche Algoritmiche per Grafi e Reti in 2010/2011 and as teaching assistant for the courses Tecniche Algoritmiche per Grafi e Reti in 2009/2010, Informatica Teorica from 2006 to 2014, and Information Visualization in 2013/2014. He supervised as a co-tutor several bachelor and master students and he participated to several Master and Bachelor degree committees.

    Current teachings (pages in Italian):

    Current co-tutored theses :

    • Davide Ceneda: Algoritmi ed Euristiche per la Visualizzazione di un Morphing Topologico Efficiente tra Embedding di un Grafo.

    Past co-tutored theses :

    • Marco Di Bartolomeo: Visualizzazione di grafi multi-livello: progetto e realizzazione di un algoritmo per il problema del Book-Embedding vincolato.
    • Lorenzo Antonetti Clarucci: La Ribbon Representation: Un nuovo modello di visualizzazione di flussi e sue applicazioni.
    • Roberto Sepe: Visualizzazione tridimensionale del routing interdominio.
    • Vincenzo Roselli: Animazione di grafi: Morphing di strutture planari.
    • Domenico Pastore: Visualizzazione di strutture doppiamente gerarchiche.
    • Enrico Colasante: Disegni Monotoni di grafi planari.
    • Alessio Terisgni: Visualizzazione della trasformazione di disegni di grafi su mappe geografiche.

    Recent Publications

    • 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. 21(4):731-755. 2017.

    • Patrizio Angelini, Giordano Da 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.

    • Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter. On the Relationship between k-Planar and k-Quasi Planar Graphs. In 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Eindhoven, The Netherlands, June 21-23, 2017, 2017. To appear.

    • Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter. On the Relationship between k-Planar and k-Quasi Planar Graphs. In (Informal) Proceedings of the 33rd European Workshop on Computational Geometry, Malmo, Sweden, April 5-7, 2017, 2017. To appear.

    • Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. How to morph planar graph drawings. SIAM Journal on Computing. 46(2):824-852. 2017. [arXiv version]

    Display all publications [by type] [by year] [by topic]