De-centralised dynamic task scheduling using hill climbing algorithm in cloud computing environments. - Mona Mohammadi; Amir Masoud Rahmani (Int. J. Cloud Comput., 2017)

Repeated Prophet Inequality with Near-optimal Bounds. - Krishnendu Chatterjee; Mona Mohammadi; Raimundo Saona (CoRR, 2022)

Bounding the sum of the largest signless Laplacian eigenvalues of a graph. - Aida Abiad; Leonardo Silva de Lima; Sina Kalantarzadeh; Mona Mohammadi; Carla Silva Oliveira (Discret. Appl. Math., 2023)