Sorting a Sequence of Strong Kings in a Tournament
Ting-Yem Ho and Jou-Ming Chang
Information Processing Letters, Vol. 87, No. 6, (2003) pp. 317-320.

The above article has been cited by the articles listed below.
  1. Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe, The complexity of kings, Research Reports on Mathematical and Computing Sciences, Aug 2005 C-213. (arXiv e-print archive, cs.CC/0506055, Jun 2005.)

  2. An-Hang Chen, Jou-Ming Chang, Yuwen Cheng, Yue-Li Wang, The existence and uniqueness of strong kings in tournaments, Discrete Mathematics 308 (2008) 2629-2633. (*)

  3. Nathan Muyinda, Bernard De Baets, Shodhan Rao, Non-king elimination, intransitive triad interactions, and species coexistence in ecological competition networks, Theoretical Ecology. (*)

  4. Ziad Ismaili Alaoui, Nikhil Mande, Hardness of finding kings and strong kings, 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025), Dec. 17-19, 2025, BITS Pilani, K K Birla Goa Campus, India. LIPIcs 360 (2025) 36 (*)

Times cited: 3 (from Web of Science)