| Titolo | Pubblicato in | Anno |
|---|---|---|
| Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers | PROCEEDINGS OF THE VLDB ENDOWMENT | 2023 |
| Assessment of community efforts to advance network-based prediction of protein-protein interactions | NATURE COMMUNICATIONS | 2023 |
| Algorithms for fair k-clustering with multiple protected attributes | OPERATIONS RESEARCH LETTERS | 2021 |
| Skyline in Crowdsourcing with Imprecise Comparisons | CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management | 2021 |
| Spectral Relaxations and Fair Densest Subgraphs | International Conference on Information and Knowledge Management, Proceedings | 2020 |
| Algorithms for fair team formation in online labour marketplaces | WWW '19: Companion Proceedings of The 2019 World Wide Web Conference | 2019 |
| Algorithms for hiring and outsourcing in the online labor market | KDD '18 The 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining | 2018 |
| Tour recommendation for groups | DATA MINING AND KNOWLEDGE DISCOVERY | 2017 |
| The importance of being expert: Efficient max-finding in crowdsourcing | Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data | 2015 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma
