三月三十日

三月三十一日

屏東一日遊 (墾丁、海洋生物館等）

附註：

A1: Graph Algorithms(1)

1. Shyue-Ming Tang and Yue-Li Wang
"Independent Spanning Trees on Two-dimension Tori"

2. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, and Ming Tat Ko
"A Linear-Time Algorithm for the Hamiltonian Problem
on Distance-Hereditary Graphs"

3. Yung-Ling Lai, Feng-Hsu Chiang, Chu-He Lin, and Tung-Chin Yu
"Strong Distance of Complete Bipartite Graphs"

4. Chun-Nan Hung and Xiao-Shen Zhu
"Construction for Strongly k-Hamiltonian Graphs"

5. Fu-Hsing Wang, Jou-Ming Chang, and Yue-Li Wang
"Distributed Algorithms of Finding the Unique Minimum
Distance Dominating Set in Directed Split-Stars"

B1: Computational Biology

1. Bang Ye Wu
"Approximating the Two-source Minimum Routing Cost
Spanning Trees of Metric Graphs"

2. Bang Ye Wu, Kun-Mao Chao, and Chuan Yi Tang
"On the Optimum Requirement Graph Problem"

3. Hsueh-I Lu
"Identifying GC-Rich DNA Segments via Linear-Time
Algorithm for Maximum Average Binary Substring"

4. 吳哲賢、王志倫
"生物序列比對問題上考慮凸形間隔處罰函數的一些O(nm)演算法"

5. Kuen-Feng Huang, Chang-Biau Yang, and Kuo-Tsung Tseng
"An Efficient Algorithm for Multiple Sequence Alignment"

A2: Graph Algorithms(2)

1. Hon-Chan Chen and Shin-Huei Wu
"An O(n) Algorithm for Finding a Tree 3-spanner on Permutation Graphs"

2. C. M. Lee, M. S. Chang, and S. C. Sheu
"The Clique Transversal and Clique Independence of Distance Hereditary Graphs"

3. Ruo-Wei Hung and Maw-Shang Chang
"A Linear Algorithm for the Connected Domination Problem on Circular-Arc Graphs"

4. F. R. Hsu, M. K. Shan, H. S. Chao, and R. C. T. Lee
"Some Optimal Parallel Algorithms for Shortest Path Related Problems on Interval and Circular-arc Graphs"

B2: Interconnection Networks(1)
1. Chin-Tsai Lin and Wen-Chung Chiu
"A Routing Scheme for Constructing Node-to-Node Disjoint Paths in Alternating Group Graphs"

2. Chui-Cheng Chen
"Embedding of Tree Machines into Hypercubes"

3. Tseng-Kuei Li, Jimmy J. M. Tan, and Lih-Hsing Hsu
"Fault Hamiltonicity of the Shuffle-Cubes"

4. Wen-Lin Yang
"Lower Bound Study for the Concurrent Multicast from Multiple Sources"

A3: Image Processing
1. Shen-Chuan Tai, Yen-Yu Chen, and Shin-Feng Sheu
"Design a Morphological De-ringing Filter of Ultrasound Images"

2. Chi-Yuan Lin and Chin-Hsing Chen
"Color Image Compression Using Spread Grey-Based Neural Networks in the Transform Domain"

3. Shyi-Tsong Wu and Bin-Chang Chieu
"A User Friendly Implementation of Smart Card Access with Threshold Scheme"

B3: Interconnection Networks(2)

1. Da-Ren Chen and Chiun-Chieh Hsu
"Fault-Tolerant Routing for Pyramid Networks Using Least Level Minimal Routing Method"

2. SingLing Lee and Hann-Jang Ho
"On Minimizing the Maximum Congestion for Weighted Hypergraph Embedding in a Cycle"

3. Jung-Sheng Fu
"Cycle Embedding in the Hypercube with Faulty Nodes"

A4: Combinatorial Algorithms
1. Pei-Chi Wu
"On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars"

2. Chun-Chao Yeh and Chun-Hsin Wu
"An Efficient Algorithm for Finding Maximal Mean Sequence"

3. Biing-Feng Wang, Shan-Chyun Ku, and Yong-Hsian Hsieh
"The Conditional Location of a Median Path"

4. Shi-Chun Tsai, Jen-Chun Chang, and Rong-Jaye Chen
"A Space-efficient Godel Numbering with Chinese Remainder Theorem"

5. Yaw-Ling Lin and Shi-Chun Tsai
"Fibonacci Search with Multiple Probes"

B4: Parallel Algorithms

1. Chun-Yuan Lin, Yeh-Ching Chung, andJen-Shiuh Liu
"The CFS and ED Data Distribution Schemes for Sparse Arrays on Distributed Memory Multicomputers"

2. Yuh-Rau Wang, Shi-Jinn Horng, Yu-Hua Lee, and Pei-Zong Lee
"Optimal Parallel Algorithms for the 3D EuclideanDistance Transform on the CRCW and EREW PRAM Models"

3. Chau-Jy Lin, Muh-Cherng Wu, and Chih-Han Lin
"Systolic Algorithms for Solving Linear Systems"

4. Yu-lung Lo, Shiou-jiuan Chen, and Yu-chen Huang
"Dynamic Load Balancing for Sorting Operation inParallel Databases"

5. Tsung-Chuan Huang and Po-Hsueh Hsu
"An Efficient Parallel Scheme for Run-Time Scheduling"