activity
20102023
most citedFA*IR: A Fair Top-k Ranking Algorithm

485 citations · 1.2k across the 47 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

cs.DS2018★ 4 cited

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★ 2 cited

Finding events in temporal networks: Segmentation meets densest-subgraph discovery

Polina Rozenshtein, Francesco Bonchi, Aristides Gionis +2

In this paper we study the problem of discovering a timeline of events in a temporal network. We model events as dense subgraphs that occur within intervals of network activity. We…

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★ 57 cited

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…

cs.DS2018

Fair-by-design matching

David García-Soriano, Francesco Bonchi

Matching algorithms are used routinely to match donors to recipients for solid organs transplantation, for the assignment of medical residents to hospitals, record linkage in datab…