default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNavid Imani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j9]Navid Imani, Hamid Sarbazi-Azad:
Properties of a hierarchical network based on the star graph. Inf. Sci. 180(14): 2802-2813 (2010)- [j8]Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya
:
Resource placement in Cartesian product of networks. J. Parallel Distributed Comput. 70(5): 481-495 (2010) - [c9]Qianping Gu, Navid Imani:
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. LATIN 2010: 26-37
2000 – 2009
- 2009
- [j7]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl, Paria Moinzadeh:
Chromatic sets of power graphs and their application to resource placement in multicomputer networks. Comput. Math. Appl. 58(3): 403-413 (2009) - [j6]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl:
Some topological properties of star graphs: The surface area and volume. Discret. Math. 309(3): 560-569 (2009) - [j5]Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya, Paria Moinzadeh:
Detecting Threats in Star Graphs. IEEE Trans. Parallel Distributed Syst. 20(4): 474-483 (2009) - 2008
- [j4]Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya:
Intruder Capturing in Mesh and Torus Networks. Int. J. Found. Comput. Sci. 19(4): 1049-1071 (2008) - [j3]Mohammad Reza Hoseiny Farahabady, Navid Imani, Hamid Sarbazi-Azad:
Some topological and combinatorial properties of WK-recursive mesh and WK-pyramid interconnection networks. J. Syst. Archit. 54(10): 967-976 (2008) - 2007
- [j2]Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya:
Capturing an intruder in product networks. J. Parallel Distributed Comput. 67(9): 1018-1028 (2007) - [j1]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl:
Perfect load balancing on the star interconnection network. J. Supercomput. 41(3): 269-286 (2007) - [c8]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl:
Resource Placement in Networks Using Chromatic Sets of Power Graphs. CSR 2007: 158-167 - [c7]Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya:
Some Properties of WK-Recursive and Swapped Networks. ISPA 2007: 856-867 - [c6]Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya:
Distant-Based Resource Placement in Product Networks. PDCAT 2007: 31-36 - 2006
- [c5]Pooya Shareghi, Navid Imani, Hamid Sarbazi-Azad:
Capturing an Intruder in the Pyramid. CSR 2006: 580-590 - [c4]Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya:
Capturing an Intruder in Product Networks. HiPC 2006: 193-204 - [c3]Navid Imani, Hamid Sarbazi-Azad:
A physical particle and plane framework for load balancing in multiprocessors. IPDPS 2006 - 2005
- [c2]Navid Imani, Hamid Sarbazi-Azad:
The Star-Pyramid Graph: An Attractive Alternative to the Pyramid. Asia-Pacific Computer Systems Architecture Conference 2005: 509-519 - [c1]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl:
On Some Combinatorial Properties of the Star Graph. ISPAN 2005: 58-65
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:46 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:
