| Fast Solving Maximum Weight Clique Problem in Massive Graphs. S Cai, J Lin IJCAI, 568-574, 2016 | 78 | 2016 |
| TCA: An efficient two-mode meta-heuristic algorithm for combinatorial test generation (T) J Lin, C Luo, S Cai, K Su, D Hao, L Zhang 2015 30th IEEE/ACM International Conference on Automated Software …, 2015 | 76 | 2015 |
| Finding a small vertex cover in massive sparse graphs: Construct, local search, and preprocess S Cai, J Lin, C Luo Journal of Artificial Intelligence Research 59, 463-494, 2017 | 52 | 2017 |
| New local search methods for partial MaxSAT S Cai, C Luo, J Lin, K Su Artificial Intelligence 240, 1-18, 2016 | 47 | 2016 |
| A Reduction based Method for Coloring Very Large Graphs. J Lin, S Cai, C Luo, K Su IJCAI, 517-523, 2017 | 44 | 2017 |
| Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies. S Cai, W Hou, J Lin, Y Li IJCAI, 1412-1418, 2018 | 40 | 2018 |
| Two weighting local search for minimum vertex cover S Cai, J Lin, K Su Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 30 | 2015 |
| AutoCCAG: An automated approach to constrained covering array generation C Luo, J Lin, S Cai, X Chen, B He, B Qiao, P Zhao, Q Lin, H Zhang, W Wu, ... 2021 IEEE/ACM 43rd international conference on software engineering (ICSE …, 2021 | 20 | 2021 |
| Towards more efficient meta-heuristic algorithms for combinatorial test generation J Lin, S Cai, C Luo, Q Lin, H Zhang Proceedings of the 2019 27th ACM joint meeting on European Software …, 2019 | 20 | 2019 |
| WCA: A weighting local search for constrained combinatorial test optimization Y Fu, Z Lei, S Cai, J Lin, H Wang Information and Software Technology 122, 106288, 2020 | 16 | 2020 |
| LS-sampling: an effective local search based sampling approach for achieving high t-wise coverage C Luo, B Sun, B Qiao, J Chen, H Zhang, J Lin, Q Lin, D Zhang Proceedings of the 29th ACM Joint Meeting on European Software Engineering …, 2021 | 14 | 2021 |
| Nucds: An efficient local search algorithm for minimum connected dominating set B Li, X Zhang, S Cai, J Lin, Y Wang, C Blum Proceedings of the Twenty-Ninth International Conference on International …, 2021 | 13 | 2021 |
| A semi-exact algorithm for quickly computing a maximum weight clique in large sparse graphs S Cai, J Lin, Y Wang, D Strash Journal of Artificial Intelligence Research 72, 39-67, 2021 | 9 | 2021 |
| CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays Q Zhao, C Luo, S Cai, W Wu, J Lin, H Zhang, C Hu Proceedings of the 31st ACM Joint European Software Engineering Conference …, 2023 | 4 | 2023 |
| FastCA: An effective and efficient tool for combinatorial covering array generation J Lin, S Cai, B He, Y Fu, C Luo, Q Lin 2021 IEEE/ACM 43rd International Conference on Software Engineering …, 2021 | 4 | 2021 |
| New Characterizations and Efficient Local Search for General Integer Linear Programming P Lin, S Cai, M Zou, J Lin arXiv preprint arXiv:2305.00188, 2023 | 3 | 2023 |
| Solving the t-Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling C Luo, J Song, Q Zhao, B Sun, J Chen, H Zhang, J Lin, C Hu ACM Transactions on Software Engineering and Methodology 34 (1), 1-64, 2024 | 1 | 2024 |
| Heuristic Search with Cut Point Based Strategy for Critical Node Problem ZH Chen, SW Cai, J Gao, SK Ge, CJ Liu, JK Lin Journal of Computer Science and Technology 39 (6), 1328-1340, 2024 | | 2024 |
| Local Search for Integer Linear Programming. P Lin, S Cai, M Zou, J Lin CoRR, 2023 | | 2023 |
Shaowei CaiInstitute of Software, Chinese Academy of Sciences確認したメール アドレス: ios.ac.cn