◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Shahrzad Shirazipourazad

2 papers hereh-index 9295 citations19 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.CC1
  • cs.NI1

identity via Semantic Scholar / OpenAlex

most citedNP-completeness Proof: RBCDN Reduction Problem

1 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.NI2014★ 1 cited

On Connectivity of Airborne Networks

Shahrzad Shirazipourazad, Pavel Ghosh, Arunabha Sen

Mobility pattern of nodes in a mobile network has significant impact on the connectivity properties of the network. One such mobile network that has drawn attention of researchers…

cs.CC2010★ 1 cited

NP-completeness Proof: RBCDN Reduction Problem

Sujogya Banerjee, Shahrzad Shirazipourazad, Pavel Ghosh +1

Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.