Yanli Liu

Orcid: 0000-0001-6734-2601

Affiliations:
  • Wuhan University of Science and Technology, Wuhan, China
  • Huazhong University of Science and Technology, Wuhan, China


According to our database1, Yanli Liu authored at least 9 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere.
CoRR, 2023

Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem.
CoRR, 2022

A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2020
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
A Learning based Branch and Bound for Maximum Common Subgraph Problems.
CoRR, 2019

2018
A new upper bound for the maximum weight clique problem.
Eur. J. Oper. Res., 2018

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2016
Breaking Cycle Structure to Improve Lower Bound for Max-SAT.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016


  Loading...