Algorithms for Real-World Network Analysis
Real-world Graphs represent real relationships among things, actually millions/billions of things. Designing efficient algorithms able to deal with this huge amount of data is a continuous challenge.
As a matter of fact, in the last fifty years a large variety of enumeration problems have been considered, ranging from geometry problems to graph and hypergraph problems, from order and permutation problems to logic problems, and from set problems to string problems. Nevertheless, the research area of enumeration algorithms is still very active and still includes many interesting open problems.
Analysis and Enumeration
Algorithms for Biological Graphs. Click on the image to buy the book.
Born on June 1985. PhD in Computer Science at University of Florence, advised by Pierluigi Crescenzi. Assistant Professor (in italian, RTD-A) at University of Pisa working with the group of Roberto Grossi. Interested in Algorithms and Complexity, Complex Networks analysis, Bioinformatics, and Enumeration Algorithms. Member of the Laboratory of Algorithms, modelS, and Analysis of Graphs and NEtworks at University of Florence and member of Laboratory of Web Algorithmics at University of Milan.
Assistant Professor at University of Pisa, Dipartimento di Informatica
Our paper “Uncovering the Bitcoin blockchain: an analysis of the full users graph” has been accepted for publication at DSAA2016 (IEEE DSAA 2016, 3rd IEEE International Conference on Data Science and Advanced Analytics). Thanks to my coauthors: Damiano Di Francesco Maesa and Laura Ricci. Here below the abstract: Bitcoin is a novel decentralized cryptocurrency system[…]
I used this interactive book for the lectures of Laboratorio di Algoritmica, at University of Pisa, a.a. 2015-2016, to teach basic programming. I then used this other one to teach basic algorithms and data structures. These are shorten versions of the original books by Runestone Interactive. This version has been modified by me for the[…]
Our paper “Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques” has been presented at ICALP2016. Thanks to my coauthors: Alessio Conte, Roberto Grossi, and Luca Versari. Here below the abstract: Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This[…]
Here below the abstract of our new paper “Directing Road Networks by Listing Strong Orientations” presented at IWOCA2016. A connected road network with N nodes and L edges has K \leq L edges identified as one-way roads. In a feasible direction, these one-way roads are assigned a direction each, so that every node can reach[…]
Our paper “Listing Acyclic Orientations of Graphs with Single and Multiple Sources” has been accepted to be published at Latin American Theoretical Informatics Symposium, LATIN 2016 to be held in Ensenada, Mexico (April 11-15, 2016). The abstract follows. We study enumeration problems for the acyclic orientations of an undirected graph with n nodes and m[…]
Our paper “Clique Covering of Large Real-World Networks” has been accepted for publishing at 31st ACM Symposium on Applied Computing, that will be held in Pisa from 4th to 8th April 2016. Here the abstract is. The edge clique covering (ECC) problem deals with discovering a set of (possibly overlapping) cliques in a given network,[…]
Recently, I’ve found this nice web site that collects wrong proofs about P and NP relationship. https://www.win.tue.nl/~gwoegi/P-versus-NP.htm Currently there are 107 proofs. Probably, all of them are wrong (otherwise, probably we would know the guy) and the nice scoring function provided by Scott Aaranson here can be applied. This scoring function is the number of signs exhibited[…]
Our paper “Computing Top-k Closeness Centrality Faster in Unweighted Graphs” has been accepted for ALENEX 2016 (Algorithms Engineering and Experiments). Thanks to all the coauthors Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi and Henning Meyerhenke. This work is the result of a merge between our work (see here) and the work by Elisabetta and Henning. It’s a pleasure to start this new collaboration. This is the abstract[…]
It has been great year for the Italian Conference on Theoretical Computer Science. This 16th edition was in Florence and I was really happy to see several friends and nice people here. The conference has been hosted in a deconsecrated church owned by University of Florence. I passed many times in this street ignoring the presence[…]
Our paper about “Enumerating Cyclic Orientations of a Graph” will be presented at IWOCA2015 in Verona! Thanks to all my coauthors: Alessio Conte, Roberto Grossi, Romeo Rizzi. The abstract follows. Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge[…]