Adventures in Computer Science (and other stories)

HIGHLIGHT

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.

Enumeration Algorithms

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.

About Me

Some Info

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. Past member as Post-doc of the Laboratory of Web Algorithmics of University of Milan. Interested in Algorithms and Complexity, Complex Networks analysis, Bioinformatics, and Enumeration Algorithms.

Now

Assistant Professor at University of Pisa, Dipartimento di Informatica

Latest news

Our paper on “Efficient Algorithms for Listing K Disjoint st-Paths in Graphs” has been accepted for LATIN 2018, which will be held in Buenos Aires. Thanks to my coauthors Roberto Grossi and Luca Versari. Given a connected graph G of m edges and n vertices, we consider the basic problem of listing all the choices[…]

Our journal paper on “Efficient enumeration of graph orientations with sources” is out on Discrete Applied Mathematics (available online since 24 August 2017). This is the result of the joint work with Alessio, Roberto, and Romeo about listing acyclic or cyclic orientation. An orientation of an undirected graph is obtained by assigning a direction to[…]

I have presented our paper on “Listing Maximal Independent Sets with Minimal Space and Bounded Delay” at SPIRE 2017. The conference has been great! The paper has been a joint work with Alessio Conte, Roberto Grossi, Takeaki Uno and Luca Versari. Below the abstract. An independent set is a set of nodes in a graph[…]

Our papers about “strange” transactions in Bitcoin Users Graph have been published. Congratulations to my coauthors Damiano di Francesco Maesa and Laura Ricci. A preliminar version appeared at COMPLEX NETWORK 2016, while the final version is now published on Journal Online Social Networks and Media. Here is the abstract: A unique feature of cryptocurrencies such[…]

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

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