Ilie Sarpe

Postdoctoral Reseacher in Computer Science at KTH ilsarpe [at] kth.se

I am a postdoctoral researcher in Computer Science, mentored by Prof. Aristides Gionis. I got my Ph.D. in Computer Engineering at the Department of Information Engineering of the university of Padova under the supervision of Prof. Fabio Vandin. I am also a member of VandinLab and AIDA Lab!

In my research I enjoy developing algorithms for graph mining problems. I am particularly interested in developing efficient algorithms to study patterns on temporal networks. In my works, I enjoy using tools from sampling, probability and concentration theory and I am also very passionate about statistical learning theory.

You can download my full CV to known more about me. Feel free to contact me by mail or on socials!

News

May. 2024 Our paper Scalable Temporal Motif Densest Subnetwork Discovery, together with my mentors Fabio Vandin and Aristides Gionis, has been accepted at KDD 2024 😎, very excited to present such work in Barcelona!
May. 2024 Our tutorial on Mining Temporal Networks has been presented at TheWebConference 2024 in Singapore! Great collaboration with my coauthors Lutz Oettershagen and Aristides Gionis!
Sep. 2023 I have been invited to the ALACARTE'23 workshop, to speak about my research in the field of clustering and related problems!
Sep. 2023 I joined KTH to work with Prof. Aristides Gionis and his group as a postdoctoral researcher 🎉! So happy to work in such a research group and explore novel graph algorithms for social network analysis!
Mar. 2023 I successfully defended my PhD Thesis about novel algorithms for temporal networks!
Oct. 2022 I joined Prof. Aristides Gionis at KTH to work with him on novel algorithms for temporal networks!
Aug. 2022 I will join the KDD conference in Washington DC, cannot wait to meet researchers in this commnunity and attend my first in person conferece!
Feb. 2022 Our new work "ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks" in collaboration with my great colleague Diego Santoro is accepted at TheWebConference 2022 (WWW'22), I will join such community to present our work!
Aug. 2021 Our paper "odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks" in collaboration with my advisor has been accepted at CIKM 2021, I am enthusiastic to present such work at this great conference!
Apr. 2021 I will be joining the SDM21 conference to present our accepted paper. So excited to meet and discuss with researchers from this community!
Dec. 2020 My first paper as a PhD student "PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts" has been accepted at SIAM SDM 2021, thanks to my supervisor for the great collaboration and for supporting me in this work!
Oct. 2019 I got my 3 years PhD fellowship in Computer Engineering at DEI, I will be supervised by Prof. Fabio Vandin, and work on "Efficient and Rigorous Techniques for the Analysis of Large Temporal Networks"!

Publications

* denotes equal contribution

  • Scalable Temporal Motif Densest Subnetwork Discovery

    Ilie Sarpe, Fabio Vandin, Aristides Gionis, KDD 2024.

    Resources: Proceedings, Extended arXiv, code

  • ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks

    Diego Santoro*, Ilie Sarpe*, WWW 2022.

    Resources: Paper link, code

  • odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks

    Ilie Sarpe, Fabio Vandin, Acm CIKM 2021.

    Resources: Paper link, code, slides of the presentation coming soon..

  • PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts

    Ilie Sarpe, Fabio Vandin, SIAM SDM 2021.

    Resources: Paper link, code, slides of the presentation coming soon..

Education

PhD in Computer Engineering

Univerity of Padova

Topic: Efficient and Rigorous Techniques for the Analysis of Large Temporal Networks

September 2019 - March 2023

Master Degree in Computer Engineering (summa cum laude)

Univerity of Padova

Thesis Title: Mining Motifs in Temporal Networks

September 2017 - September 2019

Bachelor Degree in Computer Engineering

Univerity of Padova

Thesis Title: Statistical Correlation between Edit-distance and Alignment Free Measures

September 2014 - September 2017

Awards & Fellowships

  • SoBigData TNA Fellowship Oct. 2022.

    I got funded for my project proposal on novel algorithms for temporal networks. This allows me to join KTH and work with Prof. Aris Gionis. Thanks to SoBigData TNA!

  • 3 years Ph.D. Fellowship. July 2019.

    Ph.D. Fellowship for 3-years PhD Program in Computer Engineering at University of Padova.

  • Award for Scientific Degrees. Feb 2017.

    Award given to the best 500 students of scientific degrees at University of Padova.

  • "Mille e una lode" award. Nov. 2017.

    Award given to the best 3% of students of Computer Engineering School at University of Padova.

  • "Mille e una lode" award. Nov. 2016.

    Award given to the best 3% of students of Computer Engineering School at University of Padova.