default search action
Rashid Bin Muhammad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j2]Rashid Bin Muhammad
:
Range assignment problem on the Steiner tree based topology in ad hoc wireless networks. Mob. Inf. Syst. 5(1): 53-64 (2009) - 2008
- [c14]Rashid Bin Muhammad
Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation. ACIS-ICIS 2008: 415-420 - [c13]Rashid Bin Muhammad
Range Assignment Approximation Based on Steiner Tree in Ad Hoc Wireless Networks. AINA 2008: 100-105 - [c12]Rashid Bin Muhammad
A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm. AINA Workshops 2008: 276-280 - [c11]Rashid Bin Muhammad:
Topology Control Based on a Steiner Tree in Ad Hoc Wirless Networks. ICWN 2008: 229-233 - [c10]Rashid Bin Muhammad
Transmitting Range Assignments Using Steiner Tree in Ad Hoc Wireless Networks. ITNG 2008: 408-413 - [c9]Rashid Bin Muhammad
A Parallel Steiner Tree Construction on the Server-Client Model of Computation. ITNG 2008: 1281-1283 - [c8]Rashid Bin Muhammad:
Time Delay Analysis for a Parallel Steiner tree Algorithm. PDPTA 2008: 320-326 - 2007
- [j1]Rashid Bin Muhammad:
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks. J. Networks 2(6): 50-57 (2007) - [c7]Rashid Bin Muhammad
A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks. AINA Workshops (2) 2007: 685-689 - [c6]Rashid Bin Muhammad:
Connectivity and Transmitting Range Assignments in Ad Hoc Wireless Networks. ICWN 2007: 153-159 - [c5]Rashid Bin Muhammad
A Distributed Geometric Routing Algorithm for Ad HocWireless Networks. ITNG 2007: 961-963 - 2006
- [c4]Rashid Bin Muhammad:
Parallelization of local search for Euclidean Steiner tree problem. ACM Southeast Regional Conference 2006: 233-238 - [c3]Rashid Bin Muhammad:
Energy efficient topology control in wireless sensor networks. ACM Southeast Regional Conference 2006: 784-785 - [c2]Rashid Bin Muhammad
A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem. SNPD 2006: 157-164 - 2005
- [c1]Rashid Bin Muhammad:
Distributed One-Hope Algorithm based on Steiner Connected Dominating Set in Wireless Networks. IASTED PDCS 2005: 225-230
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:44 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: