[1] H. L. Huang and G. H. Chen, "Combinatorial Properties of Two-Level Hypernet Networks,"Technical Report NTUCSIE 96-03, Department of Computer Science and Information Engineering,National Taiwan University, Taipei, Taiwan, 1996.
[2] R. S. Lo, "The Embedding of Hamiltonian Paths in Faulty Arrangement Graphs," Ph.D. Thesis,Department of Computer Science and Information Engineering, National Taiwan University, Taipei,Taiwan, 2000. (under the instruction of Dr. Gen-Huey Chen)
[3] S. Y. Hsieh, G. H. Chen, and C. W. Ho, "Fault-Tolerant Embedding of Longest Paths in StarGraphs with Edge Faults," Technical Report NTUCSIE 99-04, Department of Computer Science andInformation Engineering, National Taiwan University, Taipei, Taiwan, 1999.
[4] S. Y. Hsieh, G. H. Chen, and C. W. Ho, "Embed a Longest Path between Arbitrary Two Verticesof a Faulty Star Graph," Technical Report NTUCSIE 00-01, Department of Computer Science andInformation Engineering, National Taiwan University, Taipei, Taiwan, 2000.
[5] C. N. Lai, G. H. Chen, and D. R. Duh, "Routing Functions - an Effective Approach to Deriving One-to-Many Disjoint Paths," Technical Report NTUCSIE 00-02, Department of Computer Science andInformation Engineering, National Taiwan University, Taipei, Taiwan, 2000.
[6] J. S. Fu, G. H. Chen, and D. R. Duh, Node-disjoint paths and related problems on hierarchical cubic networks,Technical Report NTUCSIE 00-03, Department of Computer Science and Information Engineering,
National Taiwan University, 2000.
[7] C. N. Lai, "One-to-Many Disjoint Paths in the Hypercube and Folded Hypercube," Ph.D. thesis, Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, 2001.