| 第十九屆組合數學與計算理論研討會接受論文名單 |
| 編號 |
作者(英文) |
e-mail address |
論文名稱 |
| A0201 |
M. S. Chang, C. M.
Lee, S. C. Sheu |
mschang@cs.ccu.edu.tw |
The clique tranversal and clique independence of
distance-hereditary graphs |
| A0203 |
Pei-Chi Wu |
pcwu@npit.edu.tw |
On Exponential-Time Completeness of the Circularity Problem for
Attribute Grammars |
| A0204 |
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu |
ychung@iecs.fcu.edu.tw |
The CFS and ED Data Distribution Schemes for Sparse Arrays on
Distributed Memory Multicomputers |
| A0205 |
Bang Ye Wu |
bangye@mail.stu.edu.tw |
Approximating the two-source minimum routing cost spanning trees
of metric graphs |
| A0206 |
Yuh-Rau Wang, Shi-Jinn Horng, Yu-Hua Lee, Pei-Zong Lee |
horng@mouse.ee.ntust.edu.tw |
Optimal parallel algorithms for the 3D Euclidean distance
transform on the CRCW and EREW PRAM models |
| A0209 |
Chin-Tsai Lin,
Wen-Chung Chiu |
ctlin@mail.ksut.edu.tw |
A Routing Scheme for Constructing Node-to-Node Disjoint Paths in
Alternating Group Graphs |
| A0210 |
Hsueh-I Lu |
hil@iis.sinica.edu.tw |
Identifying GC-Rich DNA Segments via Linear-Time Algorithm for
Maximum Average Binary Substring |
| A0211 |
Chui-Cheng Chen |
ccchen@mail.stut.edu.tw |
Embedding of Tree Machines into Hypercubes |
| A0212 |
Tseng-Kuei Li,
Jimmy J. M. Tan, Lih-Hsing Hsu |
lhhsu@cc.nctu.edu.tw |
Fault Hamiltonicity of the Shuffle-Cubes |
| A0213 |
Chun-Chao Yeh, Chun-Hsin Wu |
ccyeh@cs.ntou.edu.tw |
An Efficient Algorithm for Finding Maximal Mean Sequence |
| A0214 |
B.-F. Wnag, S-C.
Ku, and Y.-H. Hsieh |
bfwang@cs.nthu.edu.tw |
The conditional location of a median path |
| A0215 |
Kun-Mao Chao, B. Y. Wu, C. Y. Tang |
kmchao@ym.edu.tw |
On the Optimum Requirement Graph Problem |
| A0216 |
Wen-Lin Yang |
wly@npic.edu.tw |
Lower bound study for the concurrent multicast from multiple
sources |
| A0218 |
Shyi-Tsong Wu and Bin-Chang Chieu |
stwu@ilantech.edu.tw |
A User Friendly Implementation of Smart Card Access with
Threshold Scheme |
| A0221 |
Ruo-Wei Hung, Maw-Shang Chang |
machang@cs.ccu.edu.tw |
A Linear Algorithm for the Connected Domination Problem on
Circular-Arc Graphs |
| A0222 |
Shi-Chun Tsai, Jen-Chun Chang, Rong-Jaye Chen |
sctsai@csie.nctu.edu.tw |
A Space-efficient Godel Numbering with Chinese Remainder Theorem |
| A0223 |
Chau-Jy Lin, Mu Chen Wu and Jyh-Han Lin |
cjlin@cc.nctu.edu.tw |
Systolic Algorithms for Solving Linear Systems |
| A0224 |
Yung-Ling Lai, Feng-Hsu Chiang, Chu-He Lin, Tung-Chin Yu |
yllai@mail.ncyu.edu.tw |
Strong Distance of Complete Bipartite Graphs |
| A0225 |
Chun-Nan Hung, Xiao-Shen Zhu |
spring@mail.dyu.edu.tw |
Construction for Strongly k-Hamiltonian Graphs |
| A0226 |
Fu-Hsing Wang, Jou-Ming Chang, Yue-Li Wang |
ylwang@cs.ntust.edu.tw |
Distributed Algorithms of Finding the Unique Minimum Distance
Dominating Set in Directed Split-Stars |
| A0228 |
Shen-Chuan Tai, Yen-Yu Chen, and Shin-Feng Sheu |
sctai@mail.ncku.edu.tw |
Design a Morphological De-ringing Filter of Ultrasound Images |
| A0229 |
Chi-Yuan Lin, Chin-Hsing Chen |
chiyuan@chinyi.ncit.edu.tw |
Color Image Compression Using Spread Grey-Based Neural Networks
in the Transform Domain |
| A0230 |
Sun-Yuan Hsieh, Chin-wen Ho, Tsan-sheng Hsu, Ming Tat Ko |
hsiehsy@mail.ncku.edu.tw,
hsiehsy@csie.ncnu.edu.tw |
A Linear-Time Algorithm for the Hamiltonian Problem on
Distance-Hereditary Graphs |
| A0231 |
Da-Ren Chen, Chiun-Chieh Hsu |
cchsu@cs.ntust.edu.tw |
Fault-Tolerant Routing For Pyramid Networks Using Least Level
Minimal Routing Method |
| A0232 |
Shyue-Ming Tang, Yue-Li Wang |
ylwang@cs.ntust.edu.tw |
Independent Spanning Trees on Two-dimension Tori |
| A0233 |
SingLing Lee, Hann-Jang Ho |
singling@cs.ccu.edu.tw |
On Minimizing the Maximum Congestion for Weighted Hypergraph
Embedding in a Cycle |
| A0234 |
吳哲賢、王志倫 |
jswu@chu.edu.tw |
生物序列比對問題上考慮凸形間隔處罰函數的一些O(nm)演算法 |
| A0236 |
Yu-lung Lo, Shiou-jiuan Chen, Yu-chen Huang |
yllo@cyut.edu.tw |
Dynamic Load Balancing for Sorting Operation in Parallel
Databases |
| A0237 |
F. R. Hsu, M. K. shan, H. S. Chao, R. C. T. Lee |
frhsu@pu.edu.tw |
Some Optimal Parallel Algorithms for Shortest Path Related
Problems on Interval and Circular-arc Graphs |
| A0238 |
Jung-Sheng Fu |
jsfu@mail.takming.edu.tw |
Cycle Embedding in the Hypercube with Faulty Nodes |
| A0239 |
Yaw-Ling Lin and
Shi-Chun Tsai |
|
Fibonacci Search
with Multiple Probes |
| A0242 |
Tsung-Chuan Huang and Po-Hsueh Hsu |
|
An Efficient Parallel Scheme for Run-Time Scheduling |
| A0243 |
Kuen-Feng Huang, Chang-Biau Yang, Kuo-Tsung Tseng |
|
An Efficient Algorithm for Multiple Sequence Alignment |
| A0244 |
Hon-Chan Chen and Shin-Huei Wu |
|
An O(n) Algorithm for Finding a Tree 3-spanner on Permutation
Graphs |
|
|
|
|