key paper )
- J. Wu, "On Finding a Hamiltonian Path in a Tournament Using Semi-Heap," Parallel Processing Letters, Vol. 10, No. 4, 2000, 279-294.
- J. Wu and L. Sheng, "An Efficient Sorting Algorithm for a Sequence of Kings in a Tournament," Information Processing Letters, 79, 2001, 297-299.
- J. Wu and S. Olariu, "On Cost-Optimal Merge of Two Intransitive Sorted Sequences," International Journal of Foundations of Computer Science , Vol. 14, No. 1, Feb. 2003, 99-106.
- J. Shen, L. Sheng, and J. Wu, "Searching for Sorted Sequences of Kings in Tournaments," SIAM Journal of Computing, 32, 5, 2003, 1201-1209.