A.    Refereed Journal Papers:

On Algorithm Design:

1.       Tang, C. Y. and Lee, R. C. T., "Optimal Speeding Up of Parallel Algorithms Based Upon the Divide-and-Conquer Strategy", Information Sciences, Vol. 32, pp. 173-186, 1984. (EI, SCI)

2.       Tang, C. Y., Buehrer, D. J. and  Lee, R. C. T., "On the Complexity of Some File Design Problems", Information Systems, Vol. 10, No. 1, pp. 21-25, 1985.

3.       Chang, M. S., Huang, N.-F. and Tang, C. Y., "An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs", Information Processing Letters, 35, pp. 255-260, 1990. (EI, SCI)

4.       Hore, I. L. and Tang, C. Y., "Two Cost-Effective Fault-Tolerant Multistage Interconnection Networks", Journal of the Chinese Institute of Engineers, pp. 471-481, 1991. (EI)

5.       Liou. W. T., Tang, C. Y. and Lee, R. C. T., "Covering Convex Rectilinear Polygons in Linear Time", International Journal of Computational Geometry and Applications, Vol. 1, No. 2, pp. 137-185, 1991.

6.       Chen, W-H. and Tang, C. Y., "Computing the Optimal IO sequence of a Protocol in Polynomial Time", Information Processing Letters, 40, pp. 145-148, 1991. (EI, SCI)

7.       Hsiao, J. Y., Tang, C. Y. and Chang, R. S., "Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem", Information Processing Letters, 40, pp. 283-287, 1991. (EI, SCI)

8.       Chang, M. S., Tang, C. Y. and Lee, R. C. T., "20-Relative Neighborhood Graphs Are Hamiltonian", Journal of Graph Theory, Vol. 15, No. 5, pp. 534-557, 1991. (SCI)

9.       Wu, L. C. and Tang, C. Y., "Solving Satisfiability Problem by Using Randomized Approach", Information Processing Letters, 41, pp. 187-190, 1992. (EI, SCI)

10.    Tang, C. Y. and Yang, C. J., "On the Complexity of Some Radio Network Design Problems", Journal of the Chinese Institute of Engineers, Vol. 15, No. 4, pp. 459-465, 1992. (EI)

11.    Chen, W.-H. and Tang, C. Y., "Tightly-Synchronizable Protocol Test Generation Via the Duplex Technique", Journal of Information Science and Engineering, 8, pp. 167-186, 1992.

12.    Tang, C. Y. and Liang, Y. H., "Using Conflicts to Derive Efficient Algorithms on single-Channel Broadcast Communication Model", Journal of Information Science and Engineering, 8, pp. 187-206, 1992.

13.    Hu, T. H., Tang, C. Y. and Lee, R. C. T., "An Average Case Analysis of A Resolution Principle Algorithm in Mechanical Theorem Proving", Annals of Mathematics and Artificial Intelligence, Vol. 6, pp. 235-252, 1992.

14.    Chang, M. S., Tang, C. Y. and Lee, R. C. T., "Solving the Euclidean Bottleneck Matching Problem by K-Relative Neighborhood Graph", Algorithmica, Vol. 8, pp. 177-194, 1992. (SCI)

15.    Chang, M. S., Tang, C. Y. and Lee, R. C. T., "Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs", Discrete Applied Mathematics, Vol. 39, pp. 1-12, 1992. (EI, SCI)

16.    Hsiao, J. Y., Tang, C. Y. and Chang, R. S., "An Efficient Algorithm for finding a Maximum Weight Two-Independent Set on Interval Graphs", Information Processing Letters, 43, pp. 229-235, 1992. (EI, SCI)

17.    Tsai, Y. T. and Tang, C. Y., "An On-line Algorithm for Computing Low Distance Spanning Trees on Euclidean Space", Journal of Computer Science and Informatics, Vol. 22, No. 2, pp. 3-16, 1992.

18.    Chen, W.-H., Tang, C. Y., "A 2 |E|-bit Distributed Algorithm for the Directed Euler Trail Problem", Information Processing Letters, 47, pp. 43-49, 1993. (EI, SCI)

19.    Tseng, S.-Y., King, C.-T. and Tang, C. Y., "A New Loop Partition Method- Clustering", IFIP Transactions on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, pp. 53-64, 1993. (EI, SCI)

20.    Tsai, Y. T. and Tang, C. Y., "The Competitiveness of Randomized Algorithms for On-Line Spanning Tree Problems", Information Processing Letters, 48, pp. 177-182, 1993. (EI, SCI)

21.    Hsiao, J. Y., Tang, C. Y. and Chang, R. S., "The Summation and Bottleneck Minimization for Single Step Searching on Weighted Graphs", Information Sciences, Vol. 74, pp. 1-28, 1993. (EI, SCI)

22.    Wu, B.Y. and Tang, C.Y., "The Problem of Lexicograph Unranking of a Permutation Is in NC", Proceedings of the NSC -- Physical Science and Engineering, Vol. 18, No. 4, pp. 384-352, 1994.

23.    Hsiao, J. Y., Tang, C. Y., Chang, R. S. and R. C. T. Lee, "Single Step Searching on Weighted Block Graphs", Information Sciences, Vol. 81,  pp. 1-29, 1994. (EI, SCI)

24.    Tsai, Y. T., Tang, C. Y. and Chen, Y. Y., "Average Performance of a Greedy Algorithm for On-Line Minimum Matching Problem on Euclidean Space", Information Processing Letters, 51, pp. 275-282, 1994. (EI, SCI)

25.    Chen, W. H., Tang, C. Y. and Vuong, S. T., "Improving the UIOv-Method for Protocol Conformance Testing", Computer Communications, Vol. 18, No. 9, pp. 609-619, September 1995. (EI, SCI)

26.    Yen, W. C.-K., and Tang, C. Y., "An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Trees", Information Sciences, 87, pp. 79-105, 1995. (EI, SCI)

27.    Tsai, Y.T., Tang, C.Y. and Chen, Yunn Yen, "Randomized Algorithms for The On-Line Minimum Matching Problem on Euclidean Space", International Journal of Computer Mathematics, Vol. 58, pp. 19-32, 1995. (EI, SCI)

28.    Tsai, Y. T., Tang, C. Y. and Chen, Y. Y., "An Average Case Analysis of a Greedy Algorithm for the On-Line Steiner Tree Problem", Computers and Mathematics with Applications, Vol. 31, No. 11, pp. 121-131, 1996. (EI, SCI)

29.    Tseng, S.Y., King, C.T. and Tang, C.Y., “Finding the Maximum Grid Convex Polygon for a Convex Region on the Plane”, Information Sciences, Vol. 98, pp. 27-42, 1996. (EI, SCI)

30.    Yen, W.C.K. and Tang, C.Y., “An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Interval Graphs”, Information Sciences, Vol. 100, pp. 1-25, 1997. (EI, SCI)

31.    Lu, C.L. and Tang, C.Y., “A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs”, Information Processing Letters, Vol. 61, pp. 107-111, 1997. (EI, SCI)

32.    Wu, B.Y. and Tang, C.Y., "AN O(n) algorithm for finding an optimal  position with relative distances in an evolutionary tree", Information Processing Letters,  Vol. 63, pp. 263-269, 1997. (EI, SCI)

33.    Lu, C.L. and Tang, C.Y., “Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs”, Discrete Applied Mathematics, Vol. 87, pp. 203-211, 1998. (EI, SCI)

34.    Wu, W.J., Chen, W.H. and Tang, C.Y., “Synchronizable Test Sequence for Multi-Party Protocol Conformance Testing”, Computer Communications, Vol. 21, pp. 1177-1183, 1998. (EI, SCI)

35.    Fang, J.F., Hsiao, J. Y. and Tang, C.Y., “Embedding meshes and TORUS networks onto degree four chordal rings”, IEE Proceedings---Computers and Digital Technieques, Vol. 145, pp. 73-80, 1998. (SCI)

36.    Shyu, D.J., Wang, B.F., and Tang, C.Y., “Efficient Emulations for X-trees and m-ary Trees”, Parallel Algorithms and Applications, Vol. 13, pp. 95-116, 1998.

37.    Wu, B.Y., Chao, K.M., and Tang, C.Y., “An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree”, Information Processing Letters, Vol. 69, pp. 63-67, 1999. (EI, SCI)

38.    Yen, C.K., Tang, C.Y., “An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted 2-terminal Serial-parallel Graphs”, Acta Informatica, Vol.36, pp.143-172, 1999. (SCI)

39.    Wu, B.Y., Lancia, G., Bafna, V., Chao, K. M., Ravi, R., and Tang, C.Y., “A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees”, SIAM J. on Computing. Vol. 29, No. 3, pp. 761-778. 1999. (EI)

40.    Peng, S.L., Ko, M.T., Ho, C.W., Hsu, T.S., and Tang, C.Y., “Graph Searching on Some Subclasses of Chordal Graphs”, Algorithmica, Vol. 27, pp. 395-426, 2000. (SCI)

41.    Wu, B.Y., Chao, K.M. and Tang, C.Y., “Approximation Algorithms for some Optimum Communication Spanning Tree Problems”, Lecture Notes in Computer Science v1533 p 407, 2000. (EI, SCI)

42.    Yen, C.K., Tang, C.Y., “The Searchlight Guarding Problem on Weighted Split Graphs and Weighted Cographs”, Networks, Vol. 35(4), pp. 195-206, 2000. (SCI)

43.    Wu, B.Y., Chao, K.M. and Tang, C.Y.,“A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees”, Journal of Algorithms, Vol. 36, pp.182-204, 2000. (SCI)

44.    Wu, B.Y., Chao, K.M. and Tang, C.Y., “Approximation Algorithms for the Shortest Total Path Length Spanning Tree Problem”, Discrete Applied Mathematics. Vol. 105, pp. 273-289, 2000. (EI, SCI)

45.    Wu, W.J. and Tang, C.Y., “Automatics Test Timing Assignment for RAMs Using Linear Programming”, VLSI Design, v10 n2, pp. 143-153, 2000. (EI, SCI)

46.    Fang, J.F., Hsiao, J. Y., and Tang, C.Y., “Embedding Cycles and Meshes onto Incomplete Hypercubes”, International Journal of Computer Mathematics, Vol.75, pp. 1-19, 2000. (EI, SCI)

47.    Peng, S.L., Ho, C.W., Hsu, T.S., Ko, M.T., and Tang, C.Y., “Edge and Node Searching Problems on Trees”, Theoretical Computer Science. Vol. 240, pp. 429-446, 2000. (SCI)

48.    Lu, B.K., Hsu, F.R., and Tang, C.Y., “Guarding in a Simple Polygon”, Information Processing Letters, Vol. 75, Issue: 4, pp. 153-158, 2000. (EI, SCI)

49.    Lu, Bor-Kuan, Hsu, Fang-Rong and Tang, C.Y., “Finding the Shortest Boundary Guadr of A Simple Polygon”, Theoretical Computer Science. 263(2001) 113-121. (SCI)

50.    Lu, C.L. and Tang, C.Y., “Weighted Efficient Domination Problem on Some Perfect Graphs”, Discrete Applied Mathematics, 117(2002) 163-182. (EI, SCI)

51.    Lu, C.L., Ko, M.T. and Tang, C.Y., “Perfect Edge Domination and Efficient Edge Domination in Graphs“, Discrete Applied Mathematics, 119(2002) 229-252. (EI, SCI)

52.    Wu, B. Y., Chao, K.M., and Tang, C.Y., “Light Graphs with Small Routing Cost”, Networks, vol. 39(3), pp. 130-138 2002 (SCI)

53.    Lu, C.L., S.L. Peng and Tang, C.Y., “Efficient Minus and Signed Domination in Graphs”, Theoretical Computer Science, Volume: 301, Issue: 1-3, May 14, 2003, pp. 381-397(EI, SCI)

54.    Yu, J.-S. K., Hwang , J.-K., Tang, C. Y., and Yu, C.-H., “Numerical Performance and Throughput Benchmark for Electronic Structure Calculations in PC-Linux Systems with New Architectures, Updated Compilers, and Libraries”, Journal of Chemical Information and Computer Sciences

 

On Bioinformatics:

1.     Wu, B.Y., Chao, K.M., and Tang, C.Y., “Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices”, Journal of Combinatorial Optimization. Vol. 3, pp. 199-211, 1999. (SCI)

2.     Lu, F.C., Tsai, Y. T. and Tang, C.Y., “An Efficient External Sorting Algorithm”, Information Processing Letters, Vol. 75, Issue: 4, pp. 159-163, 2000. (EI, SCI)

3.     Lu, C. L., Tang, C.Y. and R. C. T. Lee, “The Full Steiner Tree Problem in Phylogeny ”, Theoretical Computer Science, 306 (2003) 55-67.

4.     Tang, C.Y., Lu, C.L., Chang, M.D.T., Tsai, Y.T., Sun, Y.J., Chao, K.M., Chang, J.M., Chiou, Y.H., Wu, C.M., Chang, H.T. and Chou, W.I., “Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment”, Journal of Bioinformatics and Computational Biology, 1 (2003) 267-287.

 

B.    Conference Papers:

On Algorithm Design:

1.       Tang, C. Y. and Lee, R. C. T., "Parallel Algorithms Based Upon the Dynamic Programming Approach", Proceedings of International Computer Symposium 1984, Taipei, Taiwan, Republic of China, pp. 709-716, 1984.

2.       Tang, C. Y., Du, M. W. and Lee, R. C. T., "Parallel Generation of Combinations", Proceedings of International Computer Symposium 1984, Taipei, Taiwan, Republic of China, pp. 1006-1010, 1984.

3.       Chen, Y. C., Chen, G. H. and Tang, C. Y., "Using Fewer Processors to Reduce Time Complexities of Semigroup Computations", Proceedings of International Computer Symposium 1988, Taipei, Taiwan, Republic of China, pp. 129-131, 1988.

4.       Tang, C. Y. and Wu, S. C., "Parallel Graph Algorithms under Broadcast Communication Model", Proceedings of International Computer Symposium 1988, Taipei, Taiwan, Republic of China, pp. 759-763, 1988.

5.       Liou, Y. L. and Tang, C. Y., "Distributed Branch-and-Bound Algorithms on the Single-Bus Broadcast Communication Model", Proceedings of International Computer Symposium 1988, Taipei, Taiwan, Republic of China, pp. 1391-1396, 1988.

6.       Tang, C. Y. and Chiu, M. C., "Distributed Sorting on Local Area Networks", Proceedings of the 1989 Singapore International Conference on Networks, Singapore, pp. 458-462, 1989.

7.       Liang, C. K., Tang, C. Y. and Lee, R. C. T., "Some Clustering Algorithms Based on the Spanning Tree Vertex Labeling Approach", Proceedings of National Computer Symposium 1989, Taipei, Taiwan, Republic of China, pp. 19-28, 1989.

8.       Yu, C. W. and Tang, C. Y., "Solving the Longest Common Subsequence Problem by Finding the Longest Chain in the Plane", Proceedings of National Computer Symposium 1989, Taipei, Taiwan, Republic of China, pp. 35-41, 1989.

9.       Yu, C. W. and Tang, C. Y., "Solving the Direct Domination Problem by Using the Domination Relation Data Structures", Proceedings of National Computer Symposium 1989, Taipei, Taiwan, Republic of China, pp. 95-101, 1989.

10.    Liang, C. K., Tang, C. Y. and Lee, R. C. T., "An Algorithm for the Euclidean Mini-Sum 2-Clustering Problem", Proceedings of International Conference on Computing and Information, ICCI'90, Canada, pp. 67-71, 1990.

11.    Fang, H. Y. and Tang, C. Y., "Guarding Problems in the Gallery", Proceedings of International Computer Symposium 1990, Hsinchu, Taiwan, Republic of China, pp. 296-302, 1990.

12.    Chang, N. S., Wang, J. S. and Tang, C. Y., "Solving Large Sparse Linear System by Iterative Method on Multiprocessor", Proceedings of International Computer Symposium 1990, Hsinchu, Taiwan, Republic of China, pp. 736-741, 1990.

13.    Wu, B.Y. and Tang, C.Y., "An Optimal Parallel Algorithm for Generating Permutations on Linear Array", Proceedings of the First Workshop on Parallel Processing 1990, Hsinchu, Taiwan, Republic of China, pp. 106-110, 1990.

14.    Wu, B.Y. and Tang, C.Y., "Ranking, Unranking and Parallel Enumerating Topological Orders", Proceedings of the 1991 International Conference on Parallel Processing, ICPP 1991, Pennsylvania University, U.S.A., Vol. III, pp. 284-285, 1991.

15.    Hu, T. H., Tang, C. Y. and Lee, R. C. T., "An Average Case Analysis of Modified Monien and Specknmeyer's Mechanical Theorem Proving Algorithm", Proceedings of the  Second Annual International Symposium on Algorithm, Lecture Notes in Computer Science 557, Springer-Verlag, pp. 116-126, Taipei, Taiwan, Republic of China, 1991. (EI, SCI)

16.    Chen, W.-H., Tang, C. Y. and Wang, H.-E., "Synchronizable Protocol Test Generation Via the DuplexT and DuplexL Techniques", Proceedings of National Computer Symposium 1991, pp. 20-24, Chungli, Taiwan, Republic of China, 1991.

17.    Yen, C. K. and Tang, C. Y., "The Bottleneck Independent Dominating Set Problem on Permutation Graphs", Proceedings of International Computer Symposium 1992, pp. 455-462, Taichung, Taiwan, Republic of China, 1992.

18.    Hsiao, J. Y. and Tang, C. Y. and Chang, R. S., "A Linear Algorithm for solving the Weighted Two-Independent Set Problem on Block Graphs", Proceedings of International Computer Symposium 1992, pp. 1160-1165, Taichung, Taiwan, Republic of China, 1992.

19.    Tseng, S.-Y., King, C.-T. and Tang, C. Y., "Minimum Dependent Vector Set: A New Compiler Technique for Enhancing Loop Parallelism", Proceedings of 1992 International Conference on Parallel and Distributed Systems, pp. 340-346, Hsinchu, Taiwan, R. O. C., 1992.

20.    Chen, T. S., Lee, R. C. T. and Tang, C. Y., "A full Speedup Implementation of the SOR Algorithm on nCUBE Machine", Proceedings of 1992 International Conference on Parallel and Distributed Systems, pp. 347-354, Hsinchu, Taiwan, R. O. C., 1992.

21.    Chen, W. H., Tang, C. Y. and Ural, H., "Minimum-Cost Synchronizable Test Sequence Generation via the DuplexU Diagraph", Proceedings of IEEE Computer and Communication Societies 1993 (INFOCOM'93), pp. 128-137, San Francisco, U.S.A., 1993. (EI)

22.    Wang, H. E., Chen, W. H. and Tang, C. Y., "An Approximation Algorithm for Obtaining UIO Sequences from the FSM Model of a Protocol", Proceedings of 1993 International Symposium on Communications, Vol. 2/16, pp. 28-34, Hsinchu,  Taiwan, 1993.

23.    Chen, W. H. and Tang, C. Y., "Improving Protocol Conformance Test to satisfy the Uniqueness Criterion", Proceedings of 1993 International Symposium on Communications, Vol. 2/16, pp. 35-42, Hsinchu, Taiwan, 1993.

24.    Liaw, B. C., Shyu, D. J. Lui, F. C., Tang, C. Y. and Lee, R. C. T., "Parallel Implementation of Matrix Searching in Totally Monotone Matrices on nCUBE2 Machine", Proceedings of 1993 International Conference on Parallel and Distributed Systems, pp. 504-508, Taipei, Taiwan, R. O. C., 1993.

25.    Shyu, D. J., Tang, C. Y. and Wang, B. F., "Fast Algorithms for Simulating the CRCW Shared-Memory on Reconfigurable Meshs", Proceedings of the  1994 International Conference on  Parallel Processing, .ICPP 1994, pp. 143-146, Pennsylvania University, U.S.A..

26.    Chiou, S.-J  and Tang, C. Y., "Multiple Fault Diagonstic for Communication Protocols",  Proceedings of  1994 International Computer Symposium, pp. 1228-1233, National Chiao Tung University, Taiwan, R.O.C..

27.    Wu, B.Y. and Tang, C.Y., "Ranking, Unranking and Parallel Enumerating of Shortest Disjoint Paths on Hypercube", post paper in the International Symposium on Parallel Architectures, Allgorithms, and Networks, Kanazawa, Japan, 1994.

28.    Shyu, Daw-Jong; Wang, Biing-Feng; Tang, Chuan-Yi; “Efficient Emulation For Tree-Connected Networks”, Internatoinal Conference on Parallel and Distributed Systems - ICPADS Proceedings of the 1994 International Conference on Parallel and Distributed Systems, pp. 502-507, 1994. (EI)

29.    Chang, C.K., Wu, K.C., Tsai, Y.T. and Tang, C.Y., "A Scalable Fully Distributed Parallel Branch & Bound Algorithm on nCUBE", HPC-Asia Taiwan, 1995.

30.    Shyu, D.J., Wang, B.F. and Tang, C.Y., “The Emulation Problem on Trees”, Proceedings of 9th International Parallel Processing Symposium, Santa Barbara, California, pp. 251-255, 1995. (EI)

31.    Wu, W.J., Chen, W.H. and Tang, C.Y., “Synchronizable test sequences generation based on the multiplex digraph for multi-party protocol conformance testing,” Proc. of 10th Int‘l Conf. on Information Networking (ICOIN-10), Korea, January, pp. 29-31, 1996.

32.    Wu, W.J., Tang, C.Y. and Lin, M.Y., “Methods for Memory Test Time Reduction”, Proceedings of IEEE International Workshop on Memory Technology, Design and Testing, Singapore, pp. 13-14, 1996.

33.    Peng, S.L., Ko, M.T., Ho, C.W., Hsu, T.S., and Tang, C.Y.,“Graph Searching on Chordal Graphs”, in: Proceedings of 7th International Symposium on Algorithms and Computation (ISSAC’96), LNCS, Vol. 1178, pp. 156-165, 1996. (EI, SCI)

34.    Lu, C.L. and Tang, C.Y., “On the Complexity of Perfect Edge Domination Problem”, in: Proceedings of International Conference on Algorithms (joint with International Computer Symposium ICS'96), Kaohsiung, Taiwan, pp. 64-71, 1996.

35.    Wu, B.Y. and Tang, C.Y., “An Approximate Algorithm for Evolutionary Tree Reconstruction from Distance Matrix”, in: Proceedings of International Conference on Algorithms (joint with International Computer Symposium (ICS'96), Kaohsiung, Taiwan, pp. 72-78, 1996.

36.    Tseng, Shaw-Yen; King, Chung-Ta; Tang, Chuan-Yi “Profiling Dependence Vectors For Loop Parallellizatoin”, IEEE Symposium on Parallel and Distributed Processing - Proceedings Proceedings of the 1996 10th International Parallel Processing Symposium, pp. 23-27, 1996. (EI)

37.    Liang, Y.D. Lu, C.L. and Tang, C.Y., "Efficient Domination on Permutation Graphs and Trapezoid Graphs", in: T. Jiang and D.T. Lee eds., Proceedings of Third Annual International Computing and Combinatorics Conference, (COCOON'97) , Lecture Notes in Computer Science, (Springer-Verlag), Vol. 1276, pp. 232-241, 1997. (EI, SCI)

38.    Peng, S.L., Ho, C.W., Hsu, T.S., Ko, M.T. and Tang, C.Y., "Edge and Node Searching Problems on Trees", in: T. Jiang and D.T. Lee eds., Proceedings of Third Annual International Computing and Combinatorics Conference, (COCOON'97) , Lecture Notes in Computer Science, (Springer-Verlag), Vol. 1276, 1997. (EI, SCI)

39.    Lu, C.L. and Tang, C.Y., “On the Complexity of Efficient Minus Domination”, in: Proceedings of the 14th Workshop on Combinatorial Mathematics and Computation Theory, Taichung, Taiwan, pp. 45-48, 1997.

40.    Tang, C.Y., Wu, W.-J., “On the Controllability of Nondeterministic Finite-state Machines”, in: Proceedings of 11th Int’l Conf. on Information Networking (ICOIN-11), Taipei, pp. 9A-1.1--9A-1.7, 1997.

41.    Wu, W.-J., Ho, J.-K., Tang, C.Y., “A New Test Sequence Generation Method for Extended Finite-state Machine Models of Communication Protocols”, in: Proceedings of 11th Int’l Conf. on Information Networking (ICOIN-11), Taipei, pp. 7B-3.1--7B-3.10, 1997.

42.    Lu, B.K., Hsu, F.R., and Tang, C.Y., “Finding the Shortest Boundary Guard of a Simple Polygon”, Proceedings of the 10th Franco-Japanese, 5th Franco-Chinese Conference on Combinatorics and Computer Science, Palaiseau, France, 1997.

43.    Wu, W.-J., Ho, J.-K., Tang, C.Y., “A Simple Method for Deriving I/O Constraints from Test Sequences”, in: Proceedings of 12th Int’l Conf. on Information Networking (ICOIN-12), Japan, pp.613-616, 1998.

44.    Wu, B.Y., Lancia, G., Bafna, V., Chao, K.M., Ravi, R. and Tang, C.Y., “A Polynomial-time Approximation Scheme for Optimum Routing Spanning Trees”, Proceedings of Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pp. 21-32, 1998.

45.    Wu, B.Y., Chao, K.M., and Tang, C.Y., “Exact and Approximation Algorithms for Constructing Ultrametric Trees form Distance Matrices”, in: W.L. Hsu and M.Y. Kao eds., Proceedings of Fourth Annual International Computing and Combinatorics Conference, (COCOON’98), Lecture notes in Computer Science, (Springer Verlag), Vol. 1449, pp.299-308, 1998. (EI, SCI)

46.    Peng, S.L., Ho, C.W., Hsu, T.S., Ko, M.T., and Tang, C.Y., “A Linear Time Algorithm for Constructing an Optimal Node-Search Strategy of A Tree”, in: W.L. Hsu and M.Y. Kao eds., Proceedings of Fourth Annual International Computing and Combinatorics Conference, (COCOON’98), Lecture notes in Computer Science, (Springer Verlag), Vol. 1449, pp.279-288, 1998. (EI, SCI)

47.    Wu, B.Y., Chao, K.M., and Tang, C.Y., “Approximation Algorithm for Some Optimum Communication Spanning Tree Problems”, Proceedings of Ninth Annual International Symposium on Algorithm and Computation (ISSAC’98), Lecture Notes in Computer Science, (Springer Verlag), Vol. 1533, pp.407-416, 1998. (EI, SCI)

48.    Huang, P.H., Tsai, Y.T., and Tang, C.T. “An Efficient Algorithm for the Connected Two-Center Problem”, Proceedings of International Computer Symposium (ICS’98), 1998, pp.157-162.

49.    Lu, B.K., Hsu, F.R., and Tang, C.Y., “Guarding in a Simple Polygon”, Proceeding of the Tenth Canadian Conference on Computational geometry (CCCG’98), Montreal, Quebec, Canada, 1998.

50.    Wu, B.Y., Chao, K.M., and Tang, C.Y. “Constructing Light Spanning Trees with Small Routing Cost”, Symposium on Theoretical Aspects in Computer Science (STACS’99), 1999.

51.    Lu, C.L., Peng, S. L. and Tang, C. Y. “Efficient Minus and Signed Domination in Graphs”, Proceedings of Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), Lecture Notes in Computer Science (Springer Verlag), Vol. 1969, pp.241-253, 2001. (EI, SCI)

On Bioinformatics:

1.     Lu, C.L. Su, Z.Y. and Tang, C.Y. “A New Measures of Edit Distance Between Labeled Trees”, Proceedings of Seventh Annual International Computing and Combinatorics Conference (COCOON 2001), Lecture Notes in Computer Science (Springer Verlag), Vol. 2108, pp.338-348, 2001. (EI, SCI).

2.      Lu, C.L. Tang, C.Y. and Lee, R.C.T. “The Full Steiner Tree Problem in Phylogeny”, Proceedings of the Eighth Annual International Computing and Combinatorics Conference (COCOON 2002), Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2387 (2002) 107-116.

3.      Tang, C.Y., Lu, C.L., Chang, M.D.T., Sun, Y.J. et al., “Constrained Sequence Alignment Tool Development and Its Application to RNase Family Alignment”, Proceedings of the 2002 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS 2002), pp. 365-370, 2002.

4.      Tang, C.Y., Lu, C.L., Chang, M.D.T., Tsai, Y.T., Sun, Y.J., Chao, K.M., Chang, J.M., Chiou, Y.H., Wu, C.M., Chang, H.T. and Chou, W.I., “Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment”, Proceedings of the First IEEE Computer Society Bioinformatics Conference (CSB 2002), pp. 127-137.

5.      Lee, Chihan, Lin, Y.T., Tang, C.Y. and Yang, Y.S., “Identify Amino Acid Candidates Critical for Function of Rat Imidase by Cross-Reference Voting in Imidase Super Family”, ACM Symposium on Applied Computing, Bioinformatics Track, (SAC 2003), pp. 127-134.

6.      Chen, C.N., Peng, C.H., Chang, C.T., Wei, Y.C., Tang, C.Y., “Identify Single Nucleotide Variation in Whole Genome Sequences by External Sorting”, poster at the Seventh International Conference on Research in Computational Molecular Biology (RECOMB 2003).

7.     Chen, Y.H., Lu, C.L. and Tang, C.Y., “On the full and bottleneck full Steiner tree problem”, Proceedings of the Ninth Annual International Computing and Combinatorics Conference (COCOON 2003), Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2697 (2003) 122-129.

8.     Chen, Y.H., Wu, B.Y. and Tang, C.Y., "Approximation algorithms for k-source bottleneck routing cost spanning tree problems (extended abstract) " appear to THE 2004 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ITS APPLICATIONS (ICCSA 04) on the special issue of Lecture Notes on Computer Science (LNCS).

9.     Lee, H.P., Tsai, Y.T., Shih C.H., Sheu, T. F. and Tang, C.Y., "A Novel Approach for Efficient Query of Single Nucleotide Variation in DNA Databases, " poster at the Eighth Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004).

10.  Lee, H.P, Tsai, Y.T., Tang, C.Y., Shih C.H. and Sheu, T. F., "A Seriate Coverage Filtration Approach for Homology Search," Appear to the 19th ACM Symposium on Applied Computing (SAC 2004).

11.  Lee, H.P., Tsai, Y.T., Shih C.H., Sheu, T. F. and Tang, C.Y., "An IDC-based Algorithm for Efficient Homology Filtration with Guaranteed Seriate Coverage,'" Appear to the IEEE Fourth Symposium on Bioinformatics and Bioengineering (BIBE2004).