This map shows the geographic impact of K. B. Reid's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by K. B. Reid with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites K. B. Reid more than expected).
This network shows the impact of papers produced by K. B. Reid. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by K. B. Reid. The network helps show where K. B. Reid may publish in the future.
Co-authorship network of co-authors of K. B. Reid
This figure shows the co-authorship network connecting the top 25 collaborators of K. B. Reid.
A scholar is included among the top collaborators of K. B. Reid based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with K. B. Reid. K. B. Reid is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Beasley, LeRoy B., David E. Brown, & K. B. Reid. (2009). Extending partial tournaments. Mathematical and Computer Modelling. 50(1-2). 287–291.3 indexed citations
4.
Mulder, Henry Martyn, Michael J. Pelsmajer, & K. B. Reid. (2006). Generalized centrality in trees. Data Archiving and Networked Services (DANS).1 indexed citations
5.
Mulder, Henry Martyn, Michael J. Pelsmajer, & K. B. Reid. (2006). Axiomization of the center function on trees. RePEc: Research Papers in Economics. 41. 223–226.11 indexed citations
6.
Reid, K. B., Alice A. McRae, Sandra M. Hedetniemi, & Stephen T. Hedetniemi. (2004). Domination and irredundance in tournaments.. Australas. J Comb.. 29. 157–172.11 indexed citations
7.
Lundgren, J. Richard, et al.. (2004). Quadrangularity and Strong Quadrangularity in Tournaments. Australas. J Comb.. 34. 247–260.4 indexed citations
8.
Fisher, David, et al.. (2003). Domination Graphs of Tournaments with Isolated Vertices.. Ars Combinatoria. 66.4 indexed citations
9.
Reid, K. B.. (2002). Total relative displacement of vertex permutations of K n 1 , n 2 , …, n t. Journal of Graph Theory. 41(2). 85–100.3 indexed citations
Alspach, Brian, K. B. Reid, & David P. Roselle. (1974). Bypasses in asymmetric digraphs. Journal of Combinatorial Theory Series B. 17(1). 11–18.11 indexed citations
Mullin, Ronald C., K. B. Reid, & David P. Roselle. (1970). Proceedings of the second Louisiana Conference on Combinatorics, Graph Theory and Computing, Louisiana State University, Baton Rouge, March 8-11, 1971.4 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.