Publications

2025	Efficient Approximate Temporal Triangle Counting in Streaming with Predictions Giorgio Venturin, Ilie Sarpe, Fabio Vandin ECML-PKDD 2025 - Paper \| Code
2025	Efficient and Adaptive Estimation of Local Triadic Coefficients Ilie Sarpe, Aristides Gionis VLDB 2025 – Paper \| Code
2025	Efficient and Practical Approximation Algorithms for Advertising in Content Feeds Guangyi Zhang, Ilie Sarpe, Aristides Gionis WWW 2025 – Paper \| Code
2024	Scalable Temporal Motif Densest Subnetwork Discovery Ilie Sarpe, Fabio Vandin, Aristides Gionis KDD 2024 – Paper \| Code \| Talk at Algorithmic Aspects of Temporal Graphs VIII
2022	ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks Diego Santoro, Ilie Sarpe WWW 2022 - Paper \| Code
2021	OdeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks Ilie Sarpe, Fabio Vandin ACM CIKM 2021 – Paper \| Code
2021	PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts Ilie Sarpe, Fabio Vandin SIAM SDM 2021 – Paper \| Code

* denotes equal contribution