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