The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lih-Hsing Hsu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu
    Projective Torus Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:451-459 [Conf]
  2. Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin
    A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:269-278 [Conf]
  3. Chien-Min Wang, Yomin Hou, Lih-Hsing Hsu
    Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:757-766 [Conf]
  4. Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Cycles in Highly Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    FCS, 2005, pp:101-110 [Conf]
  5. Lih-Hsing Hsu, Jones J. J. Wang
    Undordered Tree Contraction. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:347-349 [Conf]
  6. Shih-Yih Wang, Lih-Hsing Hsu
    Maximum and Minimum Matchings for Series-Parallel Networks. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:14-17 [Conf]
  7. Yomin Hou, Chien-Min Wang, M.-J. Tsai, Lih-Hsing Hsu
    Broadcasting on Wormhole-Routed 2D Tori with Arbitrary Size. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1998, pp:334-341 [Conf]
  8. Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
    Christmas Tree: A 1-Fault-Tolerant Network for Token Rings. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1998, pp:383-0 [Conf]
  9. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Hamiltonian laceability on edge fault star graph. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2002, pp:23-0 [Conf]
  10. Yomin Hou, Chien-Min Wang, Lih-Hsing Hsu
    Depth Contention-free Broadcasting on Torus Networks. [Citation Graph (0, 0)][DBLP]
    International Conference on Supercomputing, 1998, pp:393-400 [Conf]
  11. Yung-Cheng Chang, Lih-Hsing Hsu
    Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:241-246 [Conf]
  12. Lih-Hsing Hsu, Peng-Fei Wang, Chu-Tao Wu
    Parallel Algorithms for Finding the Most Vital Edge with Respect to Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:284-290 [Conf]
  13. Ting-Yi Sung, Lih-Hsing Hsu, Jeng-Yan Hwang
    Data Structure for Graph Representations of a Network Having Double Euler Trails. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:436-442 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:316-325 [Conf]
  15. Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Ring Embedding in Faulty Augmented Cubes. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:155-161 [Conf]
  16. Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu
    A new shortest path routing algorithm and embedding cycles of crossed cube. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:125-131 [Conf]
  17. Chun-Nan Hung, Kao-Yung Liang, Lih-Hsing Hsu
    Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:179-184 [Conf]
  18. Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu
    The Spanning Diameter of the Star Graphs. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:551-556 [Conf]
  19. Tung-Yang Ho, Po-Chun Kuo, Lih-Hsing Hsu
    The Globally Bi-3*-Connected Property of the Brother Trees. [Citation Graph (0, 0)][DBLP]
    JCIS, 2006, pp:- [Conf]
  20. Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu
    A note on edge fault tolerance with respect to hypercubes. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2005, v:18, n:10, pp:1125-1128 [Journal]
  21. Yuan-Hsiang Teng, Jimmy J. M. Tan, Tung-Yang Ho, Lih-Hsing Hsu
    On mutually independent hamiltonian paths. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:4, pp:345-350 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:3, pp:403-412 [Journal]
  23. Wen-Tzeng Huang, Yen-Chu Chuang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault-Free Hamiltonian Cycle in Faulty Möbius Cubes. [Citation Graph (0, 0)][DBLP]
    Computación y Sistemas, 2000, v:4, n:2, pp:106-114 [Journal]
  24. Chung-Haw Chang, Yen-Chu Chuang, Lih-Hsing Hsu
    Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:21-43 [Journal]
  25. Lih-Hsing Hsu
    A note on the ultimate categorical matching in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:487-488 [Journal]
  26. Shin-Shin Kao, Kung-Ming Hsu, Lih-Hsing Hsu
    Cubic planar hamiltonian graphs of various types. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:13, pp:1364-1389 [Journal]
  27. Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
    On the spanning connectivity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:285-289 [Journal]
  28. Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault-Tolerant Pancyclicity of the Möbius Cubes. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:1, pp:346-352 [Journal]
  29. Hong-Chun Hsu, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
    The Spanning Connectivity of the (n, k)-star Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:2, pp:415-434 [Journal]
  30. Yung-Cheng Chang, Lih-Hsing Hsu
    Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:1, pp:55-59 [Journal]
  31. Chung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
    The super laceability of the hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:1, pp:15-21 [Journal]
  32. Yen-Chu Chuang, Lih-Hsing Hsu, Chung-Haw Chang
    Optimal 1-edge fault-tolerant designs for ladders. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:2, pp:87-92 [Journal]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:5, pp:277-281 [Journal]
  34. Chun-Nan Hung, Hong-Chun Hsu, Kao-Yung Liang, Lih-Hsing Hsu
    Ring embedding in faulty pancake graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:5, pp:271-275 [Journal]
  35. Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
    Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:1-2, pp:55-63 [Journal]
  36. Shin-Shin Kao, Lih-Hsing Hsu
    Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:5, pp:263-269 [Journal]
  37. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung
    The shuffle-cubes and their generalization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:35-41 [Journal]
  38. Tseng-Kuei Li, Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu
    Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:107-110 [Journal]
  39. Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang, Lih-Hsing Hsu
    Fault Tolerant Token Ring Embedding in Double Loop Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:201-207 [Journal]
  40. Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang
    The correct diameter of trivalent Cayley graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:109-111 [Journal]
  41. Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu
    The super-connected property of recursive circulant graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:6, pp:293-298 [Journal]
  42. Chang-Hsiung Tsai, Jimmy J. M. Tan, Tyne Liang, Lih-Hsing Hsu
    Fault-tolerant hamiltonian laceability of hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:6, pp:301-306 [Journal]
  43. Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu
    Optimal 1-Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:157-161 [Journal]
  44. Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung
    Faithful 1-Edge Fault Tolerant Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:4, pp:173-181 [Journal]
  45. Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault-tolerant cycle-embedding of crossed cubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:4, pp:149-154 [Journal]
  46. Ken S. Hu, Shyun-Shyun Yeoh, Chiuyuan Chen, Lih-Hsing Hsu
    Node-pancyclicity and edge-pancyclicity of hypercube variants. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:1, pp:1-7 [Journal]
  47. Chien-Ping Chang, Jyh-Nan Wang, Lih-Hsing Hsu
    Topological Properties of Twisted Cube. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:113, n:1-2, pp:147-167 [Journal]
  48. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Hyper hamiltonian laceability on edge fault star graph. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2004, v:165, n:1-2, pp:59-71 [Journal]
  49. Jyh-Jian Sheu, Jimmy J. M. Tan, Lih-Hsing Hsu
    Routing properties of supercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:131, n:1-4, pp:107-128 [Journal]
  50. Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    On embedding cycles into faulty twisted cubes. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2006, v:176, n:6, pp:676-690 [Journal]
  51. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:216-257 [Journal]
  52. Ting-Yi Sung, Tung-Yang Ho, Chien-Ping Chang, Lih-Hsing Hsu
    Optimal k-Fault-Tolerant Networks for Token Rings. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2000, v:16, n:3, pp:381-390 [Journal]
  53. Shih-Yih Wang, Lih-Hsing Hsu
    Maximum and Minimum Matchings for Seriew-Parallel Networks. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 1996, v:12, n:1, pp:127-142 [Journal]
  54. Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu
    A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n). [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2001, v:17, n:4, pp:535-548 [Journal]
  55. Jeng-Jung Wang, Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung
    Extended Tree Contraction for Some parallel Algorithms on Series-Parallel Networks. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 1997, v:13, n:4, pp:665-680 [Journal]
  56. Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung
    Optimum Congested Routing Strategy on Twisted Cubes. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:2, pp:115-134 [Journal]
  57. Chao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
    Mutually Independent Hamiltonian Paths and Cycles in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2006, v:7, n:2, pp:235-256 [Journal]
  58. Chang-Hsiung Tsai, Jimmy J. M. Tan, Yen-Chu Chuang, Lih-Hsing Hsu
    Hamiltonian Properties of Faulty Recursive Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:3-4, pp:273-289 [Journal]
  59. Wen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, Lih-Hsing Hsu
    Fault-Tolerant Hamiltonicity of Twisted Cubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:4, pp:591-604 [Journal]
  60. Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Highly fault-tolerant cycle embeddings of hypercubes. [Citation Graph (0, 0)][DBLP]
    Journal of Systems Architecture, 2007, v:53, n:4, pp:227-232 [Journal]
  61. Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung
    Transmitting on various network topologies. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:2, pp:145-157 [Journal]
  62. 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. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:4, pp:189-201 [Journal]
  63. Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
    On the construction of combined k-fault-tolerant Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:3, pp:165-170 [Journal]
  64. Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
    A response to Volgenant's Addendum on the most vital edges. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:255- [Journal]
  65. Chang-Hsiung Tsai, Tyne Liang, Lih-Hsing Hsu, Men-Yang Lin
    Cycle embedding in faulty wrapped butterfly graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:2, pp:85-96 [Journal]
  66. Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung
    Construction schemes for fault-tolerant Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:3, pp:233-245 [Journal]
  67. Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau
    Mutually independent hamiltonian paths in star networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:46, n:2, pp:110-117 [Journal]
  68. Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu
    On the spanning w-wide diameter of the star graph. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:4, pp:235-249 [Journal]
  69. Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault hamiltonicity of augmented cubes. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2005, v:31, n:1, pp:131-145 [Journal]
  70. Lih-Hsing Hsu, Peng-Fei Wang, Chu-Tao Wu
    Parallel algorithms for finding the most vital edge with respect to minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1992, v:18, n:10, pp:1143-1155 [Journal]
  71. Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu
    Honeycomb rectangular disks. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2005, v:31, n:3-4, pp:371-388 [Journal]
  72. Ray-Shyng Chou, Lih-Hsing Hsu
    1-Edge Fault-Tolerant designs for Meshes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:385-389 [Journal]
  73. Lih-Hsing Hsu
    Matching Polynomials of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:13-18 [Journal]
  74. Jyh-Jian Sheu, Lih-Hsing Hsu
    Fault Diameter for Subercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:21-30 [Journal]
  75. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:12, pp:1582-1590 [Journal]
  76. Hong-Chun Hsu, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
    Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:1, pp:39-53 [Journal]
  77. Pao-Lien Lai, Jimmy J. M. Tan, Chien-Ping Chang, Lih-Hsing Hsu
    Conditional Diagnosability Measures for Large Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:2, pp:165-175 [Journal]
  78. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:8, pp:1064-1069 [Journal]
  79. Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
    The super connectivity of the pancake graphs and the super laceability of the star graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:2-3, pp:257-271 [Journal]
  80. Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu
    Edge Congestion and Topological Properties of Crossed Cubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:1, pp:64-80 [Journal]
  81. Yomin Hou, Chien-Min Wang, Chiu-Yu Ku, Lih-Hsing Hsu
    Optimal Processor Mapping for Linear-Complement Communication on Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:5, pp:514-527 [Journal]
  82. Chun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu
    On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:8, pp:864- [Journal]
  83. Y-Chuang Chen, Lih-Hsing Hsu, Jimmy J. M. Tan
    A recursively construction scheme for super fault-tolerant hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2006, v:177, n:2, pp:465-481 [Journal]
  84. Lih-Hsing Hsu
    Dependence of tree copy functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:3, pp:283-290 [Journal]
  85. Lih-Hsing Hsu, Chiuyuan Chen, En-Yih Jean
    A class of additive multiplicative graph functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:1, pp:53-63 [Journal]
  86. Lih-Hsing Hsu
    On a multiplicative graph function conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:2-3, pp:245-253 [Journal]
  87. Lih-Hsing Hsu
    Generalized homomorphism graph functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:31-37 [Journal]
  88. Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh
    Hamiltonicity of hypercubes with a constraint of required and faulty edges. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:197-204 [Journal]
  89. Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu
    On cubic 2-independent Hamiltonian connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:275-294 [Journal]
  90. Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu
    On the equitable k *-laceability of hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:349-364 [Journal]
  91. Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu
    Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:4, pp:362-368 [Journal]
  92. Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu
    On the spanning connectivity and spanning laceability of hypercube-like networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:218-229 [Journal]

  93. On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes. [Citation Graph (, )][DBLP]


  94. Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs. [Citation Graph (, )][DBLP]


  95. Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. [Citation Graph (, )][DBLP]


  96. The Mutually Independent Bipanconnected Property for Hypercube. [Citation Graph (, )][DBLP]


  97. Mutually orthogonal hamiltonian connected graphs. [Citation Graph (, )][DBLP]


  98. On the extremal number of edges in hamiltonian connected graphs. [Citation Graph (, )][DBLP]


  99. Panpositionable Hamiltonian Graphs. [Citation Graph (, )][DBLP]


  100. On the spanning fan-connectivity of graphs. [Citation Graph (, )][DBLP]


  101. On spanning connected graphs. [Citation Graph (, )][DBLP]


  102. Mutually independent hamiltonian cycles for the pancake graphs and the star graphs. [Citation Graph (, )][DBLP]


  103. Globally bi-3*-connected graphs. [Citation Graph (, )][DBLP]


Search in 0.930secs, Finished in 0.933secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002