research
∙
12/06/2021
Dense and well-connected subgraph detection in dual networks
Dense subgraph discovery is a fundamental problem in graph mining with a...
share
research
∙
06/16/2021
Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints
We study a novel problem of fairness in ranking aimed at minimizing the ...
research
∙
07/03/2020
Finding Densest k-Connected Subgraphs
Dense subgraph discovery is an important graph-mining primitive with a v...
research
∙
02/26/2020
Query-Efficient Correlation Clustering
Correlation clustering is arguably the most natural formulation of clust...
research
∙
02/07/2018
Fair-by-design algorithms: matching problems and beyond
In discrete search and optimization problems where the elements that may...
research
∙
10/31/2014
