default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYiting Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Shiwen He
, Shaowen Xiong, Wei Zhang, Yiting Yang, Ju Ren, Yongming Huang:
GBLinks: GNN-Based Beam Selection and Link Activation for Ultra-Dense D2D mmWave Networks. IEEE Trans. Commun. 70(5): 3451-3466 (2022)- 2021
- [i3]Shiwen He, Shaowen Xiong, Wei Zhang, Yiting Yang, Ju Ren, Yongming Huang:
GBLinks: GNN-Based Beam Selection and Link Activation for Ultra-dense D2D mmWave Networks. CoRR abs/2107.02412 (2021)
2010 – 2019
- 2019
- [j9]Ming Chen, Yusheng Li, Yiting Yang:
Independence and matching number of some graphs. J. Comb. Optim. 37(4): 1342-1350 (2019) - 2018
- [c1]Tingting Zhuang, Chenhui Feng, Liang-Hung Wang, Jie Gao, Yiting Yang:
Hardware implementation of real-time ECG R-wave detection with wavelet transform algorithm. ICCIP 2018: 305-308 - 2017
- [j8]Victor J. W. Guo, Yiting Yang:
Proof of a conjecture of Kløve on permutation codes under the Chebychev distance. Des. Codes Cryptogr. 83(3): 685-690 (2017) - [j7]Xin Wang, Yiwei Zhang, Yiting Yang, Gennian Ge:
New bounds of permutation codes under Hamming metric and Kendall's τ -metric. Des. Codes Cryptogr. 85(3): 533-545 (2017) - [j6]Yusheng Li, Yilun Shang, Yiting Yang:
Clustering coefficients of large networks. Inf. Sci. 382-383: 350-358 (2017) - [j5]Yiting Yang, Yiwei Zhang, Gennian Ge:
New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach. IEEE Trans. Inf. Theory 63(4): 2446-2453 (2017) - [i2]Victor J. W. Guo, Yiting Yang:
Proof of a conjecture of Kløve on permutation codes under the Chebychev distance. CoRR abs/1704.01295 (2017) - 2016
- [i1]Xin Wang, Yiwei Zhang, Yiting Yang, Gennian Ge:
New bounds of permutation codes under Hamming metric and Kendall's $τ$-metric. CoRR abs/1611.07188 (2016) - 2013
- [j4]Fei Gao, Yiting Yang, Gennian Ge:
An Improvement on the Gilbert-Varshamov Bound for Permutation Codes. IEEE Trans. Inf. Theory 59(5): 3059-3063 (2013) - 2011
- [j3]Yiting Yang, Linyuan Lu:
The Randić index and the diameter of graphs. Discret. Math. 311(14): 1333-1343 (2011) - 2010
- [j2]Linyuan Lu, Yiting Yang:
A Lower Bound on the Transposition Diameter. SIAM J. Discret. Math. 24(4): 1242-1249 (2010) - [j1]Wei-Tian Li, Linyuan Lu, Yiting Yang:
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes. SIAM J. Discret. Math. 24(4): 1482-1494 (2010)
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-10-01 21:38 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:
