The NPO-Completeness of the Longest Hamiltonian Cycle Problem. - Q. S. Wu; Kun-Mao Chao; Richard C. T. Lee (Inf. Process. Lett., 1998)

An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree. - Q. S. Wu; Chin Lung Lu; Richard C. T. Lee (ISAAC, 2000)

The Effects of Link and Node Capacity on Traffic Dynamics in Weighted Scale-Free Networks. - Mao-Bin Hu; R. Jiang; Y. H. Wu; Q. S. Wu (Complex (1), 2009)