已取得的研究工作成绩 近期发表的与项目有关的主要论文包括(其中本人以黑体加以强调,通讯作者以“*”标出): 会议: 1.Chao Xu, Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang: Resolution and Domination: An Improved Exact MaxSAT Algorithm. IJCAI 2019: 1191-1197(CCF-A类会议) 2.Chao Xu, Jianer Chen, Jianxin Wang: Improved MaxSAT Algorithms for Instances of Degree 3. COCOA 2015: 20-30 3.Jianer Chen, Chao Xu, Jianxin Wang: Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm. WADS 2015: 178-188 4.Wenjun Li, Chao Xu, Jianxin Wang, Yongjie Yang: An Improved Branching Algorithm for (n,3)-MaxSAT Based on Refined Observations. COCOA (2) 2017: 94-108 期刊: 1.Wenjun Li, Chao Xu, Yongjie Yang, Jianer Chen, Jianxin Wang: A Refined Branching Algorithm for the Maximum Satisfiability Problem. Algorithmica 84(4): 982-1006 (2022)(CCF-B类期刊) 2.Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang:An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses. J. Comb. Optim. 42(3): 524-542 (2021) 3.Chao Xu, Jianer Chen, Jianxin Wang: Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms. Theor. Comput. Sci. 774: 113-123 (2019)(CCF-B类期刊) 4.Jianer Chen, Chao Xu, Jianxin Wang: Dealing with 4-variables by resolution: An improved MaxSAT algorithm. Theor. Comput. Sci. 670: 33-44 (2017)(CCF-B类期刊) 5.Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen: An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. J. Comb. Optim. 29(1): 257-275 (2015) 6.Qilong Feng, Jianxin Wang, Chao Xu, Jinyi Yao, Jianer Chen: Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. Theor. Comput. Sci. 560: 158-171 (2014)(CCF-B类期刊) |