1. Finding scores in tournaments;Balasubramanian;J. Algorithms,1997
2. Complete subgraphs are elusive;Bollabas;J. Combin. Theory Ser. B,1976
3. P. Dey, Query complexity of tournament solutions, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, California, USA, 2017, pp. , 2992–2998.
4. D. Goyal, V. Jayapaul, V. Raman, Elusiveness of finding degrees, in: Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, Proceedings, 2017, pp. 242–253.
5. Searching for maximum out-degree vertices in tournaments;Gutin;Comput. Res. Repository CoRR,2018