An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. - Yunlong Liu 001; Jianxin Wang 001; Chao Xu 010; Jiong Guo; Jianer Chen (COCOON, 2013)

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. - Qilong Feng; Jianxin Wang 001; Chao Xu 010; Jinyi Yao; Jianer Chen (Theor. Comput. Sci., 2014)

Improved MaxSAT Algorithms for Instances of Degree 3. - Chao Xu 010; Jianer Chen; Jianxin Wang 001 (COCOA, 2015)

Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm. - Jianer Chen; Chao Xu 010 (CoRR, 2015)

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. - Yunlong Liu 001; Jianxin Wang 001; Chao Xu 010; Jiong Guo; Jianer Chen (J. Comb. Optim., 2015)

An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations. - Wenjun Li 001; Chao Xu 010; Jianxin Wang 001; Yongjie Yang 001 (COCOA (2), 2017)

Dealing with 4-variables by resolution: An improved MaxSAT algorithm. - Jianer Chen; Chao Xu 010; Jianxin Wang 001 (Theor. Comput. Sci., 2017)

Resolution and Domination: An Improved Exact MaxSAT Algorithm. - Chao Xu 010; Wenjun Li 001; Yongjie Yang 001; Jianer Chen; Jianxin Wang 001 (IJCAI, 2019)

Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms. - Chao Xu 010; Jianer Chen; Jianxin Wang 001 (Theor. Comput. Sci., 2019)

An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses. - Chao Xu 010; Wenjun Li 001; Jianxin Wang 001; Yongjie Yang 001 (J. Comb. Optim., 2021)

A Refined Branching Algorithm for the Maximum Satisfiability Problem. - Wenjun Li 001; Chao Xu 010; Yongjie Yang 001; Jianer Chen; Jianxin Wang 001 (Algorithmica, 2022)

An FPT Algorithm for Directed Co-Graph Edge Deletion. - Wenjun Li 001; Xueying Yang; Chao Xu 010; Yongjie Yang 001 (Algorithms, 2024)