default search action
Rouzbeh Hasheminezhad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Rouzbeh Hasheminezhad, Ulrik Brandes:
Robustness of preferential-attachment graphs. Appl. Netw. Sci. 8(1): 32 (2023) - [c8]Rouzbeh Hasheminezhad, August Bøgh Rønberg, Ulrik Brandes:
The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis. WAW 2023: 99-111 - 2022
- [c7]Rouzbeh Hasheminezhad, Ulrik Brandes:
Robustness of Preferential-Attachment Graphs: Shifting the Baseline. COMPLEX NETWORKS (2) 2022: 445-456 - [c6]Rouzbeh Hasheminezhad, Ulrik Brandes:
Constructing Provably Robust Scale-Free Networks. NetSci-X 2022: 126-139 - 2020
- [c5]Rouzbeh Hasheminezhad, Moses Boudourides, Ulrik Brandes:
Scale-free networks need not be fragile. ASONAM 2020: 332-339
2010 – 2019
- 2019
- [j3]Hamidreza Mahyar
, Rouzbeh Hasheminezhad, Harry Eugene Stanley:
Compressive closeness in networks. Appl. Netw. Sci. 4(1): 100:1-100:21 (2019) - [i3]Hamidreza Mahyar, Rouzbeh Hasheminezhad, Harry Eugene Stanley:
Compressive Closeness in Networks. CoRR abs/1906.08335 (2019) - 2018
- [j2]Hamidreza Mahyar, Rouzbeh Hasheminezhad, Elaheh Ghalebi, Ali Nazemian, Radu Grosu, Ali Movaghar, Hamid R. Rabiee
Identifying central nodes for information flow in social networks using compressive sensing. Soc. Netw. Anal. Min. 8(1): 33:1-33:24 (2018) - [j1]Krishnendu Chatterjee
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Trans. Program. Lang. Syst. 40(2): 7:1-7:45 (2018) - [c4]Hamidreza Mahyar, Rouzbeh Hasheminezhad, Elahe Ghalebi K., Radu Grosu, Harry Eugene Stanley:
A Compressive Sensing Framework for Distributed Detection of High Closeness Centrality Nodes in Networks. COMPLEX NETWORKS (2) 2018: 91-103 - 2016
- [c3]Anastasios Kyrillidis, Bubacarr Bah, Rouzbeh Hasheminezhad, Quoc Tran-Dinh, Luca Baldassarre, Volkan Cevher:
Convex Block-sparse Linear Regression with Expanders - Provably. AISTATS 2016: 19-27 - [c2]Krishnendu Chatterjee, Hongfei Fu
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL 2016: 327-342 - [i2]Anastasios Kyrillidis, Bubacarr Bah, Rouzbeh Hasheminezhad, Quoc Tran-Dinh, Luca Baldassarre, Volkan Cevher:
Convex block-sparse linear regression with expanders - provably. CoRR abs/1603.06313 (2016) - 2015
- [c1]Hamidreza Mahyar, Hamid R. Rabiee
A Low-Cost Sparse Recovery Framework for Weighted Networks under Compressive Sensing. SmartCity 2015: 183-190 - [i1]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. CoRR abs/1510.08517 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: