57 citations · 140 across the 9 of their papers we have counts for
10 papers
The Power of Connection: Leveraging Network Analysis to Advance Receivable Financing
Ilaria Bordino, Francesco Gullo, Giacomo Legnaro
Receivable financing is the process whereby cash is advanced to firms against receivables their customers have yet to pay: a receivable can be sold to a funder, which immediately g…
Relevance of temporal cores for epidemic spread in temporal networks
Martino Ciaperoni, Edoardo Galimberti, Francesco Bonchi +3
Temporal networks are widely used to represent a vast diversity of systems, including in particular social interactions, and the spreading processes unfolding on top of them. The i…
Span-core Decomposition for Temporal Networks: Algorithms and Applications
Edoardo Galimberti, Martino Ciaperoni, Alain Barrat +3
When analyzing temporal networks, a fundamental task is the identification of dense structures (i.e., groups of vertices that exhibit a large number of links), together with their…
Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications
Edoardo Galimberti, Francesco Bonchi, Francesco Gullo +1
Multilayer networks are a powerful paradigm to model complex systems, where multiple relations occur between the same entities. Despite the keen interest in a variety of tasks, alg…
Probabilistic Causal Analysis of Social Influence
Francesco Bonchi, Francesco Gullo, Bud Mishra +1
Mastering the dynamics of social influence requires separating, in a database of information propagation traces, the genuine causal processes from temporal correlation, i.e., homop…
Mining (maximal) span-cores from temporal networks
Edoardo Galimberti, Alain Barrat, Francesco Bonchi +2
When analyzing temporal networks, a fundamental task is the identification of dense structures (i.e., groups of vertices that exhibit a large number of links), together with their…
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
We study the problem of extracting a selective connector for a given set of query vertices in a graph . A selective connector is a subgraph of which…
Conditional Reliability in Uncertain Graphs
Arijit Khan, Francesco Bonchi, Francesco Gullo +1
Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i…
The Minimum Wiener Connector
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector:…
Uncertain Centroid based Partitional Clustering of Uncertain Data
Francesco Gullo, Andrea Tagarelli
Clustering uncertain data has emerged as a challenging task in uncertain data management and mining. Thanks to a computational complexity advantage over other clustering paradigms,…