Journal Publications

    On Algorithm Design:

  1. B.K. Lu, F.R. Hsu and C.Y. Tang (2000), Guarding in a Simple Polygon, Information Processing Letters, 75, pp. 153-158. (EI, SCI)
  2. S.L. Peng, C.W. Ho, T.S. Hsu, M.T. Ko and C.Y. Tang (2000), Edge and Node Searching Problems on Trees, Theoretical Computer Science, 240, pp. 429-446. (SCI)
  3. J.F. Fang, J.Y. Hsiao and C.Y. Tang (2000), Embedding Cycles and Meshes onto Incomplete Hypercubes, International Journal of Computer Mathematics, 75, pp. 1-19. (EI, SCI)
  4. W.J. Wu and C.Y. Tang (2000), Automatic Test Timing Assignment for RAMs Using Linear Programming, VLSI Design, 10, pp. 143-154.
  5. B.Y. Wu, K.-M. Chao and C.Y. Tang (2000), Approximation Algorithms for the Shortest Total Path Length Spanning Tree Problem, Discrete Applied Mathematics, 105, pp. 273-289. (EI, SCI)
  6. B.Y. Wu, K.-M. Chao and C.Y. Tang (2000), A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees, Journal of Algorithms, 36, pp. 182-204. (SCI)
  7. C.K. Yen and C.Y. Tang (2000), The Searchlight Guarding Problem on Weighted Split Graphs and Weighted Cographs, Networks, 35, pp. 195-206. (SCI)
  8. B.Y. Wu, K.-M. Chao and C.Y. Tang (2000), Approximation Algorithms for Some Optimum Communication Spanning Tree Problems, Discrete Applied Mathematics,102, pp. 245-266. (EI, SCI)
  9. S.L. Peng, M.T. Ko, C.W. Ho, T.S. Hsu, and C.Y. Tang (2000), Graph Searching on Some Subclasses of Chordal Graphs, Algorithmica, 27, pp. 395-426. (SCI)
  10. B.Y. Wu, G. Lancia, V. Bafna, K.-M. Chao, R. Ravi, and C.Y. Tang (1999), A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees, SIAM Journal on Computing, 29, 3, pp. 761-778. (EI, SCI)
  11. B.Y. Wu, K.-M. Chao and C.Y. Tang (1999), Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices, Journal of Combinatorial Optimization, 3, pp. 199-211. (SCI)
  12. C.K. Yen, C.Y. Tang (1999), An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted 2-terminal Serial-parallel Graphs, Acta Informatica, 36, pp.143-172. (SCI)
  13. B.Y. Wu, K.-M. Chao and C.Y. Tang (1999), An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree, Information Processing Letters, 69, pp. 63-67. (EI, SCI)
  14. D.J. Shyu, B.F. Wang, and C.Y. Tang (1998), Efficient Emulations for X-trees and m-ary Trees, Parallel Algorithms and Applications, 13, pp. 95-116.
  15. J.F. Fang, J.Y. Hsiao and C.Y. Tang (1998), Embedding Meshes and TORUS Networks onto Degree Four Chordal Rings, IEE Proceedings - Computers and Digital Technieques, 145, pp. 73-80. (SCI)
  16. W.J. Wu, W.H. Chen and C.Y. Tang (1998), Synchronizable Test Sequence for Multi-Party Protocol Conformance Testing, Computer Communications, 21, pp. 1177-1183. (EI, SCI)
  17. C.L. Lu and C.Y. Tang (1998), Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs, Discrete Applied Mathematics, 87, pp. 203-211. (EI, SCI)
  18. B.Y. Wu and C.Y. Tang (1997), An O(n) Algorithm for Finding An Optimal Position with Relative Distances in An Evolutionary Tree, Information Processing Letters, 63, pp. 263-269. (EI, SCI)
  19. C.L. Lu and C.Y. Tang (1997), A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs, Information Processing Letters, 61, pp. 107-111. (EI, SCI)
  20. W.C.K. Yen and C.Y. Tang (1997), An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Interval Graphs, Information Sciences, 100, pp. 1-25. (EI, SCI)
  21. S.Y. Tseng, C.T. King and C.Y. Tang (1996), Finding the Maximum Grid Convex Polygon for a Convex Region on the Plane, Information Sciences, 98, pp. 27-42. (EI, SCI)
  22. Y.T. Tsai, C.Y. Tang and Y.Y. Chen (1996), An Average Case Analysis of a Greedy Algorithm for the On-Line Steiner Tree Problem, Computers and Mathematics with Applications, 31, pp. 121-131. (SCI)
  23. Y.T. Tsai, C.Y. Tang and Y.Y. Chen (1995), Randomized Algorithms for The On-Line Minimum Matching Problem on Euclidean Space, International Journal of Computer Mathematics, 58, pp. 19-32. (EI, SCI)
  24. W.C.-K. Yen, and C.Y. Tang (1995), An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Trees, Information Sciences, 87, pp. 79-105. (EI, SCI)
  25. W.H. Chen, C.Y. Tang and S.T. Vuong (1995), Improving the UIOv-Method for Protocol Conformance Testing, Computer Communications, 18, pp. 609-619. (EI, SCI)
  26. Y.T. Tsai, C.Y. Tang and Y.Y. Chen (1994), Average Performance of a Greedy Algorithm for On-Line Minimum Matching Problem on Euclidean Space, Information Processing Letters, 51, pp. 275-282. (EI, SCI)
  27. J.Y. Hsiao, C.Y. Tang, R.S. Chang and R.C.T. Lee (1994), Single Step Searching on Weighted Block Graphs, Information Sciences, 81, pp. 1-29. (EI, SCI)
  28. B.Y. Wu and C.Y. Tang (1994), The Problem of Lexicograph Unranking of a Permutation Is in NC, Proceedings of the NSC -- Physical Science and Engineering, 18, pp. 384-352.
  29. J.Y. Hsiao, C.Y. Tang and R.S. Chang (1993), The Summation and Bottleneck Minimization for Single Step Searching on Weighted Graphs, Information Sciences, 74, pp. 1-28. (EI, SCI)
  30. Y.T. Tsai and C.Y. Tang (1993), The Competitiveness of Randomized Algorithms for On-Line Spanning Tree Problems, Information Processing Letters, 48, pp. 177-182. (EI, SCI)
  31. W.-H. Chen and C.Y. Tang (1993), A 2 |E|-bit Distributed Algorithm for the Directed Euler Trail Problem, Information Processing Letters, 47, pp. 43-49. (EI, SCI)
  32. Y.T. Tsai and C.Y. Tang (1992), An On-line Algorithm for Computing Low Distance Spanning Trees on Euclidean Space, Journal of Computer Science and Informatics, 22, pp. 3-16.
  33. J.Y. Hsiao, C.Y. Tang and R.S. Chang (1992), An Efficient Algorithm for finding a Maximum Weight Two-Independent Set on Interval Graphs, Information Processing Letters, 43, pp. 229-235. (EI, SCI)
  34. M.S. Chang, C.Y. Tang and R.C.T. Lee (1992), Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs, Discrete Applied Mathematics, 39, pp. 1-12. (EI, SCI)
  35. M.S. Chang, C.Y. Tang and R.C.T. Lee (1992), Solving the Euclidean Bottleneck Matching Problem by K-Relative Neighborhood Graph, Algorithmica, 8, pp. 177-194. (SCI)
  36. T.H. Hu, C.Y. Tang and R.C.T. Lee (1992), An Average Case Analysis of A Resolution Principle Algorithm in Mechanical Theorem Proving, Annals of Mathematics and Artificial Intelligence, 6, pp. 235-252. (SCI)
  37. C.Y. Tang and Y.H. Liang (1992), Using Conflicts to Derive Efficient Algorithms on single-Channel Broadcast Communication Model, Journal of Information Science and Engineering, 8, pp. 187-206. (SCIE)
  38. W.-H. Chen and C.Y. Tang (1992), Using Conflicts to Derive Efficient Algorithms on single-Channel Broadcast Communication Modelration Via the Duplex Technique, Journal of Information Science and Engineering, 8, pp. 167-186. (SCIE)
  39. C.Y. Tang and C.J. Yang (1992), On Tightly-Synchronizable Protocol Test the Complexity of Some Radio Network Design Problems, Journal of the Chinese Institute of Engineers, 15, pp. 459-465. (EI)
  40. L.C. Wu and C.Y. Tang (1992), Solving Satisfiability Problem by Using Randomized Approach, Information Processing Letters, 41, pp. 187-190. (EI, SCI)
  41. M.S. Chang, C.Y. Tang and R.C.T. Lee (1991), 20-Relative Neighborhood Graphs Are Hamiltonian, Journal of Graph Theory, 15, pp. 534-557. (SCI)
  42. J.Y. Hsiao, C.Y. Tang and R.S. Chang (1991), Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem, Information Processing Letters, 40, pp. 283-287. (EI, SCI)
  43. W.-H. Chen and C.Y. Tang (1991), Computing the Optimal IO sequence of a Protocol in Polynomial Time, Information Processing Letters, 40, pp. 145-148. (EI, SCI)
  44. W.T. Liou, C.Y. Tang and R.C.T. Lee (1991), Covering Convex Rectilinear Polygons in Linear Time, International Journal of Computational Geometry and Applications, 1, pp. 137-185.
  45. I.L. Hore and C.Y. Tang (1991), Two Cost-Effective Fault-Tolerant Multistage Interconnection Networks, Journal of the Chinese Institute of Engineers, pp. 471-481. (EI)
  46. M.S. Chang, N.-F. Huang and C.Y. Tang (1990), An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs, Information Processing Letters, 35, pp. 255-260. (EI, SCI)
  47. C.Y. Tang, D.J. Buehrer and R.C.T. Lee (1985), On the Complexity of Some File Design Problems, Information Systems, 10, pp. 21-25. (SCI)
  48. C.Y. Tang and R.C.T. Lee (1984), Optimal Speeding Up of Parallel Algorithms Based Upon the Divide-and-Conquer Strategy, Information Sciences, 32, pp. 173-186. (EI, SCI)

Conference Publications

    On Algorithm Design:

  1. C.L. Lu, S.L. Peng and C.Y. Tang (2000), Efficient Minus and Signed Domination in Graphs, 11th Annual International Symposium on Algorithms and Computation (ISAAC2000), LNCS, Springer Verlag, 1969, pp. 241-253.
  2. W.-J. Wu and C.Y. Tang (2000), Memory Test Time Reduction by Interconnecting Test Items, IEEE of 9th Asian Test Symposium (ATS2000), IEEE Computer Society , pp. 290-298.
  3. B.Y. Wu, K.-M. Chao and C.Y. Tang (1999), Constructing Light Spanning Trees with Small Routing Cost, 16th International Symposium on Theoretical Aspects in Computer Science (STACS1999), LNCS, Springer Verlag, 1563, 334-344.
  4. B.K. Lu, F.R. Hsu, and C.Y. Tang (1998), Guarding in a Simple Polygon, 10th Canadian Conference on Computational geometry (CCCG1998).
  5. P.H. Huang, Y.T. Tsai and C.Y. Tang (1998), An Efficient Algorithm for the Connected Two-Center Problem, Proceedings of International Computer Symposium (ICS1998), pp. 157-162.
  6. B.Y. Wu, K.-M. Chao, and C.Y. Tang (1998), Approximation Algorithm for Some Optimum Communication Spanning Tree Problems, 9th Annual International Symposium on Algorithm and Computation (ISSAC1998), LNCS, Springer Verlag, 1533, pp.407-416.
  7. S.L. Peng, C.W. Ho, T.S. Hsu, M.T. Ko, and C.Y. Tang (1998), A Linear Time Algorithm for Constructing an Optimal Node-Search Strategy of A Tree, 4th Annual International Computing and Combinatorics Conference (COCOON1998), LNCS, Springer Verlag, 1449, pp. 279-288.
  8. B.Y. Wu, K.-M. Chao and C.Y. Tang (1998), Exact and Approximation Algorithms for Constructing Ultrametric Trees form Distance Matrices, 4th Annual International Computing and Combinatorics Conference (COCOON1998), LNCS, Springer Verlag, 1449, pp. 299-308.
  9. B.Y. Wu, G. Lancia, V. Bafna, K.-M. Chao, R. Ravi and C.Y. Tang (1998), A Polynomial-time Approximation Scheme for Optimum Routing Spanning Trees, 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA1998), ACM/SIAM, pp. 21-32.
  10. W.-J. Wu, J.-K. Ho and C.Y. Tang (1998), A Simple Method for Deriving I/O Constraints from Test Sequences, 12th International Conference on Information Networking (ICOIN-12), pp. 613-616.
  11. B.K. Lu, F.R. Hsu and C.Y. Tang (1997), Finding the Shortest Boundary Guard of a Simple Polygon, 10th Franco-Japanese, 5th Franco-Chinese Conference on Combinatorics and Computer Science, pp. 113-121.
  12. W.-J. Wu, J.-K. Ho and C.Y. Tang (1997), A New Test Sequence Generation Method for Extended Finite-state Machine Models of Communication Protocols, 11th International Conference on Information Networking (ICOIN-11), Taipei, pp. 7B-3.1--7B-3.10.
  13. C.Y. Tang and W.-J. Wu (1997), On the Controllability of Nondeterministic Finite-state Machines, 11th International Conference on Information Networking (ICOIN-11), Taipei, pp. 9A-1.1--9A-1.7.
  14. C.L. Lu and C.Y. Tang (1997), On the Complexity of Efficient Minus Domination, 14th Workshop on Combinatorial Mathematics and Computation Theory, Taichung, Taiwan, pp. 45-48.
  15. S.L. Peng, C.W. Ho, T.S. Hsu, M.T. Ko and C.Y. Tang, Edge and Node Searching Problems on Trees, 3rd Annual International Computing and Combinatorics Conference (COCOON1997), LNCS, Springer Verlag, 1276, pp. 284-293.
  16. Y.D. Liang, C.L. Lu and C.Y. Tang (1997), Efficient Domination on Permutation Graphs and Trapezoid Graphs, 3rd Annual International Computing and Combinatorics Conference (COCOON1997), LNCS, Springer Verlag, 1276, pp. 232-241.
  17. S.-Y. Tseng, C.-T. King and C.Y. Tang (1996), Profiling Dependence Vectors For Loop Parallellizatoin, IEEE Symposium on Parallel and Distributed Processing - Proceedings of the 10th International Parallel Processing Symposium, pp. 23-27.
  18. B.Y. Wu and C.Y. Tang (1996), An Approximate Algorithm for Evolutionary Tree Reconstruction from Distance Matrix, Proceedings of International Conference on Algorithms (joint with International Computer Symposium (ICS1996), Kaohsiung, Taiwan, pp. 72-78.
  19. C.L. Lu and C.Y. Tang (1996), On the Complexity of Perfect Edge Domination Problem, Proceedings of International Conference on Algorithms (joint with International Computer Symposium (ICS1996), Kaohsiung, Taiwan, pp. 64-71.
  20. S.L. Peng, M.T. Ko, C.W. Ho, T.S. Hsu and C.Y. Tang (1996), Graph Searching on Chordal Graphs, 7th International Symposium on Algorithms and Computation (ISSAC1996), LNCS, Springer Verlag, 1178, pp. 156-165.
  21. W.-J. Wu, C.Y. Tang and M.Y. Lin (1996), Methods for Memory Test Time Reduction, Proceedings of IEEE International Workshop on Memory Technology, Design and Testing, pp. 13-14.
  22. W.J. Wu, W.H. Chen and C.Y. Tang (1996), Synchronizable test sequences generation based on the multiplex digraph for multi-party protocol conformance testing, 10th Internationl Conference on Information Networking (ICOIN-10), pp. 29-31.
  23. D.J. Shyu, B.-F. Wang and C.Y. Tang (1995), The Emulation Problem on Trees, 9th International Parallel Processing Symposium, pp. 251-255.
  24. C.K. Chang, K.C. Wu, Y.T. Tsai and C.Y. Tang (1994), A Scalable Fully Distributed Parallel Branch & Bound Algorithm on nCUBE, International Conference on High-Performance Computing in Asia-Pacific Region (HPC'ASIA1995).
  25. D.-J. Shyu, B.-F, Wang and C.Y. Tang (1994), Efficient Emulation For Tree-Connected Networks, ICPADS Proceedings of the International Conference on Parallel and Distributed Systems, pp. 502-507.
  26. S.-J Chiou and C.Y. Tang (1994), Multiple Fault Diagonstic for Communication Protocols, Proceedings of 1994 International Computer Symposium, Hsinchu, Taiwan, R.O.C., pp. 1228-1233.
  27. S.-Y. Tseng, C.-T. King and C.Y. Tang (1993), A New Loop Partition Method- Clustering, Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, pp. 53-64.
  28. D.J. Shyu, C.Y. Tang and B.F. Wang (1994), Fast Algorithms for Simulating the CRCW Shared-Memory on Reconfigurable Meshs, Proceedings of the International Conference on Parallel Processing (ICPP1994), pp. 143-146.
  29. B.C. Liaw, D.J. Shyu, F.C. Lui, C.Y. Tang and R.C.T. Lee (1993), Parallel Implementation of Matrix Searching in Totally Monotone Matrices on nCUBE2 Machine, Proceedings of the International Conference on Parallel and Distributed Systems, Taipei, Taiwan, R.O.C., pp. 504-508.
  30. W.H. Chen and C.Y. Tang (1993), Improving Protocol Conformance Test to satisfy the Uniqueness Criterion, Proceedings of the International Symposium on Communications, Hsinchu, Taiwan, R.O.C., pp. 35-42.
  31. H.E. Wang, W.H. Chen and C.Y. Tang (1993), An Approximation Algorithm for Obtaining UIO Sequences from the FSM Model of a Protocol, Proceedings of 1993 International Symposium on Communications, Hsinchu, Taiwan, pp. 28-34.
  32. W.H. Chen, C.Y. Tang and H. Ural (1993), Minimum-Cost Synchronizable Test Sequence Generation via the DuplexU Diagraph, Proceedings of IEEE Computer and Communication Societies (INFOCOM1993), pp. 128-137.
  33. T.S. Chen, R.C.T. Lee and C.Y. Tang (1992), A Full Speedup Implementation of the SOR Algorithm on nCUBE Machine, Proceedings of 1992 International Conference on Parallel and Distributed Systems, Hsinchu, Taiwan, R.O.C., pp. 347-354.
  34. S.-Y. Tseng, C.-T. King and C.Y. Tang (1992), Minimum Dependent Vector Set: A New Compiler Technique for Enhancing Loop Parallelism, Proceedings of the International Conference on Parallel and Distributed Systems, Hsinchu, Taiwan, R.O.C., pp. 340-346.
  35. J.Y. Hsiao, C.Y. Tang and R.S. Chang (1992), A Linear Algorithm for solving the Weighted Two-Independent Set Problem on Block Graphs, Proceedings of International Computer Symposium, Taichung, Taiwan, Republic of China, pp. 1160-1165.
  36. C.K. Yen and C.Y. Tang (1992), The Bottleneck Independent Dominating Set Problem on Permutation Graphs, Proceedings of International Computer Symposium, Taichung, Taiwan, Republic of China, pp. 455-462.
  37. W.-H. Chen, C.Y. Tang and H.-E. Wang (1991), Synchronizable Protocol Test Generation Via the DuplexT and DuplexL Techniques, Proceedings of National Computer Symposium, Chungli, Taiwan, Republic of China, pp. 20-24.
  38. T.H. Hu, C.Y. Tang and R.C.T. Lee (1991), An Average Case Analysis of Modified Monien and Specknmeyer's Mechanical Theorem Proving Algorithm, Proceedings of the Second Annual International Symposium on Algorithm, Taipei, Taiwan, Republic of China, LNCS, Springer-Verlag, 557, pp. 116-126.
  39. B.Y. Wu and C.Y. Tang (1991), Ranking, Unranking and Parallel Enumerating Topological Orders, Proceedings of the International Conference on Parallel Processing (ICPP1991), pp. 284-285.
  40. B.Y. Wu and C.Y. Tang (1990), An Optimal Parallel Algorithm for Generating Permutations on Linear Array, Proceedings of the 1st Workshop on Parallel Processing, Hsinchu, Taiwan, Republic of China, pp. 106-110.
  41. N.S. Chang, J.S. Wang and C.Y. Tang (1990), Solving Large Sparse Linear System by Iterative Method on Multiprocessor, Proceedings of International Computer Symposium, Hsinchu, Taiwan, Republic of China, pp. 736-741.
  42. H.Y. Fang and C.Y. Tang (1990), Guarding Problems in the Gallery, Proceedings of International Computer Symposium, Hsinchu, Taiwan, Republic of China, pp. 296-302.
  43. C.K. Liang, C.Y. Tang and R.C.T. Lee, An Algorithm for the Euclidean Mini-Sum 2-Clustering Problem, Proceedings of International Conference on Computing and Information (ICCI1990), pp. 67-71.
  44. C.W. Yu and C.Y. Tang (1989), Solving the Direct Domination Problem by Using the Domination Relation Data Structures, Proceedings of National Computer Symposium, Taipei, Taiwan, Republic of China, pp. 95-101.
  45. C.W. Yu and C.Y. Tang (1989), Solving the Longest Common Subsequence Problem by Finding the Longest Chain in the Plane, Proceedings of National Computer Symposium, Taipei, Taiwan, Republic of China, pp. 35-41.
  46. C.K. Liang, C.Y. Tang and R.C.T. Lee (1989), Some Clustering Algorithms Based on the Spanning Tree Vertex Labeling Approach, Proceedings of National Computer Symposium, Taipei, Taiwan, Republic of China, pp. 19-28.
  47. C.Y. Tang and M.C. Chiu (1889), Distributed Sorting on Local Area Networks, Proceedings of the International Conference on Networks, Singapore, pp. 458-462.
  48. Y.L. Liou and C.Y. Tang (1988), Distributed Branch-and-Bound Algorithms on the Single-Bus Broadcast Communication Model, Proceedings of International Computer Symposium, Taipei, Taiwan, Republic of China, pp. 1391-1396.
  49. C.Y. Tang and S.C. Wu (1988), Parallel Graph Algorithms under Broadcast Communication Model, Proceedings of International Computer Symposium, Taipei, Taiwan, Republic of China, pp. 759-763.
  50. Y.C. Chen, G.H. Chen and C.Y. Tang (1988), Using Fewer Processors to Reduce Time Complexities of Semigroup Computations, Proceedings of International Computer Symposium, Taipei, Taiwan, Republic of China, pp. 129-131.
  51. C.Y. Tang, M.W. Du and R.C.T. Lee (1984), Parallel Generation of Combinations, Proceedings of International Computer Symposium, Taipei, Taiwan, Republic of China, pp. 1006-1010.
  52. C.Y. Tang and R.C.T. Lee (1984), Parallel Algorithms Based Upon the Dynamic Programming Approach, Proceedings of International Computer Symposium, Taipei, Taiwan, Republic of China, pp. 709-716.

Poster:

  1. B.Y. Wu and C.Y. Tang (1994), Ranking, Unranking and Parallel Enumerating of Shortest Disjoint Paths on Hypercube, International Symposium on Parallel Architectures, Allgorithms, and Networks.