Rouzbeh Hasheminezhad

According to our database1, Rouzbeh Hasheminezhad authored at least 11 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Robustness of preferential-attachment graphs.
Appl. Netw. Sci., December, 2023

The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis.
Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023

2022
Constructing Provably Robust Scale-Free Networks.
Proceedings of the Network Science - 7th International Winter Conference, 2022

Robustness of Preferential-Attachment Graphs: Shifting the Baseline.
Proceedings of the Complex Networks and Their Applications XI, 2022

2020
Scale-free networks need not be fragile.
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2020

2019
Compressive closeness in networks.
Appl. Netw. Sci., 2019

2018
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.
ACM Trans. Program. Lang. Syst., 2018

Identifying central nodes for information flow in social networks using compressive sensing.
Soc. Netw. Anal. Min., 2018

A Compressive Sensing Framework for Distributed Detection of High Closeness Centrality Nodes in Networks.
Proceedings of the Complex Networks and Their Applications VII, 2018

2016
Convex Block-sparse Linear Regression with Expanders - Provably.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
A Low-Cost Sparse Recovery Framework for Weighted Networks under Compressive Sensing.
Proceedings of the 2015 IEEE International Conference on Smart City/SocialCom/SustainCom/DataCom/SC2 2015, 2015


  Loading...