A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. - Wen Qi Huang 001; Yu Li 012; Bernard Jurkowiak; Chu Min Li 001; Ru Chu Xu (CP, 2003)

Greedy algorithms for packing unequal circles into a rectangular container. - Wen Qi Huang 001; Yu Li 012; Hakim Akeb; Chu Min Li 001 (J. Oper. Res. Soc., 2005)

New heuristics for packing unequal circles into a circular container. - Wen Qi Huang 001; Yu Li 012; Chu Min Li 001; Ru Chu Xu (Comput. Oper. Res., 2006)

Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation). - Chu Min Li 001; Yu Li 012 (SAT, 2012)

Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation). - Chu Min Li 001; Wanxia Wei; Yu Li 012 (SAT, 2012)

A new upper bound for the maximum weight clique problem. - Chu-Min Li 001; Yanli Liu 001; Hua Jiang; Felip Manyà; Yu Li 012 (Eur. J. Oper. Res., 2018)

A branching heuristic for SAT solvers based on complete implication graphs. - Fan Xiao; Chu-Min Li 001; Mao Luo; Felip Manyà; Zhipeng Lü; Yu Li 012 (Sci. China Inf. Sci., 2019)

Clause vivification by unit propagation in CDCL SAT solvers. - Chu-Min Li 001; Fan Xiao; Mao Luo; Felip Manyà; Zhipeng Lü; Yu Li 012 (Artif. Intell., 2020)