論文集
下載網址,若有任何疏漏,再煩請來信告知。
Best Paper Competition (以第一作者 "姓" 進行排序)
最佳論文獎 best paper award
- Po-An Chen (陳柏安), Yi-Le Chen (陳以樂) and Wei Lo (羅緯). Opinion Optimization for Two Different Social Objectives: Combinatorial Algorithms and Linear Program Rounding Algorithms
- Alexandre Dolgui, Mikhail Kovalyov and Bertrand M.T. Lin (林妙聰). FPTASes for Scheduling a Distributed Flow-Shop of Maximizing Total Early Work
- Ta-Yu Mu (穆大有) and Ching-Chi Lin (林清池). Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs
- Min-Shu Jao (饒旻書), Hung-Lung Wang (王弘倫) and Jou-Ming Chang (張肇明). Determining the 2-Tuple Total Domination Number of a Haray Graph under Specific Degree Conditions
- Shao-Xuan Lee (李紹瑄), Kuo-Si Huang (黃國璽) and Chang-Biau Yang (楊昌彪). An Efficient Algorithm for Solving the Longest Common Square Subsequence Problem
- Wei-Chung Lin (林蔚鐘) and Hsin-Lung Wu (吳信龍). On the Computational Complexity of Secret-Sharing-based Multi-Party Computation
博碩士論文競賽
博士論文優等: 劉繕榜 - 指導老師:張宜武教授, Antimagic Graphs with Arbitrary Real Number Labels
碩士論文特優: 吳宗達 - 指導老師:蔡錫鈞教授、蔡孟宗教授, Dependent k-Set Packing on Polynomoids
碩士論文優等: 蔡元修 - 指導老師:楊昌彪教授, A Fast Search Method for Similar Protein Sequences
碩士論文優等: 朱可欣 - 指導老師:楊昌彪教授, Algorithms for the Constrained Longest Common Subsequence Problems with t-length and at Least t-length Substrings
碩士論文特優: 吳宗達 - 指導老師:蔡錫鈞教授、蔡孟宗教授, Dependent k-Set Packing on Polynomoids
碩士論文優等: 蔡元修 - 指導老師:楊昌彪教授, A Fast Search Method for Similar Protein Sequences
碩士論文優等: 朱可欣 - 指導老師:楊昌彪教授, Algorithms for the Constrained Longest Common Subsequence Problems with t-length and at Least t-length Substrings
第 39 屆組合數學與計算理論研討會
主辦單位:政治大學資訊學院資訊科學系、演算法與計算理論學會
協辦單位:科技部工程科技推展中心、中央研究院資訊科學研究所、中央研究院資訊科技創新研究中心 (CITI)
聯絡人:張家銘 chang.jiaming GMAIL
協辦單位:科技部工程科技推展中心、中央研究院資訊科學研究所、中央研究院資訊科技創新研究中心 (CITI)
聯絡人:張家銘 chang.jiaming GMAIL