Dimosthenis Pasadakis is a Ph.D. candidate at the Faculty of Informatics at Università della Svizzera italiana (USI) in Lugano, Switzerland. He graduated in Physics from the Aristotle University of Thessaloniki in Greece, and earned a Msc degree in Computational Science from USI. His research is centered around algorithms for graph learning and combinatorial optimization for graph partitioning and clustering.