| 2009 |
|---|
| 112 | EE | 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) |
| 111 | EE | 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) |
| 110 | EE | 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) |
| 109 | EE | 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) |
| 108 | EE | 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) |
| 2008 |
|---|
| 107 | EE | 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 |
| 106 | EE | 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 |
| 105 | EE | 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) |
| 104 | EE | 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) |
| 103 | EE | Cheng-Kuan Lin,
Hua-Min Huang,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
On spanning connected graphs.
Discrete Mathematics 308(7): 1330-1333 (2008) |
| 102 | EE | 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) |
| 101 | EE | 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) |
| 100 | EE | 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) |
| 2007 |
|---|
| 99 | EE | Cheng-Kuan Lin,
Hua-Min Huang,
Lih-Hsing Hsu:
On the spanning connectivity of graphs.
Discrete Mathematics 307(2): 285-289 (2007) |
| 98 | EE | 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) |
| 97 | EE | Lun-Min Shih,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
Edge-bipancyclicity of conditional faulty hypercubes.
Inf. Process. Lett. 105(1): 20-25 (2007) |
| 96 | EE | 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) |
| 95 | EE | 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) |
| 94 | EE | 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) |
| 93 | EE | 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) |
| 92 | EE | 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) |
| 91 | EE | 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) |
| 90 | EE | 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) |
| 89 | EE | Yuan-Hsiang Teng,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
Panpositionable hamiltonicity of the alternating group graphs.
Networks 50(2): 146-156 (2007) |
| 88 | EE | 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 |
|---|
| 87 | EE | Tung-Yang Ho,
Po-Chun Kuo,
Lih-Hsing Hsu:
The Globally Bi-3*-Connected Property of the Brother Trees.
JCIS 2006 |
| 86 | EE | 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) |
| 85 | EE | 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) |
| 84 | | Shin-Shin Kao,
Cheng-Kuan Lin,
Hua-Min Huang,
Lih-Hsing Hsu:
Panpositionable Hamiltonian Graphs.
Ars Comb. 81: (2006) |
| 83 | EE | Shin-Shin Kao,
Kung-Ming Hsu,
Lih-Hsing Hsu:
Cubic planar hamiltonian graphs of various types.
Discrete Mathematics 306(13): 1364-1389 (2006) |
| 82 | EE | 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) |
| 81 | EE | 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) |
| 80 | EE | 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) |
| 79 | EE | 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) |
| 2005 |
|---|
| 78 | | Ming-Chien Yang,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
Cycles in Highly Faulty Hypercubes.
FCS 2005: 101-110 |
| 77 | EE | 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) |
| 76 | EE | 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) |
| 75 | EE | 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) |
| 74 | EE | 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) |
| 73 | EE | 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) |
| 72 | EE | Cheng-Kuan Lin,
Hua-Min Huang,
Lih-Hsing Hsu,
Sheng Bau:
Mutually independent hamiltonian paths in star networks.
Networks 46(2): 110-117 (2005) |
| 71 | EE | 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) |
| 70 | EE | Yuan-Hsiang Teng,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
Honeycomb rectangular disks.
Parallel Computing 31(3-4): 371-388 (2005) |
| 69 | EE | 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) |
| 2004 |
|---|
| 68 | EE | Hong-Chun Hsu,
Liang-Chih Chiang,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
Ring Embedding in Faulty Augmented Cubes.
ISPAN 2004: 155-161 |
| 67 | EE | Cheng-Kuan Lin,
Hua-Min Huang,
D. Frank Hsu,
Lih-Hsing Hsu:
The Spanning Diameter of the Star Graphs.
ISPAN 2004: 551-556 |
| 66 | EE | 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) |
| 65 | EE | 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) |
| 64 | EE | 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) |
| 63 | EE | 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) |
| 62 | EE | 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) |
| 61 | EE | 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) |
| 2003 |
|---|
| 60 | EE | 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) |
| 59 | EE | 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) |
| 58 | EE | 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) |
| 57 | EE | 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) |
| 56 | EE | Chang-Hsiung Tsai,
Tyne Liang,
Lih-Hsing Hsu,
Men-Yang Lin:
Cycle embedding in faulty wrapped butterfly graphs.
Networks 42(2): 85-96 (2003) |
| 55 | EE | 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 |
|---|
| 54 | EE | Chien-Min Wang,
Yomin Hou,
Lih-Hsing Hsu:
Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes.
Euro-Par 2002: 757-766 |
| 53 | EE | Tseng-Kuei Li,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
Hamiltonian laceability on edge fault star graph.
ICPADS 2002: 23- |
| 52 | EE | Chun-Nan Hung,
Kao-Yung Liang,
Lih-Hsing Hsu:
Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs.
ISPAN 2002: 179-184 |
| 51 | EE | Lih-Hsing Hsu:
A note on the ultimate categorical matching in a graph.
Discrete Mathematics 256(1-2): 487-488 (2002) |
| 50 | EE | 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) |
| 49 | EE | 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) |
| 48 | EE | 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) |
| 47 | EE | 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) |
| 2001 |
|---|
| 46 | EE | 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) |
| 45 | EE | 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) |
| 44 | EE | 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) |
| 43 | | Jyh-Jian Sheu,
Jimmy J. M. Tan,
Lih-Hsing Hsu:
Routing properties of supercubes.
Inf. Sci. 131(1-4): 107-128 (2001) |
| 42 | EE | 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) |
| 41 | EE | 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) |
| 2000 |
|---|
| 40 | EE | 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) |
| 39 | EE | 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) |
| 38 | EE | 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) |
| 37 | EE | 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) |
| 36 | | 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) |
| 35 | EE | 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) |
| 1999 |
|---|
| 34 | EE | 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) |
| 33 | EE | 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) |
| 32 | | Chien-Ping Chang,
Jyh-Nan Wang,
Lih-Hsing Hsu:
Topological Properties of Twisted Cube.
Inf. Sci. 113(1-2): 147-167 (1999) |
| 31 | | Jyh-Jian Sheu,
Lih-Hsing Hsu:
Fault Diameter for Subercubes.
Parallel Processing Letters 9(1): 21-30 (1999) |
| 1998 |
|---|
| 30 | EE | 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 |
| 29 | EE | Yomin Hou,
Chien-Min Wang,
M.-J. Tsai,
Lih-Hsing Hsu:
Broadcasting on Wormhole-Routed 2D Tori with Arbitrary Size.
ICPADS 1998: 334-341 |
| 28 | EE | Chun-Nan Hung,
Lih-Hsing Hsu,
Ting-Yi Sung:
Christmas Tree: A 1-Fault-Tolerant Network for Token Rings.
ICPADS 1998: 383- |
| 27 | EE | Yomin Hou,
Chien-Min Wang,
Lih-Hsing Hsu:
Depth Contention-free Broadcasting on Torus Networks.
International Conference on Supercomputing 1998: 393-400 |
| 26 | EE | Jeng-Jung Wang,
Chun-Nan Hung,
Lih-Hsing Hsu:
Optimal 1-Hamiltonian Graphs.
Inf. Process. Lett. 65(3): 157-161 (1998) |
| 25 | EE | 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) |
| 24 | | 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) |
| 1997 |
|---|
| 23 | | Ting-Yi Sung,
Tung-Yang Ho,
Lih-Hsing Hsu:
Projective Torus Networks.
COCOON 1997: 451-459 |
| 22 | EE | 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 |
| 21 | EE | Shih-Yih Wang,
Lih-Hsing Hsu,
Ting-Yi Sung:
Faithful 1-Edge Fault Tolerant Graphs.
Inf. Process. Lett. 61(4): 173-181 (1997) |
| 20 | EE | 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) |
| 1996 |
|---|
| 19 | EE | Shih-Yih Wang,
Lih-Hsing Hsu:
Maximum and Minimum Matchings for Seriew-Parallel Networks.
J. Inf. Sci. Eng. 12(1): 127-142 (1996) |
| 18 | EE | Tung-Yang Ho,
Lih-Hsing Hsu,
Ting-Yi Sung:
Transmitting on various network topologies.
Networks 27(2): 145-157 (1996) |
| 17 | EE | 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 |
|---|
| 16 | EE | 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 |
|---|
| 15 | | Yung-Cheng Chang,
Lih-Hsing Hsu:
Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives.
IFIP Congress (1) 1994: 241-246 |
| 14 | | Ray-Shyng Chou,
Lih-Hsing Hsu:
1-Edge Fault-Tolerant designs for Meshes.
Parallel Processing Letters 4: 385-389 (1994) |
| 1993 |
|---|
| 13 | | Lih-Hsing Hsu:
Matching Polynomials of Series-Parallel Graphs.
Parallel Processing Letters 3: 13-18 (1993) |
| 1992 |
|---|
| 12 | | Shih-Yih Wang,
Lih-Hsing Hsu:
Maximum and Minimum Matchings for Series-Parallel Networks.
ICCI 1992: 14-17 |
| 11 | | 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 |
| 10 | | 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 |
| 9 | | 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) |
| 8 | | 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) |
| 1991 |
|---|
| 7 | | Lih-Hsing Hsu,
Jones J. J. Wang:
Undordered Tree Contraction.
ICCI 1991: 347-349 |
| 6 | | 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 |
| 5 | | 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) |
| 1990 |
|---|
| 4 | EE | Lih-Hsing Hsu:
Generalized homomorphism graph functions.
Discrete Mathematics 84(1): 31-37 (1990) |
| 1987 |
|---|
| 3 | EE | Lih-Hsing Hsu,
Chiuyuan Chen,
En-Yih Jean:
A class of additive multiplicative graph functions.
Discrete Mathematics 65(1): 53-63 (1987) |
| 1985 |
|---|
| 2 | EE | Lih-Hsing Hsu:
Dependence of tree copy functions.
Discrete Mathematics 55(3): 283-290 (1985) |
| 1983 |
|---|
| 1 | EE | Lih-Hsing Hsu:
On a multiplicative graph function conjecture.
Discrete Mathematics 45(2-3): 245-253 (1983) |
