A sufficient condition for graphs with large neighborhood unions to be traceable. - Shijun Ren (Discret. Math., 1996)

An improved ACO metaheuristic for solving the MCP. - Shijun Ren; Yadong Wang (ICNC, 2010)

A proof of the convergence theorem of maximum-entropy clustering algorithm. - Shijun Ren; Yadong Wang (Sci. China Inf. Sci., 2010)