2008 | ||
---|---|---|
43 | EE | Hsin-Hung Chou, Ming-Tat Ko, Chin-Wen Ho, Gen-Huey Chen: Node-searching problem on block graphs. Discrete Applied Mathematics 156(1): 55-75 (2008) |
2006 | ||
42 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: The Hamiltonian problem on distance-hereditary graphs. Discrete Applied Mathematics 154(3): 508-524 (2006) |
2005 | ||
41 | EE | Chih-Hung Lai, Jie-Chi Yang, Tak-Wai Chan, Chin-Wen Ho, Fei Ching Chen, Jing-San Liang: Improving Experiential Learning with Mobile Technologies. WMTE 2005: 141-145 |
40 | EE | Mong-Chen Chiang, Yi-Chan Deng, Han-Zen Chang, Hui-Chun Liao, Chin-Wen Ho, Tak-Wai Chan: EduBingo: A Bingo-like Game for Mathematics Skill Building. WMTE 2005: 93-95 |
2004 | ||
39 | Yen-Hua Chen, Chuo-Bin Lin, Chin-Wen Ho, Shelley Young, Ia-Ming Ching, Tak-Wai Chan: Exploring Major Events and the Accumulated User Forecasting Model to Support Building Web-Based Learning Communities - Preliminary Analysis from the School for All. ICALT 2004 | |
2003 | ||
38 | Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko: Powers of Asteroidal Triple-free Graphs with Applications. Ars Comb. 67: (2003) | |
2002 | ||
37 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. COCOON 2002: 77-86 |
36 | Chih-Hung Lai, Jie-Chi Yang, Bau-Lo Jheng, Tak-Wai Chan, Chin-Wen Ho, Jing-San Liang: A Web-Based Information-Learning-Passport System Using the ARCS Model. ICCE 2002: 896-897 | |
35 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs. SIAM J. Discrete Math. 15(4): 488-518 (2002) |
2001 | ||
34 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Longest Fault-Free Paths in Star Graphs with Edge Faults. IEEE Trans. Computers 50(9): 960-971 (2001) |
33 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Longest fault-free paths in star graphs with vertex faults. Theor. Comput. Sci. 262(1): 215-227 (2001) |
2000 | ||
32 | EE | Sheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu: Graph Searching on Some Subclasses of Chordal Graphs. Algorithmica 27(3): 395-426 (2000) |
31 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. J. Algorithms 35(1): 50-81 (2000) | |
30 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Hamiltonian-laceability of star graphs. Networks 36(4): 225-232 (2000) |
29 | EE | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and node searching problems on trees. Theor. Comput. Sci. 240(2): 429-446 (2000) |
1999 | ||
28 | EE | Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko: LexBFS-Ordering in Asteroidal Triple-Free Graphs. ISAAC 1999: 163-172 |
27 | EE | Yu-Chee Tseng, San-Yuan Wang, Chin-Wen Ho: Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach. IEEE Trans. Parallel Distrib. Syst. 10(1): 44-61 (1999) |
26 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs. IEEE Trans. Parallel Distrib. Syst. 10(3): 223-237 (1999) |
25 | EE | Chin-Wen Ho, Jou-Ming Chang: Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs. Inf. Process. Lett. 69(2): 87-93 (1999) |
24 | EE | Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen: Parallel Decomposition of Generalized Series-Parallel Graphs. J. Inf. Sci. Eng. 15(3): 407-417 (1999) |
23 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Efficient Parallel Algorithms on Distance Hereditary Graphs. Parallel Processing Letters 9(1): 43-52 (1999) | |
1998 | ||
22 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs. ASIAN 1998: 113-124 |
21 | EE | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. COCOON 1998: 279-288 |
20 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Embed Longest Rings onto Star Graphs with Vertex Faults. ICPP 1998: 140-147 |
19 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. IRREGULAR 1998: 298-309 | |
18 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. ISAAC 1998: 257-266 |
17 | EE | Jou-Ming Chang, Chin-Wen Ho: The Recognition of Geodetically Connected Graphs. Inf. Process. Lett. 65(2): 81-88 (1998) |
16 | Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen: An Efficient Parallel Strategy for Computing K-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-Trees. J. Parallel Distrib. Comput. 51(2): 89-113 (1998) | |
1997 | ||
15 | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and Node Searching Problems on Trees. COCOON 1997: 284-293 | |
14 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Fault-Tolerant Ring Embedding in Faulty Arrangement Graphs. ICPADS 1997: 744-749 |
13 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko: . Efficient Parallel Algorithms on Distance-Hereditary Graphs. ICPP 1997: 20- |
12 | EE | Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen: An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees. IPPS 1997: 603-607 |
11 | EE | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Hamiltonian-Laceability of Star Graphs. ISPAN 1997: 112-117 |
10 | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen: Parallel Decomposition of Generalized Series-Parallel Graphs. PDPTA 1997: 890-896 | |
1996 | ||
9 | Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan Yi Tang: Graph Searching on Chordal Graphs. ISAAC 1996: 156-165 | |
1995 | ||
8 | EE | Ai-Jia Hsieh, Kuo-Chin Fan, Tzu-I Fan, Chin-Wen Ho: A Stroke-Based Handwritten Chinese Character Recognition System Using Greedy Matching Method. J. Inf. Sci. Eng. 11(1): 1-22 (1995) |
7 | EE | Ai-Jia Hsieh, Chin-Wen Ho, Kuo-Chin Fan: An extension of the bipartite weighted matching problem. Pattern Recognition Letters 16(4): 347-353 (1995) |
1994 | ||
6 | Sun-Yuan Hsieh, Chin-Wen Ho: An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs. ISAAC 1994: 496-504 | |
1991 | ||
5 | EE | Lang-Sheng Liu, Chin-Wen Ho, Jang-Ping Sheu: Synthesizing the Parallelism of Nested Loops Using An Index Shift Method. J. Inf. Sci. Eng. 7(4): 529-541 (1991) |
1990 | ||
4 | Lang-Sheng Liu, Chin-Wen Ho, Jang-Ping Sheu: On the Parallelism of Nested For-Loops Using Index Shift Method. ICPP (2) 1990: 119-123 | |
3 | Chin-Wen Ho, Richard C. T. Lee: A Parallel Algorithm for Solving Sparse Triangular Systems. IEEE Trans. Computers 39(6): 848-852 (1990) | |
1989 | ||
2 | Chin-Wen Ho, Richard C. T. Lee: Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel. Inf. Process. Lett. 31(2): 61-68 (1989) | |
1988 | ||
1 | Chin-Wen Ho, Richard C. T. Lee: Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs. Inf. Process. Lett. 28(6): 301-309 (1988) |