activity
20172020
most citedTo Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem

12 citations · 17 across the 2 of their papers we have counts for

collaborators

7 papers

cs.DS20205 cited

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…

physics.soc-ph2020

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…

cs.DS2019

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…

cs.DS2018

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…

cs.SI2018

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…

cs.SI2018

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…