Yanli Liu

14 papers A* 4A 1Misc 1Journal 8
YearRankTypeTitle / Venue / Authors
2024 J jnl
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems.
CoRR
Jiongzhi Zheng, Jinghui Xue, Kun He, Chu-Min Li, Yanli Liu
2024 J jnl
An efficient solution space exploring and descent method for packing equal spheres in a sphere.
Comput. Oper. Res.
Jianrong Zhou, Shuo Ren, Kun He, Yanli Liu, Chu-Min Li
2024 A conf
DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems.
ECAI
Jinghui Xue, Jiongzhi Zheng, Kun He, Chu-Min Li, Yanli Liu
2024 J jnl
Enhancing cooperative evolution in spatial public goods game by particle swarm optimization based on exploration and q-learning.
Appl. Math. Comput.
Xianjia Wang, Zhipeng Yang, Guici Chen, Yanli Liu
2023 J jnl
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere.
CoRR
Jianrong Zhou, Shuo Ren, Kun He, Yanli Liu, Chu-Min Li
2023 A* conf
Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem.
AAAI
Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He
2022 A* conf
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.
IJCAI
Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu
2022 J jnl
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.
CoRR
Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu
2022 J jnl
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem.
CoRR
Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He
2020 A* conf
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems.
AAAI
Yanli Liu, Chu-Min Li, Hua Jiang, Kun He
2019 J jnl
A Learning based Branch and Bound for Maximum Common Subgraph Problems.
CoRR
Yanli Liu, Chu-Min Li, Hua Jiang, Kun He
2018 A* conf
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem.
AAAI
Hua Jiang, Chu-Min Li, Yanli Liu, Felip Manyà
2018 J jnl
A new upper bound for the maximum weight clique problem.
Eur. J. Oper. Res.
Chu-Min Li, Yanli Liu, Hua Jiang, Felip Manyà, Yu Li
2016 Misc conf
Breaking Cycle Structure to Improve Lower Bound for Max-SAT.
FAW
Yanli Liu, Chumin Li, Kun He, Yi Fan
2023 — conf
Not What You've Signed Up For: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection.
AISec
Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz
2026 — preprint
CCX: Enabling Unmodified Intel SGX Applications on Arm CCA.
arXiv
Matti Schulze, Thorsten Holz, Felix C. Freiling