2020 The Best Journal Papers
| [Algorithmica] The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems Huang-Ting Chan, Hsuan-Tsung Chiu & Chang-Biau Yang(楊昌彪), Yung-Hsing Peng(彭永興), 82, pages2039–2062(2020) |
| [Algorithmica] Paired-Domination Problem on Distance-Hereditary Graphs Ching-Chi Lin(林清池), Keng-Chu Ku & Chan-Hung Hsu, 82, pages2809–2840(2020) |
| [Algorithmica] Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization Fu-Hong Liu(劉富翃), Hsiang-Hsuan Liu & Prudence W. H. Wong, 82, pages 3415–3457(2020) |
| [Algorithmica] Approximating the Canadian Traveller Problem with Online Randomization, Erik D. Demaine, Yamming Huang, Chung-Shou Liao(廖崇碩) & Kunihiko Sadakane, Published online, DOI:10.1007/s00453-020-00792-6 (2020). |
| [Journal of Computer and System Sciences] Vulnerability of super extra edge-connected graphs Chia-Wen Cheng, Sun-Yuan Hsieh(謝孫源), Ralf Klasing, 108: 1~9, (2020) |
| [Journal of Computer and System Sciences] Multilevel length-based classified index table for IP lookups and updates Sun-Yuan Hsieh(謝孫源), Sin-Jie Huang, Tai-Hsuan Ho, 112, Pages 66-84(2020) |
| [Journal of Computer and System Sciences] An improved algorithm for the minmax regret path center problem on trees Biing-Feng Wang(王炳豐), Jhih-Hong Ye, Chih-Yu Li, 114, Pages 36-47 (2020) |
2020 Best Master Thesis Award
| 特優 陳學平 Leader Election in Population Protocols (群體協議中的領導者選舉) 台大電機所 (指導教授：陳和麟) |
| 優等 吳伯揚 Selling User Data to No-Regret Advertisers: Dynamic Multi-Item Auctions 交大資管所 (指導教授：陳柏安) |
| 優等 賴冠澐 Online Scheduling: Investigating the Car-sharing Problem from Theoretical Perspective (即時排程：從演算法角度探討即時汽車共享問題) 清華大學工業工程與工程管理學系 (指導教授：廖崇碩) |
| 優等 柯聖彥 The General Max-min Fair Allocation Problem(探討資源分配之最大化最小公平性問題) 清華大學工業工程與工程管理學系 (指導教授：廖崇碩) |
2019 The Best Journal Papers
| [Algorithmica] O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities Mong-Jen Kao(高孟駿), Hai-Lun Tu, D. T. Lee(李德財), 81(5), Algorithmica, 2019, pp. 1800-1817. |
2018 The Best Journal Papers
| [Algorithmica] Dictionary Matching with a Bounded Gap in Pattern or in Text Wing-Kai Hon(韓永楷), Tak-Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang, 80(2), Algorithmica, 2018, pp. 698–713. |
| [Journal of Computer and System Sciences] Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality Li-Hsuan Chen(陳立軒), Dun-Wei Cheng, Sun-Yuan Hsieh(謝孫源), Ling-Ju Hung(洪綾珠), Ralf Klasing, Chia-Wei Lee(李佳衛), Bang-Ye Wu(吳邦一), 92(6), JCSS, 2018, pp. 92-112. |
| [Journal of Computer and System Sciences] The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model Limei Lin, Sun-Yuan Hsieh(謝孫源), Li Xu, Shuming Zhou, Riqing Chen, 95 (1), JCSS, 2018, pp. 1-18. |
| [Journal of Computer and System Sciences] An improved algorithm for the minmax regret path centdian problem on trees Jhih-Hong Ye, Chih-Yu Li, Biing-Feng Wang(王炳豐), 97(7 ), JCSS, 2018, pp. 94-105. |
2018 & 2019 The Best Master Thesis
| 特優 陳彥廷, A Dichotomy Result for Cyclic-Order Traversing Games, 國立交通大學資訊科學與工程研究所 (指導教授：蔡錫鈞) |
| 優等 洪恩平, Approximation Algorithm for Vertex Cover with Multiple Covering Constraints, 國立臺灣大學電機資訊學院資訊工程學系 (指導教授：高孟駿) |
2017 & 2018 The Best Master Thesis
| 特優 林必祥, Fast Algorithms for the Concatenated Longest Common Subsequence Problem with Linear-space S-table, 國立中山大學資訊工程學系 (指導教授：楊昌彪) |
| 優等 蕭家堯, Tight Approximation for Partial Vertex Cover with Hard Capacities, 國立台灣大學資訊工程學系 (指導教授：李德財) |
| 優等 高士舜, Constructing Independent Spanning Trees on Star Networks and Bubble-Sort Network, 台北商業大學資訊與決策科學研究所 (指導教授：張肇明) |
| 佳作 賴恩宏, Power-constrained Image Contrast Enhancement through Sparse Representation by Joint Mixed-norm Regularization, 元智大學資訊工程學系 (指導教授：陳柏豪 ) |
