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[…]
I have participated to the first annual PhD event in Computer Science research, hosted by the Department of Computer Science of the University of Pisa. This is the website. It has been a very nice event, full of interesting short presentations of past and current PhD students. As Luca and Alessio (which are respectively current[…]
Our work “Discovering k-Trusses in Large-Scale Network” has been finalist at the MIT GraphChallenge. Joint work of Alessio Conte (NII Tokyo), Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari (Universita di Pisa). Here you can find the and the details of the competition.
Alessio and me presented our papers at KDD 2018 in London. It has been a very huge event. My first social dinner with more than 3 thousands sit participants. The first paper is a joint work with Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, and Luca Versari, with title “D2K: Scalable Community[…]
Our paper “Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search” has been presented by Roberto at COCOON 2018. Joint work with Alessio Conte, Roberto Grossi, and Luca Versari.
Our paper “Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts” has been presented by Luca at WG 2018. Joint work with Alessio Conte, Roberto Grossi, Romeo Rizzi, Takeaki Uno, Luca Versari.
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[…]
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[…]