Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lih-Hsing Hsu
2010 – today
- 2013
[j134]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. Applied Mathematics and Computation 219(15): 8095-8103 (2013)- [j133]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)
- [j132]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) ☆. Mathematical and Computer Modelling 57(3-4): 595-601 (2013)
- 2012
- [j131]Shao-Lun Peng, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu: The g-good-neighbor conditional diagnosability of hypercube under PMC model. Applied Mathematics and Computation 218(21): 10406-10412 (2012)
- [j130]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)
- [j129]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)
- [j128]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)
- [j127]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. Discrete Mathematics 312(15): 2356-2370 (2012)
- [j126]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)
- [j125]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
- [j124]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. Applied Mathematics and Computation 217(24): 10058-10065 (2011)
- [j123]Po-Yi Huang, Lih-Hsing Hsu: The spanning connectivity of line graphs. Appl. Math. Lett. 24(9): 1614-1617 (2011)
- [j122]Yung-Ling Lai, Da-Chung Yu, Lih-Hsing Hsu: Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs. IEICE Transactions 94-A(7): 1553-1557 (2011)
- [j121]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)
- [j120]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)
- [j119]Ming Tsai, Tsung-Han Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu: On 4-ordered 3-regular graphs. Mathematical and Computer Modelling 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
- [j118]Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu: Mutually independent bipanconnected property of hypercube. Applied Mathematics and Computation 217(8): 4017-4023 (2010)
- [j117]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)
- [j116]Yuan-Hsiang Teng, Tzu-Liang Kung, Lih-Hsing Hsu: The 3*-connected property of pyramid networks. Computers & Mathematics with Applications 60(8): 2360-2363 (2010)
- [j115]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)
- [j114]Tzu-Liang Kung, Yuan-Hsiang Teng, Lih-Hsing Hsu: The panpositionable panconnectedness of augmented cubes. Inf. Sci. 180(19): 3781-3793 (2010)
- [j113]Cherng Chin, Huai-Chih Chen, Lih-Hsing Hsu, Shang-Chia Chiou, Kuo-Tung Lai: Super Spanning Connectivity of the Fully Connected cubic Networks. Journal of Interconnection Networks 11(1-2): 61-70 (2010)
- [j112]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. Journal of Interconnection Networks 11(1-2): 71-96 (2010)
- [j111]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. Journal of Interconnection Networks 11(3-4): 157-174 (2010)
- [j110]Y-Chuang Chen, Yong-Zen Huang, Lih-Hsing Hsu, Jimmy J. M. Tan: A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance. The Journal of Supercomputing 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
- [j109]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)
- [j108]Yuan-Kang Shih, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu: The bipanpositionable bipancyclic property of the hypercube. Computers & Mathematics with Applications 58(9): 1722-1724 (2009)
- [j107]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. Computers & Mathematics with Applications 58(9): 1762-1768 (2009)
- [j106]Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu: On the spanning fan-connectivity of graphs. Discrete Applied Mathematics 157(7): 1342-1348 (2009)
- [j105]Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu: Globally bi-3*-connected graphs. Discrete Mathematics 309(8): 1931-1946 (2009)
- [j104]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. Discrete Mathematics 309(17): 5474-5483 (2009)
- [j103]Cherng Chin, Tien-Hsiung Weng, Lih-Hsing Hsu, Shang-Chia Chiou: The Spanning Connectivity of the Burnt Pancake Graphs. IEICE Transactions 92-D(3): 389-400 (2009)
- [j102]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)
- [j101]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)
- [j100]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)
- [j99]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)
- [j98]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. Journal of Interconnection Networks 10(1-2): 149-166 (2009)
- [j97]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. Journal of Interconnection Networks 10(3): 243-251 (2009)
- [j96]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. Journal of Interconnection Networks 10(3): 253-260 (2009)
- [j95]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. Journal of Systems Architecture - Embedded Systems Design 55(2): 140-146 (2009)
- [j94]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 Computing 35(8-9): 441-454 (2009)
- [j93]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)
- [j92]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. The Journal of Supercomputing 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
- [j91]Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu: Fault-tolerant hamiltonian connectedness of cycle composition networks. Applied Mathematics and Computation 196(1): 245-256 (2008)
- [j90]Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu: Panpositionable hamiltonicity and panconnectivity of the arrangement graphs. Applied Mathematics and Computation 198(1): 414-432 (2008)
- [j89]Ta-Cheng Mai, Jeng-Jung Wang, Lih-Hsing Hsu: Hyper-Hamiltonian generalized Petersen graphs. Computers & Mathematics with Applications 55(9): 2076-2085 (2008)
- [j88]Cheng-Kuan Lin, Hua-Min Huang, Jimmy J. M. Tan, Lih-Hsing Hsu: On spanning connected graphs. Discrete Mathematics 308(7): 1330-1333 (2008)
- [j87]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)
- [j86]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)
- [j85]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. Journal of Interconnection Networks 9(1/2): 83-97 (2008)
- [j84]Tz-Liang Kueng, Tyne Liang, Lih-Hsing Hsu: Mutually independent hamiltonian cycles of binary wrapped butterfly graphs. Mathematical and Computer Modelling 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
- [j83]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: On the spanning connectivity of graphs. Discrete Mathematics 307(2): 285-289 (2007)
- [j82]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)
- [j81]Lun-Min Shih, Jimmy J. M. Tan, Lih-Hsing Hsu: Edge-bipancyclicity of conditional faulty hypercubes. Inf. Process. Lett. 105(1): 20-25 (2007)
- [j80]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)
- [j79]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)
- [j78]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)
- [j77]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)
- [j76]Chao-Ming Sun, Chun-Nan Hung, Hua-Min Huang, Lih-Hsing Hsu, Yue-Dar Jou: Hamiltonian laceability of Faulty Hypercubes. Journal of Interconnection Networks 8(2): 133-145 (2007)
- [j75]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu: Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. J. Parallel Distrib. Comput. 67(4): 362-368 (2007)
- [j74]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu: Highly fault-tolerant cycle embeddings of hypercubes. Journal of Systems Architecture 53(4): 227-232 (2007)
- [j73]Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu: Panpositionable hamiltonicity of the alternating group graphs. Networks 50(2): 146-156 (2007)
- [j72]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
- [j71]Y-Chuang Chen, Lih-Hsing Hsu, Jimmy J. M. Tan: A recursively construction scheme for super fault-tolerant hamiltonian graphs. Applied Mathematics and Computation 177(2): 465-481 (2006)
- [j70]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)
- [j69]Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: Panpositionable Hamiltonian Graphs. Ars Comb. 81 (2006)
- [j68]Shin-Shin Kao, Kung-Ming Hsu, Lih-Hsing Hsu: Cubic planar hamiltonian graphs of various types. Discrete Mathematics 306(13): 1364-1389 (2006)
- [j67]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)
- [j66]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)
- [j65]Chao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: Mutually Independent Hamiltonian Paths and Cycles in Hypercubes. Journal of Interconnection Networks 7(2): 235-256 (2006)
- [j64]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
- [j63]Shin-Shin Kao, Lih-Hsing Hsu: Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs. Applied Mathematics and Computation 160(1): 269-282 (2005)
- [j62]Shin-Shin Kao, Lih-Hsing Hsu: The globally bi-3* and hyper bi-3* connectedness of the spider web networks. Applied Mathematics and Computation 170(1): 597-610 (2005)
- [j61]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)
- [j60]Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu: Fault-Tolerant Pancyclicity of the Möbius Cubes. IEICE Transactions 88-A(1): 346-352 (2005)
- [j59]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau: Mutually independent hamiltonian paths in star networks. Networks 46(2): 110-117 (2005)
- [j58]Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu: Fault hamiltonicity of augmented cubes. Parallel Computing 31(1): 131-145 (2005)
- [j57]Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu: Honeycomb rectangular disks. Parallel Computing 31(3-4): 371-388 (2005)
- [j56]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)
- [j55]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
- [j54]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)
- [j53]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)
- [j52]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)
- [j51]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)
- [j50]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)
- [j49]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
- [j48]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)
- [j47]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)
- [j46]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)
- [j45]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)
- [j44]Chang-Hsiung Tsai, Tyne Liang, Lih-Hsing Hsu, Men-Yang Lin: Cycle embedding in faulty wrapped butterfly graphs. Networks 42(2): 85-96 (2003)
- [j43]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
- [j42]Lih-Hsing Hsu: A note on the ultimate categorical matching in a graph. Discrete Mathematics 256(1-2): 487-488 (2002)
- [j41]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)
- [j40]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)
- [j39]Chang-Hsiung Tsai, Jimmy J. M. Tan, Yen-Chu Chuang, Lih-Hsing Hsu: Hamiltonian Properties of Faulty Recursive Circulant Graphs. Journal of Interconnection Networks 3(3-4): 273-289 (2002)
- [j38]Wen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, Lih-Hsing Hsu: Fault-Tolerant Hamiltonicity of Twisted Cubes. J. Parallel Distrib. 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
- [j37]Chung-Haw Chang, Yen-Chu Chuang, Lih-Hsing Hsu: Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs. Discrete Mathematics 240(1-3): 21-43 (2001)
- [j36]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)
- [j35]Jyh-Jian Sheu, Jimmy J. M. Tan, Lih-Hsing Hsu: Routing properties of supercubes. Inf. Sci. 131(1-4): 107-128 (2001)
- [j34]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)
- [j33]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)
- [j32]Yomin Hou, Chien-Min Wang, Chiu-Yu Ku, Lih-Hsing Hsu: Optimal Processor Mapping for Linear-Complement Communication on Hypercubes. IEEE Trans. Parallel Distrib. Syst. 12(5): 514-527 (2001)
- 2000
- [j31]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)
- [j30]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)
- [j29]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung: Optimum Congested Routing Strategy on Twisted Cubes. Journal of Interconnection Networks 1(2): 115-134 (2000)
- [j28]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)
- [j27]Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu: Edge Congestion and Topological Properties of Crossed Cubes. IEEE Trans. Parallel Distrib. Syst. 11(1): 64-80 (2000)
- [j26]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 Distrib. Syst. 11(8): 864 (2000)
1990 – 1999
- 1999
- [j25]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)
- [j24]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)
- [j23]Chien-Ping Chang, Jyh-Nan Wang, Lih-Hsing Hsu: Topological Properties of Twisted Cube. Inf. Sci. 113(1-2): 147-167 (1999)
- [j22]Jyh-Jian Sheu, Lih-Hsing Hsu: Fault Diameter for Subercubes. Parallel Processing Letters 9(1): 21-30 (1999)
- 1998
- [j21]Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu: Optimal 1-Hamiltonian Graphs. Inf. Process. Lett. 65(3): 157-161 (1998)
- [j20]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)
- [j19]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
- [j18]Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung: Faithful 1-Edge Fault Tolerant Graphs. Inf. Process. Lett. 61(4): 173-181 (1997)
- [j17]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]
- [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
- [j16]Lih-Hsing Hsu: A classification of graph capacity functions. Journal of Graph Theory 21(3): 251-265 (1996)
- [j15]Shih-Yih Wang, Lih-Hsing Hsu: Maximum and Minimum Matchings for Seriew-Parallel Networks. J. Inf. Sci. Eng. 12(1): 127-142 (1996)
- [j14]Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung: Transmitting on various network topologies. Networks 27(2): 145-157 (1996)
- [j13]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)
- 1995
- [j12]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
- [j11]Ray-Shyng Chou, Lih-Hsing Hsu: 1-Edge Fault-Tolerant designs for Meshes. Parallel Processing Letters 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 Processing Letters 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 Computing 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]
- [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]
1980 – 1989
- 1987
- [j3]Lih-Hsing Hsu, Chiuyuan Chen, En-Yih Jean: A class of additive multiplicative graph functions. Discrete Mathematics 65(1): 53-63 (1987)
- 1985
- [j2]
- 1983
- [j1]Lih-Hsing Hsu: On a multiplicative graph function conjecture. Discrete Mathematics 45(2-3): 245-253 (1983)
Coauthor Index
[j134] [j132] [j131] [j130] [j128] [j127] [j126] [j125] [j121] [j120] [j119] [c26] [j118] [j117] [j115] [j112] [j111] [j110] [c25] [c24] [j109] [j108] [j107] [j106] [j104] [j102] [j101] [j100] [j99] [j98] [j97] [j96] [j95] [j94] [j93] [j92] [c23] [c22] [j91] [j90] [j88] [j87] [j86] [j85] [c21] [c20] [j81] [j80] [j75] [j74] [j73] [j72] [j71] [j70] [j66] [j60] [j58] [j57] [j56] [c18] [j54] [j52] [j51] [j50] [j49] [c17] [j46] [j45] [j43] [j41] [j39] [j38] [c14] [j36] [j35] [j31] [j29] [j28]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:18 CEST by the dblp team