A Comparative Study of Some Point Process Models for Dynamic Networks. - S. Haleh S. Dizaji; Saeid Pashazadeh; Javad Musevi Niya (Complex., 2022)

Wasserstein generative adversarial networks for modeling marked events. - S. Haleh S. Dizaji; Saeid Pashazadeh; Javad Musevi Niya (J. Supercomput., 2023)

Graph Sampling Quality Prediction for Algorithm Recommendation. - S. Haleh S. Dizaji; Reza Farahani; Joze M. Rozanec; Dragi Kimovski; Ahmet Soylu; Radu Prodan (HiPC, 2024)

Modeling and Generating Extreme Volumes of Financial Synthetic Time-Series Data with Knowledge Graphs. - Laurentiu Vasiliu; S. Haleh S. Dizaji; Aaron Eberhart; Dumitru Roman; Radu Prodan (SEMANTiCS (Posters, Demos, Workshops & Tutorials), 2024)

An Extensive Characterization of Graph Sampling Algorithms. - S. Haleh S. Dizaji; Joze M. Rozanec; Reza Farahani; Dumitru Roman; Radu Prodan (ICPE (Companion), 2024)

Influence Maximization in Dynamic Networks Using Reinforcement Learning. - S. Haleh S. Dizaji; Kishor Patil; Konstantin Avrachenkov (SN Comput. Sci., 2024)