Lih‐Hsing Hsu

3.9k total citations
142 papers, 3.0k citations indexed

About

Lih‐Hsing Hsu is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Lih‐Hsing Hsu has authored 142 papers receiving a total of 3.0k indexed citations (citations by other indexed papers that have themselves been cited), including 115 papers in Computer Networks and Communications, 81 papers in Computational Theory and Mathematics and 58 papers in Electrical and Electronic Engineering. Recurrent topics in Lih‐Hsing Hsu's work include Interconnection Networks and Systems (112 papers), Advanced Graph Theory Research (72 papers) and graph theory and CDMA systems (25 papers). Lih‐Hsing Hsu is often cited by papers focused on Interconnection Networks and Systems (112 papers), Advanced Graph Theory Research (72 papers) and graph theory and CDMA systems (25 papers). Lih‐Hsing Hsu collaborates with scholars based in Taiwan, United States and China. Lih‐Hsing Hsu's co-authors include Jimmy J.M. Tan, Cheng‐Kuan Lin, J. Tan, Chien-Ping Chang, Pao-Lien Lai, Chang‐Hsiung Tsai, Chun‐Nan Hung, Ming-Chien Yang, Hong-Chun Hsu and Eddie Cheng and has published in prestigious journals such as Experimental Cell Research, Information Sciences and IEEE Transactions on Computers.

In The Last Decade

Lih‐Hsing Hsu

137 papers receiving 3.0k citations

Peers

Lih‐Hsing Hsu
Sun‐Yuan Hsieh Taiwan
Jimmy J.M. Tan Taiwan
Eddie Cheng United States
Cheng‐Kuan Lin Taiwan
Jianxi Fan China
Shiying Wang China
Shuming Zhou China
Jou–Ming Chang Taiwan
Dajin Wang United States
Limei Lin China
Sun‐Yuan Hsieh Taiwan
Lih‐Hsing Hsu
Citations per year, relative to Lih‐Hsing Hsu Lih‐Hsing Hsu (= 1×) peers Sun‐Yuan Hsieh

Countries citing papers authored by Lih‐Hsing Hsu

Since Specialization
Citations

This map shows the geographic impact of Lih‐Hsing Hsu'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 Lih‐Hsing Hsu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lih‐Hsing Hsu more than expected).

Fields of papers citing papers by Lih‐Hsing Hsu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lih‐Hsing Hsu. 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 Lih‐Hsing Hsu. The network helps show where Lih‐Hsing Hsu may publish in the future.

Co-authorship network of co-authors of Lih‐Hsing Hsu

This figure shows the co-authorship network connecting the top 25 collaborators of Lih‐Hsing Hsu. A scholar is included among the top collaborators of Lih‐Hsing Hsu 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 Lih‐Hsing Hsu. Lih‐Hsing Hsu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lin, Cheng‐Kuan, Jimmy J.M. Tan, Lih‐Hsing Hsu, Eddie Cheng, & László Lipták. (2014). Conditional Fault Hamiltonicity of the Star Graph. Ars Combinatoria. 113. 111–127. 1 indexed citations
2.
Hsu, Lih‐Hsing, et al.. (2013). Cycles in cube-connected cycles graphs. Discrete Applied Mathematics. 167. 163–171. 1 indexed citations
3.
Lin, Cheng‐Kuan, et al.. (2012). Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs. Ars Combinatoria. 105. 231–246. 3 indexed citations
4.
Hsu, Lih‐Hsing, et al.. (2012). Solution to an open problem on 4-ordered Hamiltonian graphs. Discrete Mathematics. 312(15). 2356–2370. 6 indexed citations
5.
Kung, Tzu-Liang, et al.. (2010). The 3∗-connected property of pyramid networks. Computers & Mathematics with Applications. 60(8). 2360–2363. 1 indexed citations
6.
Tsai, Tsung-Han, Tzu-Liang Kung, Jimmy J.M. Tan, & Lih‐Hsing Hsu. (2009). On the enhanced hyper-hamiltonian laceability of hypercubes. 62–67. 1 indexed citations
7.
Lin, Cheng‐Kuan, Jimmy J.M. Tan, D. Frank Hsu, & Lih‐Hsing Hsu. (2009). On the spanning fan-connectivity of graphs. Discrete Applied Mathematics. 157(7). 1342–1348. 9 indexed citations
8.
Lin, Cheng‐Kuan, et al.. (2009). Mutually independent hamiltonian cycles for the pancake graphs and the star graphs. Discrete Mathematics. 309(17). 5474–5483. 14 indexed citations
9.
Lin, Cheng‐Kuan, et al.. (2009). The bipanpositionable bipancyclic property of the hypercube. Computers & Mathematics with Applications. 58(9). 1722–1724. 1 indexed citations
10.
Hsu, Hong-Chun, et al.. (2008). Globally bi-3∗-connected graphs. Discrete Mathematics. 309(8). 1931–1946. 3 indexed citations
11.
Lin, Cheng‐Kuan, et al.. (2006). Panpositionable Hamiltonian Graphs.. Ars Combinatoria. 81. 5 indexed citations
12.
Lin, Cheng‐Kuan, et al.. (2006). On the spanning connectivity of graphs. Discrete Mathematics. 307(2). 285–289. 15 indexed citations
13.
Hsu, Lih‐Hsing, et al.. (2005). Hamiltonian Laceability of Spider Web Networks. 33(1). 1–10. 9 indexed citations
14.
Lin, Cheng‐Kuan, et al.. (2005). The super connectivity of the pancake graphs and the super laceability of the star graphs. Theoretical Computer Science. 339(2-3). 257–271. 46 indexed citations
15.
Huang, Wen‐Tzeng, et al.. (2002). On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(6). 1359–1370. 53 indexed citations
16.
Sung, Ting‐Yi, et al.. (2001). A Family of Trivalent 1-Hamiltonian Graphs With Diameter O(log n). Journal of information science and engineering. 17(4). 535–548. 1 indexed citations
17.
Sung, Ting‐Yi, et al.. (2000). Optimal k-fault-tolerant networks for token rings. Journal of information science and engineering. 16(3). 381–390. 3 indexed citations
18.
Huang, Wen‐Tzeng, et al.. (2000). Faul-Free Hamiltonian Cycle in Faulty Möbius Cubes. Computación y Sistemas. 4(2). 106–114. 25 indexed citations
19.
Hsu, Lih‐Hsing. (1996). A classification of graph capacity functions. Journal of Graph Theory. 21(3). 251–265. 1 indexed citations
20.
Hsu, Lih‐Hsing. (1981). Monotone multiplicative graph functions and dependence of tree copy functions. UMI Dissertation Information Service eBooks. 3 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Sun‐Yuan Hsieh Breakdown of academic impact, for papers by Jimmy J.M. Tan Breakdown of academic impact, for papers by Eddie Cheng Breakdown of academic impact, for papers by Cheng‐Kuan Lin Breakdown of academic impact, for papers by Jianxi Fan Breakdown of academic impact, for papers by Shiying Wang Breakdown of academic impact, for papers by Shuming Zhou Breakdown of academic impact, for papers by Jou–Ming Chang Breakdown of academic impact, for papers by Dajin Wang Breakdown of academic impact, for papers by Limei Lin
Rankless by CCL
2026