Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Willson
- > Home > Persons > James Willson
Publications
- 2016
[j11]Zhao Zhang
, James Willson, Zaixin Lu, Weili Wu, Xuding Zhu, Ding-Zhu Du:
Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks. IEEE/ACM Trans. Netw. 24(6): 3620-3633 (2016)- 2015
- [c6]James Willson, Zhao Zhang, Weili Wu, Ding-Zhu Du:
Fault-tolerant coverage with maximum lifetime in wireless sensor networks. INFOCOM 2015: 1364-1372 - 2014
- [j10]Kai Xing, Weili Wu, Ling Ding, Lidong Wu, James Willson:
An efficient routing protocol based on consecutive forwarding prediction in delay tolerant networks. Int. J. Sens. Networks 15(2): 73-82 (2014) - [j9]Yuqing Zhu, Deying Li, Wen Xu, Weili Wu, Lidan Fan, James Willson:
Mutual-Relationship-Based Community Partitioning for Social Networks. IEEE Trans. Emerg. Top. Comput. 2(4): 436-447 (2014) - [c5]Yuqing Zhu, Weili Wu, James Willson, Ling Ding, Lidong Wu, Deying Li, Wonjun Lee:
An approximation algorithm for client assignment in client/server systems. INFOCOM 2014: 2777-2785 - 2012
- [j8]Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee:
Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas. IEEE Trans. Mob. Comput. 11(7): 1102-1112 (2012) - [c4]Ling Ding, Weili Wu, James Willson, Lidong Wu, Zaixin Lu, Wonjun Lee:
Constant-approximation for target coverage problem in wireless sensor networks. INFOCOM 2012: 1584-1592 - 2011
- [j7]Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee, Ding-Zhu Du:
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks. IEEE Trans. Parallel Distributed Syst. 22(10): 1601-1609 (2011) - [c3]Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee:
Construction of directional virtual backbones with minimum routing cost in wireless networks. INFOCOM 2011: 1557-1565 - 2010
- [j6]Feng Zou, James Willson, Zhao Zhang, Weili Wu:
Fast Information Propagation in Social Networks. Discret. Math. Algorithms Appl. 2(1): 125-142 (2010) - [j5]Chen Wang, James Willson, Myung Ah Park, Andras Farago, Weili Wu:
On dual power assignment optimization for biconnectivity. J. Comb. Optim. 19(2): 174-183 (2010) - 2009
- [j4]Wei Wang, Donghyun Kim, James Willson, Bhavani Thuraisingham, Weili Wu:
A Better Approximation for Minimum Average Routing Path Clustering Problem in 2-d Underwater Sensor Networks. Discret. Math. Algorithms Appl. 1(2): 175-192 (2009) - [j3]James Willson, Xiaofeng Gao, Zhonghua Qu, Yi Zhu, Yingshu Li, Weili Wu:
Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints. Discret. Math. Algorithms Appl. 1(4): 437-462 (2009) - [j2]Yi Zhu, Xiaofeng Gao, James Willson, Changcun Ma, Jason P. Jue, Weili Wu:
Improving cell broadcasting scheme to support multi-lingual service in wireless networks. IEEE Commun. Lett. 13(9): 634-636 (2009) - 2008
- [j1]Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu:
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity. Theor. Comput. Sci. 396(1-3): 180-190 (2008) - 2007
- [c1]Myung Ah Park, James Willson, Chen Wang, My T. Thai, Weili Wu, Andras Farago:
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. MobiHoc 2007: 22-31
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-21 18:27 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:
