default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenyao Song
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ting Zhou, Lianying Miao, Wenyao Song:
On the eccentric distance sum of trees with given maximum degree. Discret. Appl. Math. 348: 79-86 (2024)- 2023
- [j14]Wenyao Song
, Chen Wang, Taifeng Dong, Zhaohai Wang, Chengxin Wang, Xiaoda Mu, Huanxue Zhang:
Hierarchical extraction of cropland boundaries using Sentinel-2 time-series data in fragmented agricultural landscapes. Comput. Electron. Agric. 212: 108097 (2023) - [j13]Wenyao Song, Lianying Miao, Yueying Zhao, Haiyang Zhu:
Acyclic chromatic index of IC-planar graphs. Discuss. Math. Graph Theory 43(4): 965-978 (2023) - [c2]Guanru Fang, Wenyao Song, Chen Wang, Haoyu Zhang, Ziming Wang, Haoping Wang, Huanxue Zhang:
An improved zoning crop mapping approach in complex agricultural landscapes considering crop heterogeneity. Agro-Geoinformatics 2023: 1-5 - [c1]Wenyao Song, Chen Wang, Xiaoda Mu, Guanru Fang, Haoping Wang, Huanxue Zhang:
Accurate extraction of fragmented field boundaries using classification-assisted and CNN-based semantic segmentation methods. Agro-Geoinformatics 2023: 1-4 - 2021
- [j12]Juan Wang, Lianying Miao, Wenyao Song, Yunlong Liu:
Acyclic Coloring of Graphs with Maximum Degree 7. Graphs Comb. 37(2): 455-469 (2021) - [j11]Yuanyuan Duan, Wenyao Song:
A Sufficient Condition for an IC-Planar Graph to be Class 1. Graphs Comb. 37(6): 2305-2313 (2021) - 2020
- [j10]Juan Wang, Lianying Miao, Wenyao Song:
Acyclic L-coloring of graphs with maximum degrees 5 and 6. Discret. Math. 343(1): 111584 (2020) - [j9]Wenyao Song, Yuanyuan Duan, Lianying Miao:
Neighbor sum distinguishing total coloring of IC-planar graphs. Discret. Math. 343(8): 111918 (2020) - [j8]Yuanyuan Duan, Lianying Miao, Wenyao Song:
Neighbor sum distinguishing total choosability of IC-planar graphs. Discuss. Math. Graph Theory 40(1): 331-344 (2020)
2010 – 2019
- 2018
- [j7]Wenyao Song, Lianying Miao, Jinbo Li, Yueying Zhao, Jingru Pang:
Neighbor sum distinguishing total coloring of sparse IC-planar graphs. Discret. Appl. Math. 239: 183-192 (2018) - [j6]Haiyang Zhu, Lianying Miao, Sheng Chen, Xinzhong Lü, Wenyao Song:
The list L(2, 1)-labeling of planar graphs. Discret. Math. 341(8): 2211-2219 (2018) - 2017
- [j5]Lianying Miao, Wenyao Song:
Strong edge-coloring of planar graphs. Discuss. Math. Graph Theory 37(4): 845-857 (2017) - 2014
- [j4]Yancai Zhao, Lianying Miao, Shiyou Pang, Wenyao Song:
Acyclic vertex coloring of graphs of maximum degree six. Discret. Math. 325: 17-22 (2014) - [j3]Lianying Miao, Zhengke Miao, Shiyou Pang, Wenyao Song:
On the independence number of edge chromatic critical graphs. Discuss. Math. Graph Theory 34(3): 577-584 (2014) - [j2]Wenyao Song, Lianying Miao, Haichao Wang, Yancai Zhao:
Maximal matching and edge domination in complete multipartite graphs. Int. J. Comput. Math. 91(5): 857-862 (2014) - [j1]Lianying Miao, Wenyao Song, Shiyou Pang, Zhengke Miao:
On the size of critical graphs with small maximum degree. Int. J. Comput. Math. 91(10): 2142-2151 (2014)
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-07 22:09 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:
