default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeilian Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j12]Yu Jiang
, Meilian Liang, Yongqi Sun, Xiaodong Xu:
On Ramsey Numbers R(K4-e, Kt). Graphs Comb. 37(3): 651-661 (2021)- 2020
- [j11]Xiaodong Xu, Meilian Liang, Stanislaw P. Radziszowski:
Chromatic Vertex Folkman Numbers. Electron. J. Comb. 27(3): 3 (2020)
2010 – 2019
- 2019
- [j10]Meilian Liang, Stanislaw P. Radziszowski, Xiaodong Xu:
On a Diagonal Conjecture for classical Ramsey numbers. Discret. Appl. Math. 267: 195-200 (2019) - [j9]Meilian Liang, Stanislaw P. Radziszowski, Xiaodong Xu:
A note on upper bounds for some generalized Folkman numbers. Discuss. Math. Graph Theory 39(4): 937-950 (2019) - [j8]Yu Jiang, Meilian Liang, Yanmei Teng, Xiaodong Xu:
The Cyclic Triangle-Free Process. Symmetry 11(8): 955 (2019) - 2018
- [j7]Xiaodong Xu, Meilian Liang, Stanislaw P. Radziszowski:
On the Nonexistence of Some Generalized Folkman Numbers. Graphs Comb. 34(5): 1101-1110 (2018) - 2017
- [j6]Zehui Shao, Fei Deng, Meilian Liang, Xiaodong Xu, Mingjun Zou:
New optimal modular Sidon sets. Int. J. Auton. Adapt. Commun. Syst. 10(3): 279-289 (2017) - 2014
- [j5]Zehui Shao, Meilian Liang, Chuang Yin, Xiaodong Xu, Polona Pavlic, Janez Zerovnik:
On rainbow domination numbers of graphs. Inf. Sci. 254: 225-234 (2014) - [i1]Baoxin Xiu, Changjun Fan, Meilian Liang:
On Disjoint Golomb Rulers. CoRR abs/1405.4535 (2014) - 2013
- [j4]Fei Deng, Meilian Liang, Zehui Shao, Xiaodong Xu:
Upper bounds for the vertex Folkman number Fv(3, 3, 3;4) and Fv(3, 3, 3;5). Ars Comb. 112: 249-256 (2013) - [c3]Meilian Liang, Jing Yang:
An Empirical Study on the Functional Mechanism among Team Trust, Team Commitment and Team Innovation in Chinese High Technology Innovation Teams. WHICEB 2013: 46 - 2012
- [j3]Zehui Shao, Meilian Liang, Xiaodong Xu:
Some new optimal generalized Sidon sequences. Ars Comb. 107: 369-378 (2012) - [j2]Zehui Shao, Fei Deng, Meilian Liang, Xiaodong Xu:
On sets without k-term arithmetic progression. J. Comput. Syst. Sci. 78(2): 610-618 (2012) - [j1]Meilian Liang, Xiaodong Xu, Jiarong Liang, Zehui Shao:
Upper bounds on the connection probability for 2-D meshes and tori. J. Parallel Distributed Comput. 72(2): 185-194 (2012) - 2011
- [c2]Meilian Liang, Binmei Liang, Linna Wei, Xiaodong Xu:
Edge rough graph and its application. FSKD 2011: 335-338
2000 – 2009
- 2009
- [c1]Hongze Leng, Meilian Liang, Junqiang Song, Zheng Xie, Jun Zhang:
Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed. DASC 2009: 557-561
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 2025-01-26 23:44 CET 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:
