124 citations · 188 across the 7 of their papers we have counts for
9 papers
Dense and well-connected subgraph detection in dual networks
Tianyi Chen, Francesco Bonchi, David Garcia-Soriano +2
Dense subgraph discovery is a fundamental problem in graph mining with a wide range of applications \cite{gionis2015dense}. Despite a large number of applications ranging from comp…
Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints
David Garcia-Soriano, Francesco Bonchi
We study a novel problem of fairness in ranking aimed at minimizing the amount of individual unfairness introduced when enforcing group-fairness constraints. Our proposal is rooted…
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…
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…
The Power of Both Choices: Practical Load Balancing for Distributed Stream Processing Engines
Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano +2
We study the problem of load balancing in distributed stream processing engines, which is exacerbated in the presence of skew. We introduce Partial Key Grouping (PKG), a new stream…
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:…
Validation of Matching
Ya Le, Eric Bax, Nicola Barbieri +3
We introduce a technique to compute probably approximately correct (PAC) bounds on precision and recall for matching algorithms. The bounds require some verified matches, but those…
Local correlation clustering
Francesco Bonchi, David García-Soriano, Konstantin Kutzkov
Correlation clustering is perhaps the most natural formulation of clustering. Given objects and a pairwise similarity measure, the goal is to cluster the objects so that, to th…
The non-adaptive query complexity of testing k-parities
Harry Buhrman, David Garcia-Soriano, Arie Matsliah +1
We prove tight bounds of Theta(k log k) queries for non-adaptively testing whether a function f:{0,1}^n -> {0,1} is a k-parity or far from any k-parity. The lower bound combines a…