firenze-1272592_1920

Moving to Florence

I just moved to Florence. I am now member of the DiSIA (Dipartimento di Sistemi, Informatica e Applicazioni). I am very excited of the new adventure. I will teach Programming (Python) to Statisticians and Advanced Algorithms and Graph Mining in the Computer Science Master. I am very grateful to the Department of Computer Science in[…]

Beatles_duomo

MFCS2018

I have presented the paper “Listing Subgraphs by Cartesian Decomposition” at MFCS 2018 in Liverpool, joint work with Alessio Conte, Roberto Grossi, Romeo Rizzi, and Luca Versari. It has been a great conference. Below the abstract of our paper. We investigate a decomposition technique for listing problems in graphs and set systems. It is based[…]

dsaa2016_750

DSAA2016

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[…]

cm1sevfweaav-xz

ICALP2016

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[…]

cropped-Ensenada-at-night11

LATIN2016

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[…]

ALENEX16

ALENEX2016

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[…]