A Low-Cost Sparse Recovery Framework for Weighted Networks under Compressive Sensing. - Hamidreza Mahyar; Hamid R. Rabiee; Ali Movaghar 001; Rouzbeh Hasheminezhad; Elaheh Ghalebi; Ali Nazemian (SmartCity, 2015)

Convex Block-sparse Linear Regression with Expanders - Provably. - Anastasios Kyrillidis; Bubacarr Bah; Rouzbeh Hasheminezhad; Quoc Tran-Dinh; Luca Baldassarre; Volkan Cevher (AISTATS, 2016)

A Compressive Sensing Framework for Distributed Detection of High Closeness Centrality Nodes in Networks. - Hamidreza Mahyar; Rouzbeh Hasheminezhad; Elahe Ghalebi K.; Radu Grosu; Harry Eugene Stanley (COMPLEX NETWORKS (2), 2018)

Identifying central nodes for information flow in social networks using compressive sensing. - Hamidreza Mahyar; Rouzbeh Hasheminezhad; Elaheh Ghalebi; Ali Nazemian; Radu Grosu; Ali Movaghar 001; Hamid R. Rabiee (Soc. Netw. Anal. Min., 2018)

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. - Krishnendu Chatterjee; Hongfei Fu 001; Petr Novotný 001; Rouzbeh Hasheminezhad (ACM Trans. Program. Lang. Syst., 2018)

Compressive closeness in networks. - Hamidreza Mahyar; Rouzbeh Hasheminezhad; Harry Eugene Stanley (Appl. Netw. Sci., 2019)

Scale-free networks need not be fragile. - Rouzbeh Hasheminezhad; Moses Boudourides; Ulrik Brandes (ASONAM, 2020)

Robustness of Preferential-Attachment Graphs: Shifting the Baseline. - Rouzbeh Hasheminezhad; Ulrik Brandes (COMPLEX NETWORKS (2), 2022)

Constructing Provably Robust Scale-Free Networks. - Rouzbeh Hasheminezhad; Ulrik Brandes (NetSci-X, 2022)

The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis. - Rouzbeh Hasheminezhad; August Bøgh Rønberg; Ulrik Brandes (WAW, 2023)

Robustness of preferential-attachment graphs. - Rouzbeh Hasheminezhad; Ulrik Brandes (Appl. Netw. Sci., 2023)