This map shows the geographic impact of W.F. Smyth'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 W.F. Smyth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites W.F. Smyth more than expected).
This network shows the impact of papers produced by W.F. Smyth. 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 W.F. Smyth. The network helps show where W.F. Smyth may publish in the future.
Co-authorship network of co-authors of W.F. Smyth
This figure shows the co-authorship network connecting the top 25 collaborators of W.F. Smyth.
A scholar is included among the top collaborators of W.F. Smyth 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 W.F. Smyth. W.F. Smyth is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Lin, You-Ru, et al.. (2008). Proceedings of the International Workshop on Combinatorial Algorithms 2007. Murdoch Research Repository (Murdoch University).5 indexed citations
5.
Smyth, W.F.. (2007). The maximum number of of runs in a string. Murdoch Research Repository (Murdoch University).1 indexed citations
6.
Koh, K.M., et al.. (2006). On optimal summable graphs. AKCE International Journal of Graphs and Combinatorics.1 indexed citations
Ryan, Patrick J., et al.. (2002). Verifying a border array in linear time. Journal of Combinatorial Mathematics and Combinatorial Computing.19 indexed citations
11.
Franěk, František, et al.. (1998). Repetitions in Sturmian Strings. Murdoch Research Repository (Murdoch University).1 indexed citations
12.
Miller, Mirka, Joe Ryan, Slamin Slamin, & W.F. Smyth. (1998). Labelling wheels for minimum sum number. Journal of Combinatorial Mathematics and Combinatorial Computing. 144. 106055–106055.12 indexed citations
13.
Iliopoulos, Costas S., et al.. (1998). The covers of a circular Fibonacci string. Journal of Combinatorial Mathematics and Combinatorial Computing.6 indexed citations
14.
Cummings, L. J. & W.F. Smyth. (1997). Weak repetitions in strings. Journal of Combinatorial Mathematics and Combinatorial Computing.20 indexed citations
Smyth, W.F., et al.. (1974). An algorithm for finding the diameter of a graph. Murdoch Research Repository (Murdoch University). 500–503.5 indexed citations
19.
Smyth, W.F., et al.. (1971). An improved algorithm for reducing the bandwidth of sparse symmetric matrices. Murdoch Research Repository (Murdoch University).1 indexed citations
20.
Smyth, W.F., et al.. (1971). An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices.. IFIP Congress. 1246–1250.28 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.