default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLih-Hsing Hsu
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j154]Tzu-Liang Kung, Hon-Chan Chen, Chia-Hui Lin, Lih-Hsing Hsu:
Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes. Comput. J. 64(1): 27-37 (2021)- 2020
- [j153]Eddie Cheng
, Lih-Hsing Hsu, Chun-Nan Hung, Meng-Chien Yang:
2-spanning cyclability problems of the some generalized Petersen graphs. Discuss. Math. Graph Theory 40(3): 713-731 (2020) - [j152]Cheng-Kuan Lin, Liang Ma, Jianxi Fan, Lih-Hsing Hsu, Yuan-Hsiang Teng:
The Conditional-(g, d, k)-Connectivity and Conditional-(g, d, k)-edge-Connectivity on the Hypercubes. Fundam. Informaticae 173(1): 33-45 (2020)
2010 – 2019
- 2019
- [c33]Tzu-Liang Kung, Lih-Hsing Hsu:
Theoretical analysis of shortest-path congestion unidirectional hypercubes*. SNPD 2019: 78-83 - 2018
- [j151]Chun-Nan Hung, Tao-Ming Wang, Lih-Hsing Hsu, Eddie Cheng:
Fault-Hamiltonicity of Cartesian products of directed cycles. Art Discret. Appl. Math. 1(1): #P1.06 (2018) - [j150]Hon-Chan Chen, Tzu-Liang Kung, Lih-Hsing Hsu:
An Augmented Pancyclicity Problem of Crossed Cubes. Comput. J. 61(1): 54-62 (2018) - [j149]Jeng-Jung Wang, Lih-Hsing Hsu:
On the spanning connectivity of the generalized Petersen graphs P(n,3). Discret. Math. 341(3): 672-690 (2018) - 2017
- [j148]Chun-Nan Hung, Cheng-Kuan Lin, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions. Parallel Process. Lett. 27(2): 1750005:1-1750005:25 (2017) - [c32]Chun-Nan Hung, Tzu-Liang Kung, Lih-Hsing Hsu, Kevin Chen, Shi Zhe Lai:
The Arcs Fault-Tolerance for 4-Pancyclic Properties of Unidirectional Hypercubes. ACIT/CSII/BCD 2017: 115-118 - 2016
- [c31]Meng-Chien Yang, Zi-Ting Xu, Lih-Hsing Hsu:
On Developing the Learning Game for Graph Theory: A New Design Model Considering the Learners' Reflexiveness. IIAI-AAI 2016: 418-422 - [c30]Tzu-Liang Kung, Chun-Nan Hung, Yuan-Hsiang Teng, Jui-Yu Hung, Lih-Hsing Hsu:
On the Robust Approach to Data Inconsistency Detection of Sensor Networks. IMIS 2016: 425-429 - [c29]Tzu-Liang Kung, Chun-Nan Hung, Cheng-Kuan Lin, Hsiang-Chun Chen, Chia-Hui Lin, Lih-Hsing Hsu:
A Framework of Cycle-Based Clustering on the Crossed Cube Architecture. IMIS 2016: 430-434 - 2015
- [j147]Eddie Cheng, László Lipták, Lih-Hsing Hsu, Jimmy J. M. Tan, Cheng-Kuan Lin:
Conditional Matching Preclusion For The Star Graphs. Ars Comb. 120: 369-382 (2015) - [j146]Chun-Nan Hung, Eddie Cheng, Tao-Ming Wang, Lih-Hsing Hsu:
On Hamiltonian properties of unidirectional hypercubes. Inf. Process. Lett. 115(6-8): 551-555 (2015) - 2014
- [j145]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Conditional Fault Hamiltonicity of the Star Graph. Ars Comb. 113: 111-127 (2014) - [j144]Lih-Hsing Hsu, Tung-Yang Ho, Yen-Hsun Ho, Chey-Woei Tsay:
Cycles in cube-connected cycles graphs. Discret. Appl. Math. 167: 163-171 (2014) - [j143]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant hamiltonian connectivity of the WK-recursive networks. Inf. Sci. 271: 236-245 (2014) - [j142]Tzu-Liang Kung, Cheng-Kuan Lin, Lih-Hsing Hsu:
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube. J. Comb. Optim. 27(2): 328-344 (2014) - [c28]Liang Ma, Jianxi Fan, Lih-Hsing Hsu, Cheng-Kuan Lin:
Conditional Connectivity with Distance Requirement on Hypercube. CSE 2014: 1277-1281 - [c27]Tzu-Liang Kung, Hon-Chan Chen, Lih-Hsing Hsu, Chi-Lun Wang:
Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition Networks. ICS 2014: 67-76 - 2013
- [j141]Cheng-Kuan Lin, Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu, Dragan Marusic:
The spanning laceability on the faulty bipartite hypercube-like networks. Appl. Math. Comput. 219(15): 8095-8103 (2013) - [j140]Shin-Shin Kao, Hua-Min Huang, Kung-Ming Hsu, Lih-Hsing Hsu:
Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs. Ars Comb. 110: 301-322 (2013) - [j139]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Tzu-Liang Kung:
Disjoint cycles in hypercubes with prescribed vertices in each cycle. Discret. Appl. Math. 161(18): 2992-3004 (2013) - [j138]Chun-Nan Hung, David Lu, Randy Jia, Cheng-Kuan Lin, László Lipták, Eddie Cheng, Jimmy J. M. Tan, Lih-Hsing Hsu:
4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4). Math. Comput. Model. 57(3-4): 595-601 (2013) - [j137]Cheng-Kuan Lin, Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model. IEEE Trans. Reliab. 62(4): 800-810 (2013) - 2012
- [j136]Shao-Lun Peng, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
The g-good-neighbor conditional diagnosability of hypercube under PMC model. Appl. Math. Comput. 218(21): 10406-10412 (2012) - [j135]Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
Super Spanning Connectivity of Augmented Cubes. Ars Comb. 104: 161-177 (2012) - [j134]Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs. Ars Comb. 105: 231-246 (2012) - [j133]Cheng-Kuan Lin, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Mutually Independent Hamiltonian Cycles in Some Graphs. Ars Comb. 106: 137-142 (2012) - [j132]Lih-Hsing Hsu, Jimmy J. M. Tan, Eddie Cheng, László Lipták, Cheng-Kuan Lin, Ming Tsai:
Solution to an open problem on 4-ordered Hamiltonian graphs. Discret. Math. 312(15): 2356-2370 (2012) - [j131]Lih-Hsing Hsu, Eddie Cheng, László Lipták, Jimmy J. M. Tan, Cheng-Kuan Lin, Tung-Yang Ho:
Component connectivity of the hypercubes. Int. J. Comput. Math. 89(2): 137-145 (2012) - [j130]Yuan-Hsiang Teng, Jimmy J. M. Tan, Chey-Woei Tsay, Lih-Hsing Hsu:
The paths embedding of the arrangement graphs with prescribed vertices in given position. J. Comb. Optim. 24(4): 627-646 (2012) - 2011
- [j129]Hon-Chan Chen, Tzu-Liang Kung, Lih-Hsing Hsu:
Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions. Appl. Math. Comput. 217(24): 10058-10065 (2011) - [j128]Po-Yi Huang, Lih-Hsing Hsu:
The spanning connectivity of line graphs. Appl. Math. Lett. 24(9): 1614-1617 (2011) - [j127]Yung-Ling Lai, Da-Chung Yu, Lih-Hsing Hsu:
Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(7): 1553-1557 (2011) - [j126]Tzu-Liang Kung, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-free mutually independent Hamiltonian cycles of faulty star graphs. Int. J. Comput. Math. 88(4): 731-746 (2011) - [j125]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the Extremal Number of Edges in Hamiltonian Graphs. J. Inf. Sci. Eng. 27(5): 1659-1665 (2011) - [j124]Ming Tsai, Tsung-Han Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu:
On 4-ordered 3-regular graphs. Math. Comput. Model. 54(5-6): 1613-1619 (2011) - [c26]Lih-Hsing Hsu, Cheng-Kuan Lin, Jimmy J. M. Tan, Chun-Nan Hung:
Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order. CSE 2011: 351-357 - 2010
- [j123]Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Mutually independent bipanconnected property of hypercube. Appl. Math. Comput. 217(8): 4017-4023 (2010) - [j122]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the extremal number of edges in hamiltonian connected graphs. Appl. Math. Lett. 23(1): 26-29 (2010) - [j121]Yuan-Hsiang Teng, Tzu-Liang Kung, Lih-Hsing Hsu:
The 3*-connected property of pyramid networks. Comput. Math. Appl. 60(8): 2360-2363 (2010) - [j120]Yuan-Kang Shih, Cheng-Kuan Lin, D. Frank Hsu, Jimmy J. M. Tan, Lih-Hsing Hsu:
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs. Int. J. Comput. Math. 87(10): 2212-2225 (2010) - [j119]Tzu-Liang Kung, Yuan-Hsiang Teng, Lih-Hsing Hsu:
The panpositionable panconnectedness of augmented cubes. Inf. Sci. 180(19): 3781-3793 (2010) - [j118]Cherng Chin, Huai-Chih Chen, Lih-Hsing Hsu, Shang-Chia Chiou, Kuo-Tung Lai:
Super Spanning Connectivity of the Fully Connected cubic Networks. J. Interconnect. Networks 11(1-2): 61-70 (2010) - [j117]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
On the Existence of Disjoint Spanning Paths in Faulty Hypercubes. J. Interconnect. Networks 11(1-2): 71-96 (2010) - [j116]David Sherman, Ming Tsai, Cheng-Kuan Lin, László Lipták, Eddie Cheng, Jimmy J. M. Tan, Lih-Hsing Hsu:
4-Ordered Hamiltonicity for Some Chordal Ring Graphs. J. Interconnect. Networks 11(3-4): 157-174 (2010) - [j115]Y-Chuang Chen, Yong-Zen Huang, Lih-Hsing Hsu, Jimmy J. M. Tan:
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance. J. Supercomput. 54(2): 229-238 (2010) - [c25]Cheng-Kuan Lin, Tzu-Liang Kung, Shao-Lun Peng, Jimmy J. M. Tan, Lih-Hsing Hsu:
The Diagnosability of g-good-neighbor Conditional-Faulty Hypercube under PMC Model. PDPTA 2010: 494-499 - [c24]Yuan-Hsiang Teng, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Two Spanning Disjoint Paths with Required Length in Arrangement Graphs. PDPTA 2010: 527-531
2000 – 2009
- 2009
- [j114]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
Mutually orthogonal hamiltonian connected graphs. Appl. Math. Lett. 22(9): 1429-1431 (2009) - [j113]Yuan-Kang Shih, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
The bipanpositionable bipancyclic property of the hypercube. Comput. Math. Appl. 58(9): 1722-1724 (2009) - [j112]Chung-Meng Lee, Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position. Comput. Math. Appl. 58(9): 1762-1768 (2009) - [j111]Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the spanning fan-connectivity of graphs. Discret. Appl. Math. 157(7): 1342-1348 (2009) - [j110]Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu:
Globally bi-3*-connected graphs. Discret. Math. 309(8): 1931-1946 (2009) - [j109]Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs. Discret. Math. 309(17): 5474-5483 (2009) - [j108]Cherng Chin, Tien-Hsiung Weng, Lih-Hsing Hsu, Shang-Chia Chiou:
The Spanning Connectivity of the Burnt Pancake Graphs. IEICE Trans. Inf. Syst. 92-D(3): 389-400 (2009) - [j107]Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks. Int. J. Comput. Math. 86(1): 57-66 (2009) - [j106]Tung-Yang Ho, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Conditional fault hamiltonian connectivity of the complete graph. Inf. Process. Lett. 109(12): 585-588 (2009) - [j105]Tz-Liang Kueng, Tyne Liang, Lih-Hsing Hsu, Jimmy J. M. Tan:
Long paths in hypercubes with conditional node-faults. Inf. Sci. 179(5): 667-681 (2009) - [j104]Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu:
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J. Comb. Optim. 17(3): 312-322 (2009) - [j103]Cheng-Kuan Lin, Chien-Ping Chang, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
A New Isomorphic Definition of the Crossed Cube and its Spanning Connectivity. J. Interconnect. Networks 10(1-2): 149-166 (2009) - [j102]Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-Tolerant Hamiltonian laceability and Fault-Tolerant Conditional Hamiltonian for Bipartite Hypercube-like Networks. J. Interconnect. Networks 10(3): 243-251 (2009) - [j101]Lun-Min Shih, Chieh-Feng Chiang, Lih-Hsing Hsu, Jimmy J. M. Tan:
Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transposition Trees. J. Interconnect. Networks 10(3): 253-260 (2009) - [j100]Guo-Huang Hsu, Chieh-Feng Chiang, Lun-Min Shih, Lih-Hsing Hsu, Jimmy J. M. Tan:
Conditional diagnosability of hypercubes under the comparison diagnosis model. J. Syst. Archit. 55(2): 140-146 (2009) - [j99]Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Embedding paths of variable lengths into hypercubes with conditional link-faults. Parallel Comput. 35(8-9): 441-454 (2009) - [j98]Tzu-Liang Kung, Cheng-Kuan Lin, Tyne Liang, Lih-Hsing Hsu, Jimmy J. M. Tan:
On the bipanpositionable bipanconnectedness of hypercubes. Theor. Comput. Sci. 410(8-10): 801-811 (2009) - [j97]Chung-Hao Chang, Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, Lih-Hsing Hsu:
The super spanning connectivity and super spanning laceability of the enhanced hypercubes. J. Supercomput. 48(1): 66-87 (2009) - [c23]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. ISPAN 2009: 592-595 - [c22]Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
The Mutually Independent Bipanconnected Property for Hypercube. ISPAN 2009: 606-609 - 2008
- [j96]Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant hamiltonian connectedness of cycle composition networks. Appl. Math. Comput. 196(1): 245-256 (2008) - [j95]Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
Panpositionable hamiltonicity and panconnectivity of the arrangement graphs. Appl. Math. Comput. 198(1): 414-432 (2008) - [j94]Ta-Cheng Mai, Jeng-Jung Wang, Lih-Hsing Hsu:
Hyper-Hamiltonian generalized Petersen graphs. Comput. Math. Appl. 55(9): 2076-2085 (2008) - [j93]Cheng-Kuan Lin, Hua-Min Huang, Jimmy J. M. Tan, Lih-Hsing Hsu:
On spanning connected graphs. Discret. Math. 308(7): 1330-1333 (2008) - [j92]Lun-Min Shih, Chieh-Feng Chiang, Lih-Hsing Hsu, Jimmy J. M. Tan:
Strong Menger connectivity with conditional faults on the class of hypercube-like networks. Inf. Process. Lett. 106(2): 64-69 (2008) - [j91]Chung-Meng Lee, Jimmy J. M. Tan, Lih-Hsing Hsu:
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position. Inf. Process. Lett. 107(5): 171-176 (2008) - [j90]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model. J. Interconnect. Networks 9(1/2): 83-97 (2008) - [j89]Tz-Liang Kueng, Tyne Liang, Lih-Hsing Hsu:
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs. Math. Comput. Model. 48(11-12): 1814-1825 (2008) - [c21]Tz-Liang Kueng, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu:
On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes. ISPAN 2008: 71-76 - [c20]Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs. ISPAN 2008: 151-158 - 2007
- [j88]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
On the spanning connectivity of graphs. Discret. Math. 307(2): 285-289 (2007) - [j87]Ken S. Hu, Shyun-Shyun Yeoh, Chiuyuan Chen, Lih-Hsing Hsu:
Node-pancyclicity and edge-pancyclicity of hypercube variants. Inf. Process. Lett. 102(1): 1-7 (2007) - [j86]Lun-Min Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Edge-bipancyclicity of conditional faulty hypercubes. Inf. Process. Lett. 105(1): 20-25 (2007) - [j85]Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
The globally Bi-3*-connected property of the honeycomb rectangular torus. Inf. Sci. 177(24): 5573-5589 (2007) - [j84]Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh:
Hamiltonicity of hypercubes with a constraint of required and faulty edges. J. Comb. Optim. 14(2-3): 197-204 (2007) - [j83]Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu:
On cubic 2-independent Hamiltonian connected graphs. J. Comb. Optim. 14(2-3): 275-294 (2007) - [j82]Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu:
On the equitable k *-laceability of hypercubes. J. Comb. Optim. 14(2-3): 349-364 (2007) - [j81]Chao-Ming Sun, Chun-Nan Hung, Hua-Min Huang, Lih-Hsing Hsu, Yue-Dar Jou:
Hamiltonian laceability of Faulty Hypercubes. J. Interconnect. Networks 8(2): 133-145 (2007) - [j80]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. J. Parallel Distributed Comput. 67(4): 362-368 (2007) - [j79]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Highly fault-tolerant cycle embeddings of hypercubes. J. Syst. Archit. 53(4): 227-232 (2007) - [j78]Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
Panpositionable hamiltonicity of the alternating group graphs. Networks 50(2): 146-156 (2007) - [j77]Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the spanning connectivity and spanning laceability of hypercube-like networks. Theor. Comput. Sci. 381(1-3): 218-229 (2007) - 2006
- [j76]Y-Chuang Chen, Lih-Hsing Hsu, Jimmy J. M. Tan:
A recursively construction scheme for super fault-tolerant hamiltonian graphs. Appl. Math. Comput. 177(2): 465-481 (2006) - [j75]Yuan-Hsiang Teng, Jimmy J. M. Tan, Tung-Yang Ho, Lih-Hsing Hsu:
On mutually independent hamiltonian paths. Appl. Math. Lett. 19(4): 345-350 (2006) - [j74]Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Panpositionable Hamiltonian Graphs. Ars Comb. 81 (2006) - [j73]Shin-Shin Kao, Kung-Ming Hsu, Lih-Hsing Hsu:
Cubic planar hamiltonian graphs of various types. Discret. Math. 306(13): 1364-1389 (2006) - [j72]Hong-Chun Hsu, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
The Spanning Connectivity of the (n, k)-star Graphs. Int. J. Found. Comput. Sci. 17(2): 415-434 (2006) - [j71]Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
On embedding cycles into faulty twisted cubes. Inf. Sci. 176(6): 676-690 (2006) - [j70]Chao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Mutually Independent Hamiltonian Paths and Cycles in Hypercubes. J. Interconnect. Networks 7(2): 235-256 (2006) - [j69]Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
On the spanning w-wide diameter of the star graph. Networks 48(4): 235-249 (2006) - [c19]Tung-Yang Ho, Po-Chun Kuo, Lih-Hsing Hsu:
The Globally Bi-3*-Connected Property of the Brother Trees. JCIS 2006 - 2005
- [j68]Shin-Shin Kao, Lih-Hsing Hsu:
Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs. Appl. Math. Comput. 160(1): 269-282 (2005) - [j67]Shin-Shin Kao, Lih-Hsing Hsu:
The globally bi-3* and hyper bi-3* connectedness of the spider web networks. Appl. Math. Comput. 170(1): 597-610 (2005) - [j66]Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu:
A note on edge fault tolerance with respect to hypercubes. Appl. Math. Lett. 18(10): 1125-1128 (2005) - [j65]Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-Tolerant Pancyclicity of the Möbius Cubes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 346-352 (2005) - [j64]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau:
Mutually independent hamiltonian paths in star networks. Networks 46(2): 110-117 (2005) - [j63]Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault hamiltonicity of augmented cubes. Parallel Comput. 31(1): 131-145 (2005) - [j62]Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
Honeycomb rectangular disks. Parallel Comput. 31(3-4): 371-388 (2005) - [j61]Pao-Lien Lai, Jimmy J. M. Tan, Chien-Ping Chang, Lih-Hsing Hsu:
Conditional Diagnosability Measures for Large Multiprocessor Systems. IEEE Trans. Computers 54(2): 165-175 (2005) - [j60]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
The super connectivity of the pancake graphs and the super laceability of the star graphs. Theor. Comput. Sci. 339(2-3): 257-271 (2005) - [c18]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Cycles in Highly Faulty Hypercubes. FCS 2005: 101-110 - 2004
- [j59]Y-Chuang Chen, Chang-Hsiung Tsai, Lih-Hsing Hsu, Jimmy J. M. Tan:
On some super fault-tolerant Hamiltonian graphs. Appl. Math. Comput. 148(3): 729-741 (2004) - [j58]Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu:
The super-connected property of recursive circulant graphs. Inf. Process. Lett. 91(6): 293-298 (2004) - [j57]Chung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
The super laceability of the hypercubes. Inf. Process. Lett. 92(1): 15-21 (2004) - [j56]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Hyper hamiltonian laceability on edge fault star graph. Inf. Sci. 165(1-2): 59-71 (2004) - [j55]Hong-Chun Hsu, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs. IEEE Trans. Computers 53(1): 39-53 (2004) - [j54]Pao-Lien Lai, Jimmy J. M. Tan, Chang-Hsiung Tsai, Lih-Hsing Hsu:
The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model. IEEE Trans. Computers 53(8): 1064-1069 (2004) - [j53]Chien-Ping Chang, Pao-Lien Lai, Jimmy J. M. Tan, Lih-Hsing Hsu:
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model. IEEE Trans. Computers 53(12): 1582-1590 (2004) - [c17]Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Ring Embedding in Faulty Augmented Cubes. ISPAN 2004: 155-161 - [c16]Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
The Spanning Diameter of the Star Graphs. ISPAN 2004: 551-556 - 2003
- [j52]Y-Chuang Chen, Jimmy J. M. Tan, Lih-Hsing Hsu, Shin-Shin Kao:
Super-connectivity and super-edge-connectivity for some interconnection networks. Appl. Math. Comput. 140(2-3): 245-254 (2003) - [j51]Shin-Shin Kao, Lih-Hsing Hsu:
Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs. Inf. Process. Lett. 86(5): 263-269 (2003) - [j50]Chun-Nan Hung, Hong-Chun Hsu, Kao-Yung Liang, Lih-Hsing Hsu:
Ring embedding in faulty pancake graphs. Inf. Process. Lett. 86(5): 271-275 (2003) - [j49]Tseng-Kuei Li, Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu:
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. Inf. Process. Lett. 87(2): 107-110 (2003) - [j48]Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant cycle-embedding of crossed cubes. Inf. Process. Lett. 88(4): 149-154 (2003) - [j47]Chang-Hsiung Tsai, Tyne Liang, Lih-Hsing Hsu, Men-Yang Lin:
Cycle embedding in faulty wrapped butterfly graphs. Networks 42(2): 85-96 (2003) - [j46]Hong-Chun Hsu, Yi-Lin Hsieh, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs. Networks 42(4): 189-201 (2003) - 2002
- [j45]Lih-Hsing Hsu:
A note on the ultimate categorical matching in a graph. Discret. Math. 256(1-2): 487-488 (2002) - [j44]Wen-Tzeng Huang, Yen-Chu Chuang, Jimmy Jiann-Mean Tan, Lih-Hsing Hsu:
On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(6): 1359-1370 (2002) - [j43]Chang-Hsiung Tsai, Jimmy J. M. Tan, Tyne Liang, Lih-Hsing Hsu:
Fault-tolerant hamiltonian laceability of hypercubes. Inf. Process. Lett. 83(6): 301-306 (2002) - [j42]Yen-Chu Chuang, Lih-Hsing Hsu, Chung-Haw Chang:
Optimal 1-edge fault-tolerant designs for ladders. Inf. Process. Lett. 84(2): 87-92 (2002) - [j41]Chang-Hsiung Tsai, Jimmy J. M. Tan, Yen-Chu Chuang, Lih-Hsing Hsu:
Hamiltonian Properties of Faulty Recursive Circulant Graphs. J. Interconnect. Networks 3(3-4): 273-289 (2002) - [j40]Wen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, Lih-Hsing Hsu:
Fault-Tolerant Hamiltonicity of Twisted Cubes. J. Parallel Distributed Comput. 62(4): 591-604 (2002) - [c15]Chien-Min Wang, Yomin Hou, Lih-Hsing Hsu:
Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes. Euro-Par 2002: 757-766 - [c14]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Hamiltonian laceability on edge fault star graph. ICPADS 2002: 23- - [c13]Chun-Nan Hung, Kao-Yung Liang, Lih-Hsing Hsu:
Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs. ISPAN 2002: 179-184 - 2001
- [j39]Chung-Haw Chang, Yen-Chu Chuang, Lih-Hsing Hsu:
Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs. Discret. Math. 240(1-3): 21-43 (2001) - [j38]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
The shuffle-cubes and their generalization. Inf. Process. Lett. 77(1): 35-41 (2001) - [j37]Jyh-Jian Sheu, Jimmy J. M. Tan, Lih-Hsing Hsu:
Routing properties of supercubes. Inf. Sci. 131(1-4): 107-128 (2001) - [j36]Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu:
A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n). J. Inf. Sci. Eng. 17(4): 535-548 (2001) - [j35]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
On the construction of combined k-fault-tolerant Hamiltonian graphs. Networks 37(3): 165-170 (2001) - [j34]Yomin Hou, Chien-Min Wang, Chiu-Yu Ku, Lih-Hsing Hsu:
Optimal Processor Mapping for Linear-Complement Communication on Hypercubes. IEEE Trans. Parallel Distributed Syst. 12(5): 514-527 (2001) - 2000
- [j33]Wen-Tzeng Huang, Yen-Chu Chuang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-Free Hamiltonian Cycle in Faulty Möbius Cubes. Computación y Sistemas 4(2): 106-114 (2000) - [j32]Ting-Yi Sung, Tung-Yang Ho, Chien-Ping Chang, Lih-Hsing Hsu:
Optimal k-Fault-Tolerant Networks for Token Rings. J. Inf. Sci. Eng. 16(3): 381-390 (2000) - [j31]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
Optimum Congested Routing Strategy on Twisted Cubes. J. Interconnect. Networks 1(2): 115-134 (2000) - [j30]Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
Construction schemes for fault-tolerant Hamiltonian graphs. Networks 35(3): 233-245 (2000) - [j29]Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu:
Edge Congestion and Topological Properties of Crossed Cubes. IEEE Trans. Parallel Distributed Syst. 11(1): 64-80 (2000) - [j28]Chun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu:
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks. IEEE Trans. Parallel Distributed Syst. 11(8): 864 (2000)
1990 – 1999
- 1999
- [j27]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings. Inf. Process. Lett. 72(1-2): 55-63 (1999) - [j26]Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang:
The correct diameter of trivalent Cayley graphs. Inf. Process. Lett. 72(3-4): 109-111 (1999) - [j25]Chien-Ping Chang, Jyh-Nan Wang, Lih-Hsing Hsu:
Topological Properties of Twisted Cube. Inf. Sci. 113(1-2): 147-167 (1999) - [j24]Jyh-Jian Sheu, Lih-Hsing Hsu:
Fault Diameter for Subercubes. Parallel Process. Lett. 9(1): 21-30 (1999) - 1998
- [j23]Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu:
Optimal 1-Hamiltonian Graphs. Inf. Process. Lett. 65(3): 157-161 (1998) - [j22]Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang, Lih-Hsing Hsu:
Fault Tolerant Token Ring Embedding in Double Loop Networks. Inf. Process. Lett. 66(4): 201-207 (1998) - [j21]Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu, Chang-Hsiung Tsai, Jeng-Yan Hwang:
The Recognition of Double Euler Trails in Series-Parallel Networks. J. Algorithms 28(2): 216-257 (1998) - [c12]Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin:
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. COCOON 1998: 269-278 - [c11]Yomin Hou, Chien-Min Wang, M.-J. Tsai, Lih-Hsing Hsu:
Broadcasting on Wormhole-Routed 2D Tori with Arbitrary Size. ICPADS 1998: 334-341 - [c10]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
Christmas Tree: A 1-Fault-Tolerant Network for Token Rings. ICPADS 1998: 383- - [c9]Yomin Hou, Chien-Min Wang, Lih-Hsing Hsu:
Depth Contention-free Broadcasting on Torus Networks. International Conference on Supercomputing 1998: 393-400 - 1997
- [j20]Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung:
Faithful 1-Edge Fault Tolerant Graphs. Inf. Process. Lett. 61(4): 173-181 (1997) - [j19]Jeng-Jung Wang, Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung:
Extended Tree Contraction for Some parallel Algorithms on Series-Parallel Networks. J. Inf. Sci. Eng. 13(4): 665-680 (1997) - [c8]Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu:
Projective Torus Networks. COCOON 1997: 451-459 - [c7]Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu:
A new shortest path routing algorithm and embedding cycles of crossed cube. ISPAN 1997: 125-131 - 1996
- [j18]Lih-Hsing Hsu:
A classification of graph capacity functions. J. Graph Theory 21(3): 251-265 (1996) - [j17]Shih-Yih Wang, Lih-Hsing Hsu:
Maximum and Minimum Matchings for Seriew-Parallel Networks. J. Inf. Sci. Eng. 12(1): 127-142 (1996) - [j16]Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung:
Transmitting on various network topologies. Networks 27(2): 145-157 (1996) - [j15]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
A response to Volgenant's Addendum on the most vital edges. Networks 27(4): 255 (1996) - [j14]Yung-Cheng Chang, Lih-Hsing Hsu:
On minimal cost-reliability ratio spanning trees and related problems. Oper. Res. Lett. 19(2): 65-69 (1996) - 1995
- [j13]Yung-Cheng Chang, Lih-Hsing Hsu:
Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives. Inf. Process. Lett. 53(1): 55-59 (1995) - 1994
- [j12]Tung-Yang Ho, Lih-Hsing Hsu:
A note on the minimum cut cover of graphs. Oper. Res. Lett. 15(4): 193-194 (1994) - [j11]Ray-Shyng Chou, Lih-Hsing Hsu:
1-Edge Fault-Tolerant designs for Meshes. Parallel Process. Lett. 4: 385-389 (1994) - [c6]Yung-Cheng Chang, Lih-Hsing Hsu:
Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives. IFIP Congress (1) 1994: 241-246 - 1993
- [j10]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
The most vital edges of matching in a bipartite graph. Networks 23(4): 309-313 (1993) - [j9]Lih-Hsing Hsu:
Matching Polynomials of Series-Parallel Graphs. Parallel Process. Lett. 3: 13-18 (1993) - 1992
- [j8]Rong-Hong Jan, Lih-Hsing Hsu, Yueh-Ying Lee:
The Most Vital Edges with Respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs. BIT 32(3): 403-412 (1992) - [j7]Lih-Hsing Hsu, Peng-Fei Wang, Chu-Tao Wu:
Parallel algorithms for finding the most vital edge with respect to minimum spanning tree. Parallel Comput. 18(10): 1143-1155 (1992) - [c5]Shih-Yih Wang, Lih-Hsing Hsu:
Maximum and Minimum Matchings for Series-Parallel Networks. ICCI 1992: 14-17 - [c4]Lih-Hsing Hsu, Peng-Fei Wang, Chu-Tao Wu:
Parallel Algorithms for Finding the Most Vital Edge with Respect to Minimum Spanning Tree. IFIP Congress (1) 1992: 284-290 - [c3]Ting-Yi Sung, Lih-Hsing Hsu, Jeng-Yan Hwang:
Data Structure for Graph Representations of a Network Having Double Euler Trails. IFIP Congress (1) 1992: 436-442 - 1991
- [j6]Lih-Hsing Hsu, Rong-Hong Jan, Yu-Che Lee, Chun-Nan Hung, Maw-Sheng Chern:
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs. Inf. Process. Lett. 39(5): 277-281 (1991) - [j5]Lih-Hsing Hsu, Shih-Yih Wang:
Maximum independent number for series-parallel networks. Networks 21(4): 457-468 (1991) - [c2]Lih-Hsing Hsu, Jones J. J. Wang:
Undordered Tree Contraction. ICCI 1991: 347-349 - [c1]Lih-Hsing Hsu, Jeng-Yan Hwang, Tung-Yang Ho, Chang-Hsiung Tsai:
A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks. ISA 1991: 316-325 - 1990
- [j4]Lih-Hsing Hsu:
Generalized homomorphism graph functions. Discret. Math. 84(1): 31-37 (1990)
1980 – 1989
- 1987
- [j3]Lih-Hsing Hsu, Chiuyuan Chen, En-Yih Jean:
A class of additive multiplicative graph functions. Discret. Math. 65(1): 53-63 (1987) - 1985
- [j2]Lih-Hsing Hsu:
Dependence of tree copy functions. Discret. Math. 55(3): 283-290 (1985) - 1983
- [j1]Lih-Hsing Hsu:
On a multiplicative graph function conjecture. Discret. Math. 45(2-3): 245-253 (1983)
Coauthor Index
[j152] [j148] [c29] [j147] [j145] [j143] [j142] [c28] [j141] [j139] [j138] [j137] [j136] [j135] [j134] [j133] [j132] [j131] [j126] [j125] [c26] [j122] [j120] [j117] [j116] [c25] [j114] [j113] [j111] [j109] [j107] [j104] [j103] [j102] [j99] [j98] [j97] [c23] [j96] [j93] [j90] [c20] [j88] [j77] [j74] [j72] [j70] [j69] [j64] [j60] [j57] [c16]
Jimmy Jiann-Mean Tan
aka: Jimmy J. M. Tan
aka: Jimmy J. M. Tan
[j147] [j145] [j143] [j141] [j139] [j138] [j137] [j136] [j135] [j133] [j132] [j131] [j130] [j126] [j125] [j124] [c26] [j123] [j122] [j120] [j117] [j116] [j115] [c25] [c24] [j114] [j113] [j112] [j111] [j109] [j107] [j106] [j105] [j104] [j103] [j102] [j101] [j100] [j99] [j98] [j97] [c23] [c22] [j96] [j95] [j93] [j92] [j91] [j90] [c21] [c20] [j86] [j85] [j80] [j79] [j78] [j77] [j76] [j75] [j71] [j65] [j63] [j62] [j61] [c18] [j59] [j58] [j56] [j55] [j54] [j53] [c17] [j52] [j49] [j48] [j46] [j44] [j43] [j41] [j40] [c14] [j38] [j37] [j33] [j31] [j30]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
