Chin-Wen Ho(Full Professor)
Department of Computer Science and Information Engineering
National Central University
TEL: (03)4227151 #4461 FAX: (03)4222681 Office: E1-356
Contact hocw@csie.ncu.edu.tw with any question or comment.
About
Chin-Wen Ho received the B.S. in mathematics from National Taiwan University in 1979, and M.S. and Ph.D. degrees in computer science from National Tsing Hua University, Hsinchu, Taiwan, in 1984 and 1988, respectively. He is an associate professor in the department of computer science and information engineering at National Central University, Chung-Li, Taiwan. His research interests include algorithm design and analysis, graph theory, and parallel processing.
Journal Papers
Chin-Wen Ho and R. C. T. Lee, Efficient parallel algorithms for finding maximal cliques, clique tree, and minimum coloring on chordal graphs, Information Processing Letters, Vol. 28, No. 6, (1988) pp. 301-309.
Chin-Wen Ho and R. C. T. Lee, Counting clique trees and computing perfect elimination schemes in parallel, Information Processing Letters, Vol. 31, No. 2, (1989) pp. 61-68.
Chin-Wen Ho and R. C. T. Lee, A parallel algorithm for solving sparse triangular systems, IEEE Transactions on Computers, Vol. 39, No. 6, (1990) pp. 848-825.
Lang-Sheng Liu, Chin-Wen Ho, and Jang-Ping Sheu, Synthesizing the parallelism of nested loops using an index shift method, Journal of Information Science and Engineering, Vol. 7, (1991) pp. 529-541.
Ai-Jia Hsieh, Chin-Wen Ho, and Kuo-Chin Fan, An Extension of the bipartite weighted matching problem, Pattern Recognition Letters, Vol. 16, (1995) pp. 347-353.
Ai-Jia Hsieh, Kuo-Chin Fan, Tzu-I Fan, and Chin-Wen Ho, A stroke-based handwritten Chinese character recognition system using greedy matching method, Journal of Information Science and Engineering, Vol. 11, (1995) pp. 1-22.
Jou-Ming Chang and Chin-Wen Ho, The recognition of geodetically connected graphs, Information Processing Letters, Vol. 65, (1998) pp.81-88.
Chin-Wen Ho, Sun-Yuan Hsieh, and Gen-Huey Chen, An efficient parallel strategy for computing k-terminal reliability and finding most vital edges in 2-trees and partial 2-trees, Journal of Parallel and Distributed Computing, Vol. 51, (1998) pp. 89-113.
Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-Sheng Hsu, Ming-Tat Ko, and Gen-Huey Chen, Efficient parallel algorithms on distance-hereditary graphs, Parallel Processing Letters, Vol. 9, No. 1, (1999) pp. 43-52.
Chin-Wen Ho, Sun-Yuan Hsieh, and Gen-Huey Chen, Parallel decomposition of generalized series-parallel graphs, Journal of Information Science and Engineering, Vol.15, No.3, (1999), pp.407-417..
Yu-Chee Tseng, San-Yuan Wang, and Chin-Wen Ho, Efficient broadcasting in wormhole -routed multicomputers: a network-partitioning approach, IEEE Transactions on Parallel and Distributed Systems,Vol.10, No.1, (1999) pp.44-61.
Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-Sheng Hsu and Chuan-Yi Tang, Graph searching on some subclasses of chordal graphs, to appear in Algorithmica.
Sheng-Lung Peng, Chin-Wen Ho, Ming-Tat Ko, Tsan-Sheng Hsu and Chuan-Yi Tang, Edge and node searching problems on trees, to appear in Theoretical Computer Science.
Sun-Yuan Hsieh, Gen-Huey Chen, and Chin-Wen Ho, Fault-free Hamiltonian cycles in faulty arrangement graphs, IEEE Transactions on Parallel and Distributed Systems, Vol.10, No.3, (1999) pp.223-237.
Chin-Wen Ho and Jou-Ming Chang, Solving the all-pairs-shortest-length problem on chordal bipartite graphs, Information Processing Letters,Vol. 69, (1999) pp.87-93.
Peter Shaohua Deng, Hong-Yuan Mark Liao, Chin-Wen Ho, and Hsiao-Rong Tyan, Wavelet-Based Off-Line Handwritten Signature Verification, accepted by Computer Vision and Image Understanding.
Sun-Yuan Hsieh, Chin-Wen Ho, T. S. Hsu, M. T. Ko, and Gen-Huey Chen, Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs, accepted by Journal of Algorithms.
Conference Papers
Chin-Wen Ho and R. C. T. Lee, On counting clique trees and computing perfect elimination schemes in parallel, Proceedings of the International Computer Symposium, (1988) pp.139-144.
Lang-Sheng Liu, Chin-Wen Ho, and Jang-Ping Sheu, On the parallelism of nested for-loops using index shift method, Proceedings of International Conference on Parallel Processing, Vol. 2, (1990) pp.119-123.
Wen-Kwei Lee and Chin-Wen Ho, Two adaptive parallel algorithms for solving sparse linear systems of equation, Proceedings of National Computer Symposium, (1991) pp. 515-521.
San-Yuan Wang, Yu-Chee Tseng, and Chin-Wen Ho, Efficient single-node broadcast in wormhole-routed multicomputers: A network-partitioning approach, Eighth IEEE Symposium on Parallel and Distributed Processing, New Orleans, LA, USA, (1996) pp. 178-185.
San-Yuan Wang, Yu-Chee Tseng, and Chin-Wen Ho, Efficient multicast in wormhole-routed 2D mesh/torus multicomputers: A network-partitioning approach,” Sixth Symposium on the Frontiers of Massively Parallel Computing (Frontiers' 96), Annapolis, MA, USA, (1996) pp. 42-49.
S. L. Peng, M. T. Ko, C. W. Ho, T. S. Hsu and C. Y. Tang, Graph Searching on Chordal Graphs, Lecture Notes in Computer Science, Vol. 1178, Seventh Annual International Symposium on Algorithms and Computation (ISAAC '96), Osaka, Japan, (1996) pp. 156-165.
Jou-Ming Chang, Chin-Wen Ho, Chiun-Chieh Hsu and Yue-Li Wang, The characterizations of hinge-free networks, Proceedings of International Computer Symposium on Algorithm, (1996) pp. 105-112.
Chin-Wen Ho, Sun-Yuan Hsieh and Gen-Huey Chen, An efficient parallel strategy for computing k-terminal reliability and finding most vital edge in 2-trees and Partial 2-trees,” Proceedings of the 11th International Parallel Processing Symposium (IPPS'97), Geneva, Switzerland, (1997) pp. 603-607.
Sun-Yuan Hsieh, Chin-Wen Ho, and Gen-Huey Chen, Parallel decomposition of generalized series-parallel graphs, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'97), Las Vegas, Nevada, USA, (1997) pp. 890-896.
S. L. Peng, C. W. Ho, T. S. Hsu, M. T. Ko, and C. Y. Tang, Edge and node searching problems on trees, Lecture Notes in Computer Science, Vol. 1276, Third Annual International Computing and Combinatorics Conference (COCOON'97), Shanghai, (1997) pp. 284-293.
Sun-Yuan Hsieh, Chin-Wen Ho, T. S. Hsu, M. T. Ko, and Gen-Huey Chen, Efficient parallel algorithms on distance-hereditary graphs, Proceedings of International Conference on Parallel Processing (ICPP'97), Chicago, USA, (1997) pp. 20-23.
Sun-Yuan Hsieh, Gen-Huey Chen and Chin-Wen Ho, Fault-tolerant ring embedding in faulty arrangement graphs, International Conference on Parallel and Distributed Systems (ICPADS'97), Seoul, Korea, (1997) pp.744-749.
Sun-Yuan Hsieh, Gen-Huey Chen and Chin-Wen Ho, Hamiltonian-laceability of Star Graphs, International Symposium on Parallel Algorithms and Architectures, Taipei, (1997) pp.112-117.
Sun-Yuan Hsieh, Gen-Huey Chen and Chin-Wen Ho, Embed longest ring onto star graphs with vertex faults, Proceedings of International Conference on Parallel Processing (ICPP'98), Minneapolis, USA, (1998) pp.140-147.
Sun-Yuan Hsieh, Chin-Wen Ho, T. S. Hsu, M. T. Ko, and Gen-Huey Chen, A new simple parallel tree contraction scheme and its application on distance-hereditary graphs, Lecture Notes in Computer Science, Vol. 1457, 5th International Symposium, Solving Irregularly Structured Problems in Parallel (Irregular'98), Berkeley, CA, USA, (1998) pp. 298-309.
S. L. Peng, C. W. Ho, T. S. Hsu, M. T. Ko, and C. Y. Tang, A linear time algorithm for constructing an optimal node-search strategy of a tree, Lecture Notes in Computer Science, Vol. 1449, 4th Annual International Computing and Combinatorics Conference (COCOON'98), Taipei, (1998) pp. 279-288.
Sun-Yuan Hsieh, Chin-Wen Ho, T. S. Hsu, M. T. Ko, and Gen-Huey Chen, Characterization of Efficiently Computable Problems on Distance-Hereditary Graphs, Lecture Notes in Computer Science, Vol. 1533, 9th Annual International Symposium on Algorithms and Computation (ISAAC '98), Korea, (1998) pp.257-266
Peter Shaohua Deng, Hsiao-Rong Tyan, Hong-Yuan Mark Liao, and Chin-Wen Ho, Statistics-based off-line handwritten signature verification, Indian Conference on Computer Vision, Graphics and Image Processing (ICVGIP'98), New Delhi, India, (1998) pp.134-140.
Chin-Wen Ho and Jou-Ming Chang, Solving the all-pairs-shortest-length problem on chordal bipartite graphs, Proceedings of International Computer Symposium, Tainan, Taiwan, ROC, (1998) pp.116-123.20.
Jou-Ming Chang, Chin-Wen Ho, and Ming-Tat Ko, LexBFS-ordering in Asteroidal Triple-free Graphs, Lecture Notes in Computer Science, Vol. 1741, 10th Annual International Symposium on Algorithms and Computation (ISAAC '99), India, Dec. 1999, pp.163-172
.