Jinkun Lin

最新

• CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. J. Artif. Intell. Res. 72: 39-67 (2021)
• AutoCCAG: An Automated Approach to Constrained Covering Array Generation ICSE 2021: 201-212
• FastCA: An Effective and Efficient Tool for Combinatorial Covering Array Generation ICSE (Companion Volume) 2021: 77-80
• NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. IJCAI 2020: 1503-1510
• WCA: A weighting local search for constrained combinatorial test optimization Inf. Softw. Technol. 122: 106288 (2020)
• Towards more efficient meta-heuristic algorithms for combinatorial test generation ESEC/SIGSOFT FSE 2019: 212-222
• Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018: 1412-1418
• A Reduction based Method for Coloring Very Large Graphs
• Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search and Preprocess
• Fast Solving Maximum Weight Clique Problem in Massive Graphs 568-574
• New local search methods for partial MaxSAT
• TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T). ASE 2015: 494-505
• Two Weighting Local Search for Minimum Vertex Cover