Hong-Chun Hsu

	2012
20		Hong-Chun Hsu, Pao-Lien Lai: Adaptive Diagnosis for Grids under the Comparison Model. AINA Workshops 2012: 1246-1251
19		Tseng-Kuei Li, Chang-Hsiung Tsai, Hong-Chun Hsu: A fast fault-identification algorithm for bijective connection graphs using the PMC model. Inf. Sci. 187: 291-297 (2012)
	2011
18		Pao-Lien Lai, Hong-Chun Hsu, Chang-Hsiung Tsai: A Systematic Algorithm for Embedding Hamiltonian Cycle in Hierarchical Crossed Cubes. CSE 2011: 358-365
	2010
17		Yen-Neng Peng, Pao-Lien Lai, Chang-Hsiung Tsai, Hong-Chun Hsu: The Existence of Two Mutually Independent Hamiltonian Cycles in Hypercube-Like Graphs. ISPA 2010: 24-28
16		Pao-Lien Lai, Chang-Hsiung Tsai, Hong-Chun Hsu: Hamiltonian Cycle Embedding in Hierarchical Crossed Cubes. PDCAT 2010: 329-333
15		Chia-Jui Lai, Chang-Hsiung Tsai, Hong-Chun Hsu, Tseng-Kuei Li: A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube. Inf. Sci. 180(24): 5090-5100 (2010)
14		Pao-Lien Lai, Hong-Chun Hsu, Chang-Hsiung Tsai, Iain A. Stewart: A class of hierarchical graphs as topologies for interconnection networks. Theor. Comput. Sci. 411(31-33): 2912-2924 (2010)
	2009
13		Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai, Tseng-Kuei Li: Efficient Algorithms for Embedding Cycles in Augmented Cubes. ISPAN 2009: 596-600
12		Chang-Hsiung Tsai, Pao-Lien Lai, Hong-Chun Hsu: Embed Geodesic Cycles into Mobius Cubes. PACCS 2009: 3-6
11		Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu: Globally bi-3*-connected graphs. Discrete Mathematics 309(8): 1931-1946 (2009)
10		Pao-Lien Lai, Hong-Chun Hsu: Constructing the nearly shortest path in crossed cubes. Inf. Sci. 179(14): 2487-2493 (2009)
	2008
9		Pao-Lien Lai, Hong-Chun Hsu: The two-equal-disjoint path cover problem of Matching Composition Network. Inf. Process. Lett. 107(1): 18-23 (2008)
	2007
8		Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai: Geodesic pancyclicity and balanced pancyclicity of Augmented cubes. Inf. Process. Lett. 101(6): 227-232 (2007)
	2006
7		Pao-Lien Lai, Hong-Chun Hsu: On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes. JCIS 2006
6		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)
	2005
5		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)
	2004
4		Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu: Ring Embedding in Faulty Augmented Cubes. ISPAN 2004: 155-161
3		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)
	2003
2		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)
1		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)

Coauthor Index

1	Liang-Chih Chiang	[4] [5]
2	Yi-Lin Hsieh	[1]
3	Lih-Hsing Hsu	[1] [2] [3] [4] [5] [6] [11]
4	Hua-Min Huang	[6]
5	Chun-Nan Hung	[2]
6	Shin-Shin Kao	[11]
7	Chia-Jui Lai	[15]
8	Pao-Lien Lai	[7] [8] [9] [10] [12] [13] [14] [16] [17] [18] [20]
9	Tseng-Kuei Li	[3] [13] [15] [19]
10	Kao-Yung Liang	[2]
11	Cheng-Kuan Lin	[6]
12	Yen-Neng Peng	[17]
13	Iain A. Stewart	[14]
14	Jimmy J. M. Tan	[1] [3] [4] [5]
15	Chang-Hsiung Tsai	[8] [12] [13] [14] [15] [16] [17] [18] [19]

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page