Chao Xu

13 papers A* 1B 1C 1Misc 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
An FPT Algorithm for Directed Co-Graph Edge Deletion.
Algorithms
Wenjun Li, Xueying Yang, Chao Xu, Yongjie Yang
2022 J jnl
A Refined Branching Algorithm for the Maximum Satisfiability Problem.
Algorithmica
Wenjun Li, Chao Xu, Yongjie Yang, Jianer Chen, Jianxin Wang
2021 J jnl
An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses.
J. Comb. Optim.
Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang
2019 A* conf
Resolution and Domination: An Improved Exact MaxSAT Algorithm.
IJCAI
Chao Xu, Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang
2019 J jnl
Resolution and linear CNF formulas: Improved (
Theor. Comput. Sci.
Chao Xu, Jianer Chen, Jianxin Wang
2017 — conf
An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations.
COCOA (2)
Wenjun Li, Chao Xu, Jianxin Wang, Yongjie Yang
2017 J jnl
Dealing with 4-variables by resolution: An improved MaxSAT algorithm.
Theor. Comput. Sci.
Jianer Chen, Chao Xu, Jianxin Wang
2015 J jnl
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.
J. Comb. Optim.
Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen
2015 J jnl
Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm.
CoRR
Jianer Chen, Chao Xu
2015 B conf
Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm.
WADS
Jianer Chen, Chao Xu, Jianxin Wang
2015 C conf
Improved MaxSAT Algorithms for Instances of Degree 3.
COCOA
Chao Xu, Jianer Chen, Jianxin Wang
2014 J jnl
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem.
Theor. Comput. Sci.
Qilong Feng, Jianxin Wang, Chao Xu, Jinyi Yao, Jianer Chen
2013 Misc conf
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs.
COCOON
Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen