dblp.uni-trier.dewww.uni-trier.de

Tseng-Kuei Li

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2006
10EEMing-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)
2005
9EETseng-Kuei Li: Cycle embedding in star graphs with edge faults. Applied Mathematics and Computation 167(2): 891-900 (2005)
8EEMing-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)
2004
7EEHong-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)
6EETseng-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
5EETseng-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)
4EEMing-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)
2002
3EETseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu: Hamiltonian laceability on edge fault star graph. ICPADS 2002: 23-
2001
2EETseng-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)
2000
1 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)

Coauthor Index

1Hong-Chun Hsu [7]
2Lih-Hsing Hsu [1] [2] [3] [4] [5] [6] [7] [8] [10]
3Ting-Yi Sung [1] [2]
4Jimmy J. M. Tan [1] [2] [3] [4] [5] [6] [7] [8] [10]
5Chang-Hsiung Tsai [5]
6Ming-Chien Yang [4] [8] [10]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)