default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeiping Shang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Weiping Shang
, Peng Ren, Zheng Xiang, Long Yang:
An Exact Analysis on Matrix-Based Precoding for the Common Message in Downlink Rate Splitting Multiple Access. IEEE Commun. Lett. 28(4): 927-931 (2024)
2010 – 2019
- 2017
- [j12]Easton Li Xu, Weiping Shang, Guangyue Han:
Network encoding complexity: Exact values, bounds, and inequalities. Adv. Math. Commun. 11(3): 567-594 (2017) - 2015
- [j11]Xiumei Wang, Weiping Shang, Jinjiang Yuan:
On Graphs with a Unique Perfect Matching. Graphs Comb. 31(5): 1765-1777 (2015) - 2014
- [j10]Xiumei Wang, Weiping Shang, Yixun Lin, Marcelo Henriques de Carvalho:
A Characterization of PM-Compact claw-Free cubic graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - 2013
- [j9]Qi Feng, Wenjie Li, Weiping Shang, Yuhua Cai:
An on-line scheduling problem of parallel machines with common maintenance time. J. Syst. Sci. Complex. 26(2): 201-208 (2013) - 2012
- [c5]Easton Li Xu, Weiping Shang, Guangyue Han:
A graph theoretical approach to network encoding complexity. ISITA 2012: 396-400 - [i1]Easton Li Xu, Weiping Shang, Guangyue Han:
A Graph Theoretical Approach to Network Encoding Complexity. CoRR abs/1202.0747 (2012) - 2011
- [j8]Xiaoxin Song, Weiping Shang:
Roman domination in a tree. Ars Comb. 98: 73-82 (2011) - [j7]Weiping Shang, Xiumei Wang:
Algorithms for Minimum Connected capacitated Dominating Set Problem. Discret. Math. Algorithms Appl. 3(1): 9-16 (2011) - 2010
- [j6]Weiping Shang, Xiumei Wang, Xiaodong Hu:
Roman domination and its Variants in Unit Disk Graphs. Discret. Math. Algorithms Appl. 2(1): 99-106 (2010) - [j5]Weiping Shang, Peng-Jun Wan, Xiaodong Hu:
Approximation algorithm for minimal convergecast time problem in wireless sensor networks. Wirel. Networks 16(5): 1345-1353 (2010)
2000 – 2009
- 2008
- [j4]Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
On minimum m -connected k -dominating set problem in unit disc graphs. J. Comb. Optim. 16(2): 99-106 (2008) - 2007
- [j3]Weiping Shang, Peng-Jun Wan, F. Frances Yao, Xiaodong Hu:
Algorithms for minimum m-connected k-tuple dominating set problem. Theor. Comput. Sci. 381(1-3): 241-247 (2007) - [c4]Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
Algorithms for Minimum m -Connected k -Dominating Set Problem. COCOA 2007: 182-190 - [c3]Weiping Shang, Xiaodong Hu:
The Roman Domination Problem in Unit Disk Graphs. International Conference on Computational Science (3) 2007: 305-312 - [c2]Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hongwei Du, Weiping Shang:
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks. INFOCOM 2007: 733-739 - [c1]Jianming Zhu, Weiping Shang, Xiaodong Hu:
New Algorithm for Minimum Multicast Time Problem in Wireless Sensor Networks. WCNC 2007: 3529-3534 - 2006
- [j2]Weiping Shang, Jinjiang Yuan:
Upper minus domination in a claw-free cubic graph. Discret. Math. 306(22): 2983-2988 (2006) - 2005
- [j1]Jinjiang Yuan, Weiping Shang, Qi Feng:
A note on the scheduling with two families of jobs. J. Sched. 8(6): 537-542 (2005)
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-05-06 21:14 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:
