先後
論文題目
Hong-Bin Chen , Frank K. Hwang, A survey on nonadaptive group testing
algorithms through the angle of decoding, J Comb Optim (2008) 15: 49–59
M.T. Thai, D. MacCallum, P. Deng and W. Wu, Decoding algorithms in
pooling designs with inhibitors and error-tolerance, Int. J.
Bioinformatics Research and Applications, Vol. 3, No. 2 (2007) 145-152
Hiroaki Uehara, A positive detecting algorithm for DNA library screening based on CCCP, 数理解析研究所講究録1465 巻2006 年138-150蔡詩妤
楊嘉勝
Piotr Indyk, Hung Q. Ngo, Atri Rudra, Efficiently Decodable Non-adaptive Group Testing, to appear in proceedings of The
21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 10). January
2010. (2 人合作分兩次報告, 有機率方法 ) Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang, An upper bound of the
number of tests in pooling designs for the error-tolerant complex model, Optimization Letters (2008) 2:425–431徐瑩晏
施智懷
YONGXI CHENG and DING-ZHU DU, Efficient Constructions of Disjunct
Matrices with Applications to DNA Library Screening, JOURNAL OF
COMPUTATIONAL BIOLOGY, Volume 14, Number 9, 2007, Pp. 1208–1216 Hung-Lin Fu, F.K. Hwang, A novel use of t-packings to construct
d-disjunct matrices, Discrete Applied Mathematics 154 (2006) 1759 – 1762 My T. Thai, Taieb Znati, On the complexity and approximation of
non-unique probe selection using d-disjunct matrix, J Comb Optim (2009)
17: 45–53施政成
李權益
YONGXI
CHENG and DING-ZHU DU, New Constructions of One- and Two-Stage Pooling
Designs, JOURNAL OF COMPUTATIONAL BIOLOGY, Volume 15, Number 2, 2008,
Pp. 195–205 Yongxi Cheng, Ding-Zhu Du, Guohui Lin, On the upper bounds of the
minimum number of rows of disjunct matrices, Optim Lett (2009) 3:297–302 Vladimir D. Tonchev, Steiner systems for two-stage disjunctive testing, J Comb Optim (2008) 15: 1–6楊嘉勝
呂惠娟
Hong Gao, F. K. Hwang, My T. Thai, WeiliWu, Taieb Znati, Construction
of d(H)-disjunct matrix for group testing in hypergraphs, J Comb Optim
(2006) 12: 297-301 Annalisa De Bonis, New combinatorial structures with applications to
efficient group testing with inhibitors, J Comb Optim (2008) 15: 77–94 (2 人合作分兩次報告) 李光祥
邱鈺傑
Morgan A. Bishop, Anthony J. Macula, Thomas E. Renz, Vladimir V.
Ufimtsev, Hypothesis group testing for disjoint pairs, J Comb Optim
(2008) 15: 7–16 P.
Damaschke, Threshold Group Testing, R. Ahlswede et al. (Eds.):
Information Transfer and Combinatorics, LNCS 4123, pp. 707–718, 2006. Jun Guo, YuexuanWang, Suogang Gao, Jiangchen Yu, WeiliWu, Constructing
error-correcting pooling designs with symplectic space, J Comb Optim
(2009)洪湧昇
施智懷
Edwin
R. van Dam, Willem H. Haemers, Developments on spectral
characterizations of graphs, Discrete Mathematics 309 (2009) 576-586 (2 人合作分兩次報告 )
Zhifu You, Bolian Liu, The minimum Laplacian spread of unicyclic graphs, Linear Algebra and its Applications 432 (2010) 499–504何恭毅
呂惠娟
Mikhail
Belkin, Partha Niyogi, Laplacian Eigenmaps for Dimensionality Reduction
and Data Representation, Neural Computation 15, 1373–1396 (2003) (2 人合作分兩次報告 ) Peng
Jia, Junsong Yin, Xinsheng Huang, Dewen Hua, Incremental Laplacian
eigenmaps by preserving adjacent information between data points,
Pattern Recognition Letters 30 (2009) 1457–1463 李忠逵
何恭毅
Steve Kirkland, Constructably Laplacian integral graphs, Linear Algebra and its Applications 423 (2007) 3–21 (2 人合作分兩次報告 ) Jianxi
Li,Wai Chee Shiu,Wai Hong Chan, The Laplacian spectral radius of some
graphs, Linear Algebra and its Applications 431 (2009) 99–103洪湧昇
施政成
Jianxi
Li,Wai Chee Shiu,Wai Hong Chan, Some results on the Laplacian
eigenvalues of unicyclic graphs, Linear Algebra and its Applications
430 (2009) 2080–2093 (2 人合作分兩次報告) Carla
Silva Oliveira, Leonardo Silva de Lima, Nair Maria Maia de Abreu,
Pierre Hansen, Bounds on the index of the signless Laplacian of a
graph, Discrete Applied Mathematics (2009) doi:10.1016/j.dam.2009.06.023施智懷
李忠逵