Hung‐Lin Fu
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- graph theory and CDMA systems 60
-
- Advanced Graph Theory Research 44
- Graph Labeling and Dimension Problems 34
- Co-authors
- C. A. Rodger (14 shared papers)Chee Wei Tan (7 shared papers)Miwako Mishima (5 shared papers)Pei-Duo Yu (6 shared papers)Hongbin Chen (3 shared papers)Huilan Chang (5 shared papers)Frank K. Hwang (2 shared papers)Kenneth W. Shum (1 shared paper)
- Journals
- Discrete Mathematics (27 papers)Journal of Combinatorial Optimization (8 papers)Journal of Combinatorial Designs (8 papers)Graphs and Combinatorics (6 papers)Discrete Applied Mathematics (6 papers)
- Partner nations
- TaiwanUnited StatesChina
In The Last Decade
Hung‐Lin Fu
112 papers receiving 766 citations
Peers
Comparison fields: 5 of 60
- Discrete Mathematics and Combinatorics 220
- Computational Theory and Mathematics 352
- Geometry and Topology 101
- Artificial Intelligence 291
- Electrical and Electronic Engineering 432
Countries citing papers authored by Hung‐Lin Fu
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).
Fields of papers citing papers by Hung‐Lin Fu
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-authors
The 25 scholars most cited alongside Hung‐Lin Fu, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 122 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 35 | |
| 2 | 2009 | 32 | |
| 3 | 1997 | 27 | |
| 4 | 1998 | 27 | |
| 5 | 1997 | 25 | |
| 6 | 1994 | 23 | |
| 7 | 2010 | 23 | |
| 8 | 2004 | 22 | |
| 9 | 2007 | 22 | |
| 10 | 2022 | 21 | |
| 11 | 2000 | 21 | |
| 12 | Decomposing graphs into forests of paths with size less than three. | 1991 | 19 |
| 13 | The existence of group divisible designs with first and second associates, having block size 3 | 1999 | 19 |
| 14 | 2005 | 18 | |
| 15 | 2012 | 18 | |
| 16 | 2016 | 18 | |
| 17 | 2018 | 17 | |
| 18 | 2012 | 15 | |
| 19 | 2000 | 15 | |
| 20 | 2008 | 14 |
About Hung‐Lin Fu
Hung‐Lin Fu is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence and Geometry and Topology, having authored 122 papers that have together received 833 indexed citations. Recurring topics across this work include graph theory and CDMA systems (60 papers), Advanced Graph Theory Research (44 papers), Graph Labeling and Dimension Problems (34 papers), Coding theory and cryptography (25 papers), Limits and Structures in Graph Theory (24 papers), Finite Group Theory Research (19 papers), Graph theory and applications (16 papers) and Interconnection Networks and Systems (10 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (220 citations), Computational Theory and Mathematics (352 citations), Geometry and Topology (101 citations), Artificial Intelligence (291 citations) and Electrical and Electronic Engineering (432 citations). Hung‐Lin Fu has collaborated with scholars based in Taiwan, United States and China. Frequent co-authors include C. A. Rodger, Chee Wei Tan, Miwako Mishima, Pei-Duo Yu, Hongbin Chen, Huilan Chang, Frank K. Hwang, Kenneth W. Shum, F. K. Hwang and Gerard J. Chang. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Optimization, Journal of Combinatorial Designs, Graphs and Combinatorics and Discrete Applied Mathematics.
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.