Yiyuan Wang

Latest

• PathLAD+: Towards effective exact methods for subgraph isomorphism problem
• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism. Artif. Intell. 314: 103819 (2023)
• Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization
• PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem
• NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. J. Artif. Intell. Res. 72: 39-67 (2021)
• Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set. J. Artif. Intell. Res. 71: 89-119 (2021)
• Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search. CP 2021: 39:1-39:16
• NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem AAAI 2021: 12258-12266
• NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. IJCAI 2020: 1503-1510
• NuMWVC: A novel local search for minimum weighted vertex cover problem Oper. Res. Soc. 71(9): 1498-1509 (2020)
• Reduction and Local Search for Weighted Graph Coloring Problem
• SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem. Artif. Intell. 280: 103230 (2020)
• Two-goal Local Search and Inference Rules for Minimum Dominating Set 2020: 1467-1473
• A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs. IJCAI 2018: 1514-1522
• New heuristic approaches for maximum balanced biclique problem 432: 362-375 (2018)
• Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function.
• Two Efficient Local Search Algorithms for Maximum Weight Clique Problem