2008 |
21 | EE | Yaw-Ling Lin:
Efficient Algorithms for SNP Haplotype Block Selection Problems.
COCOON 2008: 309-318 |
2007 |
20 | EE | Yin-Te Tsai,
Yaw-Ling Lin,
Fang-Rong Hsu:
Efficient algorithms for the minimum connected domination on trapezoid graphs.
Inf. Sci. 177(12): 2405-2417 (2007) |
2005 |
19 | EE | Hsun-Chang Chang,
Kuan-Ching Li,
Yaw-Ling Lin,
Chao-Tung Yang,
Hsiao-Hsi Wang,
Liang-Teh Lee:
Performance Issues of Grid Computing Based on Different Architecture Cluster Computing Platforms.
AINA 2005: 321-324 |
18 | | Hsun-Chang Chang,
Po-Shun Yu,
Tze-Wei Huang,
Fang-Rong Hsu,
Yaw-Ling Lin:
The application of alternative splicing graphs in quantitative analysis of alternative splicing form from EST database.
IJCAT 22(1): 14-22 (2005) |
2004 |
17 | EE | Hsun-Chang Chang,
Po-Shun Yu,
Tze-Wei Huang,
Yaw-Ling Lin,
Fang-Rong Hsu:
The Application of Alternative Splicing Graphs in Quantitative Analysis of Alternative Splicing Form from EST Database.
BIBE 2004: 293-300 |
16 | EE | Fang-Rong Hsu,
Hwan-You Chang,
Yaw-Ling Lin,
Yin-Te Tsai,
Hui-Ling Peng,
Ying Tsong Chen,
Che Feng Chen,
Chia Yang Cheng,
Chia-Hung Liu,
Min Yao Shih:
Genome-Wide Alternative Splicing Events Detection through Analysis of Large Scale ESTs.
BIBE 2004: 310-316 |
2003 |
15 | EE | Yaw-Ling Lin,
Tsan-sheng Hsu:
Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome.
ISAAC 2003: 339-351 |
14 | | Yaw-Ling Lin,
Xiaoqiu Huang,
Tao Jiang,
Kun-Mao Chao:
MAVG: locating non-overlapping maximum average segments in a given sequence.
Bioinformatics 19(1): 151-152 (2003) |
2002 |
13 | EE | Yaw-Ling Lin:
Minimum Back-Walk-Free Latency Problem.
COCOON 2002: 525-534 |
12 | EE | Yaw-Ling Lin,
Tao Jiang,
Kun-Mao Chao:
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis.
MFCS 2002: 459-470 |
11 | EE | Yin-Te Tsai,
Yaw-Ling Lin,
Fang-Rong Hsu:
The on-line first-fit algorithm for radio frequency assignment problems.
Inf. Process. Lett. 84(4): 195-199 (2002) |
10 | EE | Yaw-Ling Lin,
Tao Jiang,
Kun-Mao Chao:
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
J. Comput. Syst. Sci. 65(3): 570-586 (2002) |
9 | EE | Yaw-Ling Lin:
Triangle Graphs and Simple Trapezoid Graphs.
J. Inf. Sci. Eng. 18(3): 467-473 (2002) |
8 | EE | Yaw-Ling Lin:
Triangle Graphs and Simple Trapezoid Graphs.
J. Inf. Sci. Eng. 18(3): 467-473 (2002) |
2000 |
7 | EE | Yaw-Ling Lin,
Fang-Rong Hsu,
Yin-Te Tsai:
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs.
COCOON 2000: 126-136 |
1999 |
6 | EE | Fang-Rong Hsu,
Yaw-Ling Lin,
Yin-Te Tsai:
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs.
ISAAC 1999: 173-182 |
1998 |
5 | EE | Yaw-Ling Lin:
Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs.
ISAAC 1998: 267-276 |
1995 |
4 | | Yaw-Ling Lin,
Steven Skiena:
Complexity aspects of visibility graphs.
Int. J. Comput. Geometry Appl. 5(3): 289-312 (1995) |
3 | EE | Yaw-Ling Lin,
Steven Skiena:
Algorithms for Square Roots of Graphs.
SIAM J. Discrete Math. 8(1): 99-118 (1995) |
1994 |
2 | | Yaw-Ling Lin:
Triangle Graphs and Their Coloring.
ORDAL 1994: 128-142 |
1991 |
1 | | Yaw-Ling Lin,
Steven Skiena:
Algorithms for Square Roots of Graphs.
ISA 1991: 12-21 |