This map shows the geographic impact of Hung‐Lin Fu'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 Hung‐Lin Fu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hung‐Lin Fu more than expected).
This network shows the impact of papers produced by Hung‐Lin Fu. 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 Hung‐Lin Fu. The network helps show where Hung‐Lin Fu may publish in the future.
Co-authorship network of co-authors of Hung‐Lin Fu
This figure shows the co-authorship network connecting the top 25 collaborators of Hung‐Lin Fu.
A scholar is included among the top collaborators of Hung‐Lin Fu 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 Hung‐Lin Fu. Hung‐Lin Fu is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Fu, Hung‐Lin, et al.. (1999). The existence of group divisible designs with first and second associates, having block size 3. Ars Combinatoria. 54. 33–50.16 indexed citations
Fu, Hung‐Lin, et al.. (1996). The maximum genus of diameter three graphs. The Australasian Journal of Combinatorics. 14. 187–197.3 indexed citations
19.
Fu, Hung‐Lin, et al.. (1991). Decomposing graphs into forests of paths with size less than three.. Australas. J Comb.. 3. 55–74.19 indexed citations
20.
Fu, Hung‐Lin, et al.. (1989). The intersection of three distinct latin squares. SHILAP Revista de lepidopterología.2 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.