| 2008 |
|---|
| 110 | EE | Che-Lun Hung,
Chun-Yuan Lin,
Yeh-Ching Chung,
Chuan Yi Tang:
Introducing Variable Gap Penalties into Three-Sequence Alignment for Protein Sequences.
AINA Workshops 2008: 726-731 |
| 109 | EE | Sheng-Lung Peng,
Yu-Wei Tsay,
Tai-Chun Wang,
Chuan Yi Tang:
Probe Selection with Fault Tolerance.
ICIC (1) 2008: 212-219 |
| 108 | EE | Yun Sheng Chung,
D. Frank Hsu,
Chuan Yi Tang:
On the Relationships Among Various Diversity Measures in Multiple Classifier Systems.
ISPAN 2008: 184-190 |
| 107 | EE | Chia Yang Cheng,
Fang-Rong Hsu,
Chuan Yi Tang:
Extracting Alternative Splicing Information from Captions and Abstracts Using Natural Language Processing.
SUTC 2008: 436-438 |
| 106 | EE | Hsin-Hao Su,
Chin Lung Lu,
Chuan Yi Tang:
An improved algorithm for finding a length-constrained maximum-density subtree in a tree.
Inf. Process. Lett. 109(2): 161-164 (2008) |
| 2007 |
|---|
| 105 | EE | Yen Hung Chen,
Gwo-Liang Liao,
Chuan Yi Tang:
Approximation Algorithms for 2-Source Minimum Routing Cost k -Tree Problems.
ICCSA (3) 2007: 520-533 |
| 104 | EE | Chun-Yuan Lin,
Chen Tai Huang,
Yeh-Ching Chung,
Chuan Yi Tang:
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment.
ICPP 2007: 14 |
| 103 | EE | Yun Sheng Chung,
D. Frank Hsu,
Chuan Yi Tang:
On the Diversity-Performance Relationship for Majority Voting in Classifier Ensembles.
MCS 2007: 407-420 |
| 102 | EE | Kun-Ming Yu,
Jiayi Zhou,
Chun-Yuan Lin,
Chuan Yi Tang:
3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction.
PaCT 2007: 615-622 |
| 101 | EE | Yun Sheng Chung,
Chin Lung Lu,
Chuan Yi Tang:
Constrained sequence alignment: A general model and the hardness results.
Discrete Applied Mathematics 155(18): 2471-2486 (2007) |
| 100 | EE | Yun Sheng Chung,
Chin Lung Lu,
Chuan Yi Tang:
Efficient algorithms for regular expression constrained sequence alignment.
Inf. Process. Lett. 103(6): 240-246 (2007) |
| 99 | EE | Kuan-Ching Li,
Chiou-Nan Chen,
Tsu-Yi Hsieh,
Chia-Hsien Wen,
Joung-Liang Lan,
Der-Yuan Chen,
Chuan Yi Tang:
Towards design of a nailfold capillary microscopy image analysis and diagnosis framework using grid technology.
J. High Speed Networks 16(1): 81-89 (2007) |
| 98 | EE | Yun Sheng Chung,
Wei-Hsun Lee,
Chuan Yi Tang,
Chin Lung Lu:
RE-MuSiC: a tool for multiple sequence alignment with regular expression constraints.
Nucleic Acids Research 35(Web-Server-Issue): 639-644 (2007) |
| 2006 |
|---|
| 97 | EE | Yun Sheng Chung,
Chin Lung Lu,
Chuan Yi Tang:
Efficient Algorithms for Regular Expression Constrained Sequence Alignment.
CPM 2006: 389-400 |
| 96 | EE | Yen Hung Chen,
Chuan Yi Tang:
The Bottleneck Tree Alignment Problems.
ICCSA (3) 2006: 631-637 |
| 95 | EE | Kun-Ming Yu,
Jiayi Zhou,
Chun-Yuan Lin,
Chuan Yi Tang:
An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR.
ISPA Workshops 2006: 215-220 |
| 94 | EE | Shu Ju Hsieh,
Chun-Yuan Lin,
Ning Han Liu,
Chuan Yi Tang:
Comparative Gene Prediction Based on Gene Structure Conservation.
PRIB 2006: 32-41 |
| 93 | EE | Kuan-Ching Li,
Chiou-Nan Chen,
Tsung-Ying Wu,
Chia-Hsien Wen,
Chuan Yi Tang:
BioPortal: A Portal for Deployment of Bioinformatics Applications on Cluster and Grid Environments.
VECPAR 2006: 566-578 |
| 92 | | Ying Chih Lin,
Chuan Yi Tang:
Exposing Phylogenetic Relationships by Genome Rearrangement.
Advances in Computers 68: 2-59 (2006) |
| 91 | EE | Hao-Teng Chang,
Tun-Wen Pai,
Tan-Chi Fan,
Bo-Han Su,
Pei-Chih Wu,
Chuan Yi Tang,
Chun-Tien Chang,
Shi-Hwei Liu,
Margaret Dah-Tsyr Chang:
A reinforced merging methodology for mapping unique peptide motifs in members of protein families.
BMC Bioinformatics 7: 38 (2006) |
| 90 | EE | Chung-Ming Lin,
Yin-Te Tsai,
Chuan Yi Tang:
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs.
Inf. Process. Lett. 99(2): 64-67 (2006) |
| 89 | EE | Po-Hsueh Huang,
Yin-Te Tsai,
Chuan Yi Tang:
A Near-Quadratic Algorithm for the Alpha-Connected Two-Center Problem.
J. Inf. Sci. Eng. 22(6): 1317-1324 (2006) |
| 88 | EE | Yen Hung Chen,
Bang Ye Wu,
Chuan Yi Tang:
Approximation algorithms for some k-source shortest paths spanning tree problems.
Networks 47(3): 147-156 (2006) |
| 87 | EE | Shu Ju Hsieh,
Chun-Yuan Lin,
Ning Han Liu,
Wei Yuan Chow,
Chuan Yi Tang:
GeneAlign: a coding exon prediction tool based on phylogenetical comparisons.
Nucleic Acids Research 34(Web-Server-Issue): 280-284 (2006) |
| 86 | EE | Ying Chih Lin,
Chin Lung Lu,
Ying-Chuan Liu,
Chuan Yi Tang:
SPRING: a tool for the analysis of genome rearrangement using reversals and block-interchanges.
Nucleic Acids Research 34(Web-Server-Issue): 696-699 (2006) |
| 2005 |
|---|
| 85 | EE | Chun-Yuan Lin,
Ken-Li Lin,
Chuen-Der Huang,
Hsiu-Ming Chang,
Chiao Yun Yang,
Chin-Teng Lin,
Chuan Yi Tang,
D. Frank Hsu:
Feature Selection and Combination Criteria for Improving Predictive Accuracy in Protein Structure Classification.
BIBE 2005: 311-315 |
| 84 | EE | Shu Ju Hsieh,
Yun Sheng Chung,
Chuan Yi Tang,
Chun-Yuan Lin:
Comparative Exon Prediction based on Heuristic Coding Region Alignment.
ISPAN 2005: 14-19 |
| 83 | EE | Yen Hung Chen,
Hsueh-I Lu,
Chuan Yi Tang:
Disjoint Segments with Maximum Density.
International Conference on Computational Science (2) 2005: 845-850 |
| 82 | EE | Kun-Ming Yu,
Yu-Weir Chang,
YaoHua Yang,
Jiayi Zhou,
Chun-Yuan Lin,
Chuan Yi Tang:
A Fast Technique for Constructing Evolutionary Tree with the Application of Compact Sets.
PaCT 2005: 346-354 |
| 81 | EE | Shu Ju Hsieh,
Yun Sheng Chung,
Chun-Yuan Lin,
Chuan Yi Tang:
EXONSCAN: EXON prediction with Signal detection and Coding region AligNment in homologous sequences.
SAC 2005: 202-203 |
| 80 | EE | Chin Lung Lu,
Tsui Ching Wang,
Ying Chih Lin,
Chuan Yi Tang:
ROBIN: a tool for genome rearrangement of block-interchanges.
Bioinformatics 21(11): 2780-2782 (2005) |
| 79 | EE | Chuan-Min Lee,
Ling-Ju Hung,
Maw-Shang Chang,
Chia-Ben Shen,
Chuan Yi Tang:
An improved algorithm for the maximum agreement subtree problem.
Inf. Process. Lett. 94(5): 211-216 (2005) |
| 78 | EE | Ying Chih Lin,
Chin Lung Lu,
Hwan-You Chang,
Chuan Yi Tang:
An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species.
Journal of Computational Biology 12(1): 102-112 (2005) |
| 2004 |
|---|
| 77 | EE | Hsiao Ping Lee,
Yin-Te Tsai,
Ching Hua Shih,
Tzu Fang Sheu,
Chuan Yi Tang:
An IDC-based Algorithm for Efficient Homology Filtration with Guaranteed Seriate Coverage.
BIBE 2004: 395-402 |
| 76 | EE | Chuan-Min Lee,
Ling-Ju Hung,
Maw-Shang Chang,
Chuan Yi Tang:
An Improved Algorithm for the Maximum Agreement Subtree Problem.
BIBE 2004: 533-536 |
| 75 | EE | Hsiao Ping Lee,
Tzu Fang Sheu,
Yin-Te Tsai,
Ching Hua Shih,
Chuan Yi Tang:
A Efficient Algorithm for Unique Signature Discovery on Whole-Genome EST Databases.
CSB 2004: 650-651 |
| 74 | EE | Yen Hung Chen,
Bang Ye Wu,
Chuan Yi Tang:
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
ICCSA (3) 2004: 355-366 |
| 73 | | Frank Kuo,
Yuehching Lee,
Chuan Yi Tang:
The Development of RFID in Healthcare in Taiwan.
ICEB 2004: 340-345 |
| 72 | EE | Hsiao Ping Lee,
Yin-Te Tsai,
Chuan Yi Tang:
A seriate coverage filtration approach for homology search.
SAC 2004: 180-184 |
| 71 | EE | Jen-Shiang K. Yu,
Jenn-Kang Hwang,
Chuan Yi Tang,
Chin-Hui Yu:
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 Modeling 44(2): 635-642 (2004) |
| 2003 |
|---|
| 70 | EE | Yen Hung Chen,
Chin Lung Lu,
Chuan Yi Tang:
On the Full and Bottleneck Full Steiner Tree Problems.
COCOON 2003: 122-129 |
| 69 | | Chihan Lee,
Ya-ting Lin,
Chuan Yi Tang,
Yuh-Shyong Yang:
Identify Amino Acid Candidates Critical for Function of Rat Imidase by Cross-reference Voting in Imidase SuperFamily.
SAC 2003: 127-134 |
| 68 | EE | Po-Hsueh Huang,
Yin-Te Tsai,
Chuan Yi Tang:
A fast algorithm for the alpha-connected two-center decision problem.
Inf. Process. Lett. 85(4): 205-210 (2003) |
| 67 | EE | Chuan Yi Tang,
Chin Lung Lu,
Margaret Dah-Tsyr Chang,
Yin-Te Tsai,
Yuh-Ju Sun,
Kun-Mao Chao,
Jia-Ming Chang,
Yu-Han Chiou,
Chia-Mao Wu,
Hao-Teng Chang,
Wei-I Chou:
Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment.
J. Bioinformatics and Computational Biology 1(2): 267-288 (2003) |
| 66 | EE | Chin Lung Lu,
Sheng-Lung Peng,
Chuan Yi Tang:
Efficient minus and signed domination in graphs.
Theor. Comput. Sci. 1-3(301): 381-397 (2003) |
| 65 | EE | Chin Lung Lu,
Chuan Yi Tang,
Richard Chia-Tung Lee:
The full Steiner tree problem.
Theor. Comput. Sci. 306(1-3): 55-67 (2003) |
| 2002 |
|---|
| 64 | EE | Po-Hsueh Huang,
Yin-Te Tsai,
Chuan Yi Tang:
A near-quadratic algorithm for the alpha-connected two-center decision problem.
CCCG 2002: 133-136 |
| 63 | EE | Chin Lung Lu,
Chuan Yi Tang,
Richard Chia-Tung Lee:
The Full Steiner Tree Problem in Phylogeny.
COCOON 2002: 107-116 |
| 62 | EE | Chuan Yi Tang,
Chin Lung Lu,
Margaret Dah-Tsyr Chang,
Yin-Te Tsai,
Yuh-Ju Sun,
Kun-Mao Chao,
Jia-Ming Chang,
Yu-Han Chiou,
Chia-Mao Wu,
Hao-Teng Chang,
Wei-I Chou:
Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment.
CSB 2002: 127-137 |
| 61 | | Chin Lung Lu,
Chuan Yi Tang:
Weighted efficient domination problem on some perfect graphs.
Discrete Applied Mathematics 117(1-3): 163-182 (2002) |
| 60 | | Chin Lung Lu,
Ming-Tat Ko,
Chuan Yi Tang:
Perfect edge domination and efficient edge domination in graphs.
Discrete Applied Mathematics 119(3): 227-250 (2002) |
| 59 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Light graphs with small routing cost.
Networks 39(3): 130-138 (2002) |
| 2001 |
|---|
| 58 | EE | Chin Lung Lu,
Zheng-Yao Su,
Chuan Yi Tang:
A New Measure of Edit Distance between Labeled Trees.
COCOON 2001: 338-348 |
| 57 | EE | Bor-Kuan Lu,
Fang-Rong Hsu,
Chuan Yi Tang:
Finding the shortest boundary guard of a simple polygon.
Theor. Comput. Sci. 263(1-2): 113-121 (2001) |
| 2000 |
|---|
| 56 | EE | Wen-Jer Wu,
Chuan Yi Tang:
Memory test time reduction by interconnecting test items.
Asian Test Symposium 2000: 290-298 |
| 55 | EE | Chin Lung Lu,
Sheng-Lung Peng,
Chuan Yi Tang:
Efficient Minus and Signed Domination in Graphs.
ISAAC 2000: 241-253 |
| 54 | 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) |
| 53 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation algorithms for some optimum communication spanning tree problems.
Discrete Applied Mathematics 102(3): 245-266 (2000) |
| 52 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation algorithms for the shortest total path length spanning tree problem.
Discrete Applied Mathematics 105(1-3): 273-289 (2000) |
| 51 | EE | Bor-Kuan Lu,
Fang-Rong Hsu,
Chuan Yi Tang:
Guarding in a simple polygon.
Inf. Process. Lett. 75(4): 153-158 (2000) |
| 50 | EE | Fang-Cheng Leu,
Yin-Te Tsai,
Chuan Yi Tang:
An efficient external sorting algorithm.
Inf. Process. Lett. 75(4): 159-163 (2000) |
| 49 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees.
J. Algorithms 36(2): 182-204 (2000) |
| 48 | 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 |
|---|
| 47 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Constructing Light Spanning Trees with Small Routing Cost.
STACS 1999: 334-344 |
| 46 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree.
Inf. Process. Lett. 69(2): 63-67 (1999) |
| 45 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
J. Comb. Optim. 3(2-3): 199-211 (1999) |
| 44 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput. 29(3): 761-778 (1999) |
| 1998 |
|---|
| 43 | | Ying Teh Tsai,
Chuan Yi Tang:
An Average Case Analysis of the Branching Algorithm for Solving $k$-Satisfiability Problems.
CATS 1998: 137-150 |
| 42 | EE | Bor-Kuan Lu,
Fang-Rong Hsu,
Chuan Yi Tang:
Guarding in a simple polygon.
CCCG 1998 |
| 41 | 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 |
| 40 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
COCOON 1998: 299-308 |
| 39 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.
ISAAC 1998: 407-416 |
| 38 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SODA 1998: 21-32 |
| 37 | EE | Wen-Jer Wu,
Wen-Huei Chen,
Chuan Yi Tang:
Synchronizable test sequence for multi-party protocol conformance testing.
Computer Communications 21(13): 1177-1183 (1998) |
| 36 | EE | Chin Lung Lu,
Chuan Yi Tang:
Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs.
Discrete Applied Mathematics 87(1-3): 203-211 (1998) |
| 35 | EE | Daw-Jong Shyu,
Biing-Feng Wang,
Chuan Yi Tang:
Efficient Emulations for X-trees and /w-ary Trees.
Parallel Algorithms Appl. 13(2): 95-116 (1998) |
| 1997 |
|---|
| 34 | | Y. Daniel Liang,
Chin Lung Lu,
Chuan Yi Tang:
Effincient Domination of Permutation Graphs and Trapezoid Graphs.
COCOON 1997: 232-241 |
| 33 | | 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 |
| 32 | EE | Chin Lung Lu,
Chuan Yi Tang:
A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs.
Inf. Process. Lett. 61(2): 107-111 (1997) |
| 31 | EE | Bang Ye Wu,
Chuan Yi Tang:
An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree.
Inf. Process. Lett. 63(5): 263-269 (1997) |
| 1996 |
|---|
| 30 | EE | Shaw-Yen Tseng,
Chung-Ta King,
Chuan Yi Tang:
Profiling Dependence Vectors for Loop Parallelization.
IPPS 1996: 23-27 |
| 29 | | 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 |
|---|
| 28 | EE | Daw-Jong Shyu,
Biing-Feng Wang,
Chuan Yi Tang:
The emulation problem on trees.
IPPS 1995: 251- |
| 27 | EE | Wen-Huei Chen,
Chuan Yi Tang,
Son T. Vuong:
Improving the UIOv-method for protocol conformance testing.
Computer Communications 18(9): 609-619 (1995) |
| 1994 |
|---|
| 26 | | Daw-Jong Shyu,
Biing-Feng Wang,
Chuan Yi Tang:
An Efficient Emulation for Tree-Connected Networks.
ICPADS 1994: 502-507 |
| 25 | | Daw-Jong Shyu,
Biing-Feng Wang,
Chuan Yi Tang:
Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes.
ICPP (3) 1994: 143-146 |
| 24 | | Ying The Tsai,
Chuan Yi Tang,
Yunn Yen Chen:
Average Performance of a Greedy Algorithm for the On-Line Minimum Matching Problem on Euclidean Space.
Inf. Process. Lett. 51(6): 275-282 (1994) |
| 23 | | Ju Yuan Hsiao,
Chuan Yi Tang,
Ruay Shiung Chang,
Richard C. T. Lee:
Single Step Searching in Weighted Block Graphs.
Inf. Sci. 81(1-2): 1-29 (1994) |
| 1993 |
|---|
| 22 | | Shaw-Yen Tseng,
Chung-Ta King,
Chuan Yi Tang:
A New Loop Partition Method-Clustering.
Architectures and Compilation Techniques for Fine and Medium Grain Parallelism 1993: 53-64 |
| 21 | | Wen-Huei Chen,
Chuan Yi Tang,
Hasan Ural:
Minimum-Cost Synchronizable Test Sequence Generation via the DuplexU Digraph.
INFOCOM 1993: 128-135 |
| 20 | | Wen-Huei Chen,
Chuan Yi Tang:
A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem.
Inf. Process. Lett. 47(1): 43-49 (1993) |
| 19 | | Ying Teh Tsai,
Chuan Yi Tang:
The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems.
Inf. Process. Lett. 48(4): 177-182 (1993) |
| 18 | EE | Ju Yuan Hsiao,
Chuan Yi Tang,
Ruay Shiung Chang:
The summation and bottleneck minimization for single-step searching on weighted graphs.
Inf. Sci. 74(1-2): 1-28 (1993) |
| 17 | EE | Chiou-Kuo Liang,
Chuan Yi Tang,
Richard C. T. Lee:
A Different Approach for Solving the Specified Diameter Partition Problem.
J. Inf. Sci. Eng. 9(3): 337-357 (1993) |
| 1992 |
|---|
| 16 | | Maw-Shang Chang,
Chuan Yi Tang,
Richard C. T. Lee:
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.
Algorithmica 8(3): 177-194 (1992) |
| 15 | | T. H. Hu,
Chuan Yi Tang,
Richard C. T. Lee:
An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving.
Ann. Math. Artif. Intell. 6(1-3): 235-251 (1992) |
| 14 | EE | Maw-Shang Chang,
Chuan Yi Tang,
Richard C. T. Lee:
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.
Discrete Applied Mathematics 39(1): 1-12 (1992) |
| 13 | | Ju Yuan Hsiao,
Chuan Yi Tang,
Ruay Shiung Chang:
An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs.
Inf. Process. Lett. 43(5): 229-235 (1992) |
| 12 | | Ju Yuan Hsiao,
Chuan Yi Tang:
An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs.
Inf. Process. Lett. 43(5): 229-235 (1992) |
| 11 | EE | Wen-Huei Chen,
Chuan Yi Tang:
Tightly-Synchronizable Protocol Test Generation Via the Duplex Technique.
J. Inf. Sci. Eng. 8(2): 167-186 (1992) |
| 10 | EE | Chuan Yi Tang,
Yuh Hann Liang:
Using Conflicts to Derive Efficient Algorithms on the Single-Channel Broadcast Communication Model.
J. Inf. Sci. Eng. 8(2): 187-206 (1992) |
| 1991 |
|---|
| 9 | | Bang Ye Wu,
Chuan Yi Tang:
Ranking Unranking and Parallel Enumerating of Topological Orders.
ICPP (3) 1991: 284-285 |
| 8 | | T. H. Hu,
Chuan Yi Tang,
Richard C. T. Lee:
An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm.
ISA 1991: 116-126 |
| 7 | | Wen-Huei Chen,
Chuan Yi Tang:
Computing the Optimal IO Sequences of a Protocol in Polynomial Time.
Inf. Process. Lett. 40(3): 145-148 (1991) |
| 6 | | Ju Yuan Hsiao,
Chuan Yi Tang,
Ruay Shiung Chang:
Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem.
Inf. Process. Lett. 40(5): 283-287 (1991) |
| 5 | | W. T. Liou,
Chuan Yi Tang,
Richard C. T. Lee:
Covering convex rectilinear polygons in linear time.
Int. J. Comput. Geometry Appl. 1(2): 137-185 (1991) |
| 1990 |
|---|
| 4 | | Maw-Shang Chang,
Chuan Yi Tang,
Richard C. T. Lee:
20-Relative Neighborhood Graphs Are Hamiltonian.
SIGAL International Symposium on Algorithms 1990: 53-65 |
| 3 | | Maw-Shang Chang,
Nen-Fu Huang,
Chuan Yi Tang:
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs.
Inf. Process. Lett. 35(5): 255-260 (1990) |
| 1985 |
|---|
| 2 | | Chuan Yi Tang,
D. J. Fuehrer,
Richard C. T. Lee:
On the complexity of some multi-attribute file design problems.
Inf. Syst. 10(1): 21-25 (1985) |
| 1984 |
|---|
| 1 | EE | Chuan Yi Tang,
Richard C. T. Lee:
Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy.
Inf. Sci. 32(3): 173-186 (1984) |
