論文集Session A1：Best papers
1. A Multidimensional Divide-and-Conquer Algorithm for Assigning Secondary Structures in Proteins.............................................................1
Kuei-Hao Chen, Guan-Shieng Huang, Chin Lung Lu, Richard Chia-Tung Lee
2. An Improved Algorithm for Sorting by Block-Interchanges Based on Permutation Groups............................................................................9
Yen-Lin Huang, Cheng-Chen Huang, Chuan Yi Tang, Chin Lung Lu
3. An improved algorithm for the red-blue hitting set problem with the consecutive ones property..................................................................15
Maw-Shang Chang, Hsiao-Han Chung, Chuang-Chieh Lin
4. Efficient Indexing for One-dimensional Proportionally-scaled Patterns.........................................................................................................21
Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor
5. The Composition Problem.............................................................................................................................................................................27
J. J. Liu, Y. L. Wang, C. J. Hsu, S. F. Yu
6. An algorithm for the multiple patterns approximate string matching problem...............................................................................................36
Chia-Wei Lu, Chun-Yuan Lin, Chuan-Yi Tang, Wing-Kai Hon
Session B1：Interconnection networks
1. A Fast Pessimistic Diagnosis Algorithm for Generalized Hypercube Multicomputer Systems.......................................................................43
Chien-Hong Chen, Dyi-Rong Duh, Keh-Ning Chang
2. (n–3)-Edge-Fault-Tolerant Weak-Pancyclicity of (n, k)-Star Graphs...........................................................................................................49
Tzu-Lung Chen, Dyi-Rong Duh, Yue-Li Wang
3. Fault-free vertex-pancyclicity in faulty augmented cubes..............................................................................................................................59
Jung-Sheng Fu
4. The fault-tolerant bipancyclicity of the even k-ary n-cube............................................................................................................................64
Jywe-Fei Fang, Chen-Hsiang Liao, Kuo-Hung Tseng, Ming-Yan Chang
5. On the Panconnected Property of Hierarchical Crossed Cube.......................................................................................................................74
Yu-Yu Lu, Hsuan-Han Chang, Pao-Lien Lai, Cheng-Hsuing Tsai, Hong-Chun Hsu
Session C1：Graphs
1. Scheduling Packet Transmissions on Logical Topologies in WDM Optical Star Networks............................................................................83
JungChun Liu, Hann-Jang Ho, Ming-Chin Hwu, SingLing Lee
2. The approximability of the minimum border problem...................................................................................................................................92
Bang Ye Wu, Hung-Chou Chen
3. Minimum Feedback Arc Sets in Rotator Graphs............................................................................................................................................95
Chi-Jung Kuo, Chiun-Chieh Hsu, Hon-Ren Lin, Da-Ren Chen
4. Constructing Optimal Rank-Decomposition Trees of Halin Graphs.............................................................................................................102
Sheng-Lung Peng, Guan-Da Chen, Hsiang-Yu Tsou, In-Te Li, Yan-Fang Li
5. On Node Ranking of Graphs.......................................................................................................................................................................108
Yung-Ling Lai, Sheng-Hsiung Wang, Wei-Chun Lin
Session D1：Algorithms & Applications
1. Efficient Algorithm for Incrementally Deploying Content Objects Over Networks.....................................................................................115
Lung-Pin Chen, Jhen-You Hong
2. A Hybrid Algorithm for the Longest Common Subsequence Problem........................................................................................................122
Hsiang-Yi Weng, Shyue-Horng Shiau, Kuo-Si Huang, Chang-Biau Yang
3. An Improvement Faster Index for Property Matching Algorithm................................................................................................................130
M. T. Juan, J. J. Liu, Y. L. Wang
4. Ate pairing 效能改進之研究.....................................................................................................................................................................134
林志賢
5. Efficient Algorithms for Finding a Heaviest Common Increasing Subsequence..........................................................................................139
Ren-Fu Wang, Zi-Jien Ho, Wen-Ting Fan, Yao-Ting Huang
Session A2：Bioinformatics & Algorithms
1. Three Dimensional Protein Structure Alignment Algorithms with Selective Secondary Structure Information............................................147
Wei-De Jiang, Yaw-Ling Lin, Hong-Shin Chen
2. On the Selection of Tag SNPs for Capturing Human Leukocyte Antigenes.................................................................................................157
Kuo-Wei Chen, Chung-Chan Tsai, Chi-Li Tsai, Yao-Ting Huang
3. An RNA Pseudoknot Folding Algorithm Based on Heuristic Searching......................................................................................................163
C. C. Lin, G. S. Huang, R. C. T. Lee
4. 基因演算法應用於基因體之操作組預測................................................................................................................................................173
莊麗月, 蔡瑞鴻, 楊正宏
Session B2：Interconnection networks & Graphs
1. The degree and extremal number of edges in hamiltonian connected graphs..............................................................................................183
Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu
2. The Hamiltonian cycle passing through prescribed edges in hypercubes with adjacently faulty vertices....................................................187
Chun-Nan Hung, Ying-Jie Lai
3. Diameter Variability of Hypercubes............................................................................................................................................................194
Jeng-Jung Wang, Tung-Yang Ho, Ting-Yi Sung
4. On the Number of Universal Arcs in Cycle-connected Bipartite Tournaments............................................................................................198
Shiang-Ru Yin, An-Hang Chen, Jou-Ming Chang, Yue-Li Wang
Session C2：Graphs
1. List Coloring of Join of Paths......................................................................................................................................................................205
Hsu-Ling Liu, Justie Su-Tzu Juan
2. A Graph Model for Sorting Signed Permutation by Reversal Problem.........................................................................................................211
Hong-Chun Hsu, Sin-San Ye, Pao-Lien Lai
3. On Edge-Balance Index Sets of Regular Graphs.........................................................................................................................................218
Tao-Ming Wang, Chia-Ming Lin, Sin-Min Lee
4. Acyclic chromatic index of Cartesian product of graphs.............................................................................................................................224
Yu-ping Tsao, Chao-Wen Lin
Session D2：Algorithms & Applications
1. Generating Planar Paths in Convex Position in Constant Amortized Time...................................................................................................233
Ro-Yu Wu, Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang
2. An Anti-Collision protocol of RFID Based on Divide and Conquer Algorithm...........................................................................................244
Chen-Chung Liu, Yin-Tsung Chan
3. A Simple Average-Case Analysis of The Reverse Factor Algorithm...........................................................................................................251
Kuei-Hao Chen, Guan-Shieng Huang, Richard Chia-Tung Lee
4. The i-largest Number Domination Sequence and Its Application to the Average Case Analysis of the Horspool Algorithm.......................259
S. C. Chen, G. S. Huang, R. C. T. Lee
Session C3：Graphs
1. On the Maximum Switching Number to Obtain Non-crossing Convex Cycles............................................................................................266
Ro-Yu Wu, Jou-Ming Chang, Jia-Huei Lin
2. The Connected p-Center Problem on Graphs with Lengths on Edges and Weights on Vertices..................................................................274
William C-K Yen, Shung C-S Yang, S-C Hu
3. Statuses of Graphs.......................................................................................................................................................................................282
Chiang Lin, Yuan-Jen Zhang, Jen-Ling Shang
4. An Upper Bound on F-domination Number in Grids...................................................................................................................................288
Fu-Hsing Wang
Session D3：Algorithms & applications
1. A Novel Algorithm for Mining Rare-Utility Itemsets in a Multi-Database Environment..............................................................................293
Guo-Cheng Lan, Tzung-Pei Hong, Vincent S. Tseng
2. 利用區間索引有效處理 DAG 之路徑可達性查詢..................................................................................................................................303
余美伶, 陳耀輝, 陳宇達
Wen-Chuan Lee, Jong-WuuWu, Hsin-Hui Tsou