Ilie Sarpe

🏹 Job alert: Two PhD positions in Machine Learning: 1. Wallenberg AI, Autonomous Systems & Software Program; 2. KTH Royal Institute of Technology (Sweden) & Nanyang Technological University (Singapore)

📍 Stockholm
⏰ Apply by March 5th
🔗 https://bit.ly/4cho8Kl

Want to join the ambitious, creative, collaborative, and fun environment at BARC? Our annual call for PhD or integrated MSc + PhD fellowship in Algorithms has been posted! Apply by January 10. employment.ku.dk/phd/?show=15...

Efficient and Adaptive Estimation of Local Triadic Coefficients Characterizing graph properties is fundamental to the analysis and to our understanding of real-world networked systems. The local clustering coefficient, and the more recently introduced, local closu...

🎉 Happy to announce that today 4/09, I will present our work "Efficient and Adaptive Estimation of Local Triadic Coefficients" at #VLDB2025, a joint work with @aris-gionis.bsky.social. Join the talk or the poster session if you want to know more. The arXiv paper is out (arxiv.org/abs/2507.07536)!

Thumbnail: Efficient and Adaptive Estimation of Local Triadic Coefficients

Vol:18 No:8 → Efficient and Adaptive Estimation of Local Triadic Coefficients
👥 Authors: Ilie Sarpe, Aristides Gionis
📄 PDF: https://www.vldb.org/pvldb/vol18/p2561-sarpe.pdf

TGLib: An Open-Source Library for Temporal Graph Analysis We initiate an open-source library for the efficient analysis of temporal graphs. We consider one of the standard models of dynamic networks in which each edge has a discrete timestamp and transition ...

🚀 TGLib is now on PyPI!
Our open-source library for efficient temporal graph analysis is now easy to install (Linux):

pip install temporalgraphlib

📄 Paper: arxiv.org/abs/2209.12587

💻 Code: gitlab.com/tgpublic/tglib

#TGLib #TemporalGraphs #Python #OpenSource #NetworkScience

Our resources will also be made available online at: miningtemporalnetworks.github.io 😎

I am happy to share that today together with Lutz Oettershagen we will be presenting our tutorial in collaboration with @aris-gionis.bsky.social , on recent advances in temporal graph mining at #SIAMSDM25 🥳! If you are around we hope to see you there!

I am looking for a PhD student in graph data management and analysis.

Application deadline:
April 3, 2025

More details:
jobs.tuwien.ac.at/Job/244015

#hiring #PhDposition #knowledgegraphs #graphData

My former KTH colleague Ioana Bercea is hiring for two Ph.D. students in (randomized) algorithms and data structures. This is a great opportunity embedded into a very nice TCS group at KTH!
www.kth.se/lediga-jobb/...

Doctoral student in machine learning with focus on explainable clustering Project description Third-cycle subject: Computer Science We are looking for a highly-qualified and motivated individual to pursue a PhD in the area of machine learning with focus on explainable clust

Join my group in KTH Royal Institute of Technology! One PhD position available funded by the Swedish Research Council (VR). Application deadline on March 6, 2025. More details at: kth.varbi.com/en/what:job/...

I am hiring for a Ph.D. student to work in the areas of social network analysis, algorithms and fair machine learning.

Please apply and join our highly motivated team.

For more information please see the call: neumannstefan.com/hiring/