485 citations · 1.2k across the 47 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.SI2017★ 12 cited
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…
cs.CY2017★ 485 cited
FA*IR: A Fair Top-k Ranking Algorithm
Meike Zehlike, Francesco Bonchi, Carlos Castillo +3
In this work, we define and solve the Fair Top-k Ranking problem, in which we want to determine a subset of k candidates from a large pool of n >> k candidates, maximizing utility…