default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanli Liu 0001
Person information
- affiliation: Wuhan University of Science and Technology, Wuhan, China
- affiliation: Huazhong University of Science and Technology, Wuhan, China
Other persons with the same name
- Yanli Liu — disambiguation page
- Yanli Liu 0002
![[0000-0002-3181-2699]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-3181-2699")
— Sichuan University, Chengdu, China - Yanli Liu 0003 — University of California, Los Angeles, CA, USA
- Yanli Liu 0004 — Northeastern University, Shenyang, China (and 1 more)
- Yanli Liu 0005 — East China Jiaotong University, Nanchang, China
- Yanli Liu 0006 — Zhejiang University, Hangzhou, China
- Yanli Liu 0007 — Xidian University, Xi'an, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Jianrong Zhou, Shuo Ren, Kun He, Yanli Liu, Chu-Min Li:
An efficient solution space exploring and descent method for packing equal spheres in a sphere. Comput. Oper. Res. 164: 106522 (2024)- [c6]Jinghui Xue, Jiongzhi Zheng, Kun He, Chu-Min Li, Yanli Liu:
DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. ECAI 2024: 4108-4115 - [i5]Jiongzhi Zheng, Jinghui Xue, Kun He, Chu-Min Li, Yanli Liu:
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. CoRR abs/2404.09997 (2024) - 2023
- [c5]Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He:
Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem. AAAI 2023: 4044-4051 - [i4]Jianrong Zhou, Shuo Ren, Kun He, Yanli Liu, Chu-Min Li:
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere. CoRR abs/2305.10023 (2023) - 2022
- [c4]Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu:
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. IJCAI 2022: 1908-1914 - [i3]Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu:
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. CoRR abs/2201.06252 (2022) - [i2]Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He:
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem. CoRR abs/2208.08620 (2022) - 2020
- [c3]Yanli Liu, Chu-Min Li, Hua Jiang, Kun He:
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems. AAAI 2020: 2392-2399
2010 – 2019
- 2019
- [i1]Yanli Liu, Chu-Min Li, Hua Jiang, Kun He:
A Learning based Branch and Bound for Maximum Common Subgraph Problems. CoRR abs/1905.05840 (2019) - 2018
- [j1]Chu-Min Li, Yanli Liu, Hua Jiang, Felip Manyà, Yu Li:
A new upper bound for the maximum weight clique problem. Eur. J. Oper. Res. 270(1): 66-77 (2018) - [c2]Hua Jiang, Chu-Min Li, Yanli Liu, Felip Manyà:
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. AAAI 2018: 1338-1346 - 2016
- [c1]Yanli Liu, Chumin Li, Kun He, Yi Fan:
Breaking Cycle Structure to Improve Lower Bound for Max-SAT. FAW 2016: 111-124
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-30 20:27 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:
