| Onbra: Rigorous estimation of the temporal betweenness centrality in temporal networks D Santoro, I Sarpe Proceedings of the ACM Web Conference 2022, 1579-1588, 2022 | 20 | 2022 |
| Presto: Simple and scalable sampling techniques for the rigorous approximation of temporal motif counts I Sarpe, F Vandin Proceedings of the 2021 SIAM International Conference on Data Mining (SDM …, 2021 | 16 | 2021 |
| OdeN: simultaneous approximation of multiple motif counts in large temporal networks I Sarpe, F Vandin Proceedings of the 30th ACM International Conference on Information …, 2021 | 12 | 2021 |
| Mining temporal networks A Gionis, L Oettershagen, I Sarpe Companion Proceedings of the ACM on Web Conference 2024, 1260-1263, 2024 | 1 | 2024 |
| Efficient and practical approximation algorithms for advertising in content feeds G Zhang, I Sarpe, A Gionis arXiv preprint arXiv:2502.02115, 2025 | | 2025 |
| Scalable Temporal Motif Densest Subnetwork Discovery I Sarpe, F Vandin, A Gionis Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and …, 2024 | | 2024 |
| Efficient and Rigorous Algorithms for the Analysis of Large Temporal Networks I Sarpe Università degli studi di Padova, 2023 | | 2023 |
| Mining motifs in temporal networks I Sarpe | | |
Fabio VandinUniversity of PadovaEmail verificata su unipd.it