Teaching Python

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



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



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


Enumeration Catalogue

Some months ago, a very nice web page came out. I am talking about the catalogue of enumeration algorithms by Kunihiro Wasa. There you can find an “Enumeration of Enumeration Algorithms and Its Complexity”. For each class of the followings: Geometry Graph Hypergraph Matroid Order Other Permutation SAT Set String several enumeration problems are enumerated. For[…]