OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Margin of victory for tournament solutions
Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong
Artificial Intelligence (2021) Vol. 302, pp. 103600-103600
Open Access | Times Cited: 6

Showing 6 citing articles:

Query complexity of tournament solutions
Arnab Maiti, Palash Dey
Theoretical Computer Science (2024) Vol. 991, pp. 114422-114422
Open Access | Times Cited: 3

Fixing knockout tournaments with seeds
Pasin Manurangsi, Warut Suksompong
Discrete Applied Mathematics (2023) Vol. 339, pp. 21-35
Open Access | Times Cited: 5

Generalized kings and single-elimination winners in random tournaments
Pasin Manurangsi, Warut Suksompong
Autonomous Agents and Multi-Agent Systems (2022) Vol. 36, Iss. 2
Open Access | Times Cited: 3

A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, et al.
(2022), pp. 1-10
Open Access | Times Cited: 3

A refined complexity analysis of fair districting over graphs
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
Autonomous Agents and Multi-Agent Systems (2022) Vol. 37, Iss. 1
Open Access | Times Cited: 1

Page 1

Scroll to top