default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXianliang Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c2]Jiahao Li, Liwei Xiao, Jiawei Luo, Xianliang Liu, Junjie Chen:
High-Activity Enhancer Generation based on Feedback GAN with Domain Constraint and Curriculum Learning. BIBM 2023: 2065-2070- 2021
- [j10]Xianliang Liu, Yicheng Lin:
New efficient algorithms for the centroid of an interval type-2 fuzzy set. Inf. Sci. 570: 468-486 (2021) - [j9]Xianliang Liu, Zishen Yang, Wei Wang:
The t-latency bounded strong target set selection problem in some kinds of special family of graphs. J. Comb. Optim. 41(1): 105-117 (2021) - [c1]Xiaolong Zhou, Gang Liu, Xianliang Liu, Weidong Zhang:
A Novel Marine Gear Fault Diagnosis Method Based on VMD and MDE. SPAC 2021: 329-334 - 2020
- [j8]Xianliang Liu
, Shuping Wan:
Combinatorial Iterative Algorithms for Computing the Centroid of an Interval Type-2 Fuzzy Set. IEEE Trans. Fuzzy Syst. 28(4): 607-617 (2020)
2010 – 2019
- 2019
- [j7]Xianliang Liu, Shu-Ping Wan:
A method to calculate the ranges of criteria weights in ELECTRE I and II methods. Comput. Ind. Eng. 137 (2019) - [j6]Xianliang Liu, Zishen Yang, Wei Wang:
Some results for the two disjoint connected dominating sets problem. Discret. Math. Algorithms Appl. 11(6): 1950065:1-1950065:11 (2019) - 2018
- [j5]Xianliang Liu, Zishen Yang, Wei Wang:
Algorithm and complexity of the two disjoint connected dominating sets problem on trees. Appl. Math. Comput. 337: 419-427 (2018) - 2016
- [j4]Xianliang Liu, Zishen Yang, Wei Wang:
Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs. Discret. Appl. Math. 203: 111-116 (2016) - [j3]Dongyue Liang, Zhao Zhang, Xianliang Liu, Wei Wang, Yaolin Jiang:
Approximation algorithms for minimum weight partial connected set cover problem. J. Comb. Optim. 31(2): 696-712 (2016) - [j2]Xianliang Liu, Wei Wang, Donghyun Kim, Zishen Yang, Alade O. Tokuta, Yaolin Jiang:
The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs. Wirel. Networks 22(2): 553-562 (2016) - 2013
- [j1]Xianliang Liu, Hongliang Lu, Wei Wang, Weili Wu:
PTAS for the minimum k-path connected vertex cover problem in unit disk graphs. J. Glob. Optim. 56(2): 449-458 (2013)
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-08 21:40 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:
