{"id":51,"date":"2017-10-02T10:28:42","date_gmt":"2017-10-02T10:28:42","guid":{"rendered":"http:\/\/140.114.54.13\/test_aact2\/en\/?page_id=51"},"modified":"2021-02-22T19:28:43","modified_gmt":"2021-02-22T11:28:43","slug":"awards","status":"publish","type":"page","link":"http:\/\/www.aact.org.tw\/en\/index.php\/news\/awards\/","title":{"rendered":"Awards"},"content":{"rendered":"
2020 The Best Journal Papers<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n
[Algorithmica]
\nThe Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems
\nHuang-Ting Chan, Hsuan-Tsung Chiu & Chang-Biau Yang(\u694a\u660c\u5f6a), Yung-Hsing Peng(\u5f6d\u6c38\u8208), 82, pages2039\u20132062(2020)<\/td>\n<\/tr>\n
[Algorithmica]
\nPaired-Domination Problem on Distance-Hereditary Graphs
\nChing-Chi Lin(\u6797\u6e05\u6c60), Keng-Chu Ku & Chan-Hung Hsu, 82, pages2809\u20132840(2020)<\/td>\n<\/tr>\n
[Algorithmica]
\nNon-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization
\nFu-Hong Liu(\u5289\u5bcc\u7fc3), Hsiang-Hsuan Liu & Prudence W. H. Wong, 82, pages 3415\u20133457(2020)<\/td>\n<\/tr>\n
[Algorithmica]
\nApproximating the Canadian Traveller Problem with Online Randomization,
\nErik D. Demaine, Yamming Huang, Chung-Shou Liao(\u5ed6\u5d07\u78a9) & Kunihiko Sadakane, Published online, DOI:10.1007\/s00453-020-00792-6 (2020).<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nVulnerability of super extra edge-connected graphs
\nChia-Wen Cheng, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Ralf Klasing, 108: 1~9, (2020)<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nMultilevel length-based classified index table for IP lookups and updates
\nSun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Sin-Jie Huang, Tai-Hsuan Ho, 112, Pages 66-84(2020)<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nAn improved algorithm for the minmax regret path center problem on trees
\nBiing-Feng Wang(\u738b\u70b3\u8c50), Jhih-Hong Ye, Chih-Yu Li, 114, Pages 36-47 (2020)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

2020 Best Master Thesis Award<\/strong><\/h5>\n\n\n\n\n\n\n
\u7279\u512a \u9673\u5b78\u5e73 Leader Election in Population Protocols (\u7fa4\u9ad4\u5354\u8b70\u4e2d\u7684\u9818\u5c0e\u8005\u9078\u8209) \u53f0\u5927\u96fb\u6a5f\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u548c\u9e9f)<\/td>\n<\/tr>\n
\u512a\u7b49 \u5433\u4f2f\u63da Selling User Data to No-Regret Advertisers: Dynamic Multi-Item Auctions \u4ea4\u5927\u8cc7\u7ba1\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89)<\/td>\n<\/tr>\n
\u512a\u7b49 \u8cf4\u51a0\u6f90 Online Scheduling: Investigating the Car-sharing Problem from Theoretical Perspective (\u5373\u6642\u6392\u7a0b\uff1a\u5f9e\u6f14\u7b97\u6cd5\u89d2\u5ea6\u63a2\u8a0e\u5373\u6642\u6c7d\u8eca\u5171\u4eab\u554f\u984c) \u6e05\u83ef\u5927\u5b78\u5de5\u696d\u5de5\u7a0b\u8207\u5de5\u7a0b\u7ba1\u7406\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5ed6\u5d07\u78a9)<\/td>\n<\/tr>\n
\u512a\u7b49 \u67ef\u8056\u5f65 The General Max-min Fair Allocation Problem(\u63a2\u8a0e\u8cc7\u6e90\u5206\u914d\u4e4b\u6700\u5927\u5316\u6700\u5c0f\u516c\u5e73\u6027\u554f\u984c) \u6e05\u83ef\u5927\u5b78\u5de5\u696d\u5de5\u7a0b\u8207\u5de5\u7a0b\u7ba1\u7406\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5ed6\u5d07\u78a9)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

<\/p>\n

2019 The Best Journal Papers<\/strong><\/h5>\n\n\n\n
[Algorithmica]
\nO(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities
\nMong-Jen Kao(\u9ad8\u5b5f\u99ff), Hai-Lun Tu, D. T. Lee(\u674e\u5fb7\u8ca1), 81(5), Algorithmica, 2019, pp. 1800-1817.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2018 The Best Journal Papers<\/strong><\/h5>\n\n\n\n\n\n\n
[Algorithmica]
\nDictionary Matching with a Bounded Gap in Pattern or in Text
\nWing-Kai Hon(\u97d3\u6c38\u6977), Tak-Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang, 80(2), Algorithmica, 2018, pp. 698\u2013713.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nApproximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
\nLi-Hsuan Chen(\u9673\u7acb\u8ed2), Dun-Wei Cheng, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Ling-Ju Hung(\u6d2a\u7dbe\u73e0), Ralf Klasing, Chia-Wei Lee(\u674e\u4f73\u885b), Bang-Ye Wu(\u5433\u90a6\u4e00), 92(6), JCSS, 2018, pp. 92-112.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nThe relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
\nLimei Lin, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Li Xu, Shuming Zhou, Riqing Chen, 95 (1), JCSS, 2018, pp. 1-18.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nAn improved algorithm for the minmax regret path centdian problem on trees
\nJhih-Hong Ye, Chih-Yu Li, Biing-Feng Wang(\u738b\u70b3\u8c50), 97(7 ), JCSS, 2018, pp. 94-105.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

2018 & 2019 The Best Master Thesis<\/strong><\/h5>\n\n\n\n\n
\u7279\u512a \u9673\u5f65\u5ef7, A Dichotomy Result for Cyclic-Order Traversing Games, \u570b\u7acb\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u8207\u5de5\u7a0b\u7814\u7a76\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u8521\u932b\u921e)<\/td>\n<\/tr>\n
\u512a\u7b49 \u6d2a\u6069\u5e73, Approximation Algorithm for Vertex Cover with Multiple Covering
\nConstraints, \u570b\u7acb\u81fa\u7063\u5927\u5b78\u96fb\u6a5f\u8cc7\u8a0a\u5b78\u9662\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9ad8\u5b5f\u99ff)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2017 & 2018 The Best Master Thesis<\/strong><\/h5>\n\n\n\n\n\n\n
\u7279\u512a \u6797\u5fc5\u7965, Fast Algorithms for the Concatenated Longest Common Subsequence Problem with Linear-space S-table, \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a)<\/td>\n<\/tr>\n
\u512a\u7b49 \u856d\u5bb6\u582f, Tight Approximation for Partial Vertex Cover with Hard Capacities, \u570b\u7acb\u53f0\u7063\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u674e\u5fb7\u8ca1)<\/td>\n<\/tr>\n
\u512a\u7b49 \u9ad8\u58eb\u821c, Constructing Independent Spanning Trees on Star Networks and Bubble-Sort Network, \u53f0\u5317\u5546\u696d\u5927\u5b78\u8cc7\u8a0a\u8207\u6c7a\u7b56\u79d1\u5b78\u7814\u7a76\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u8087\u660e)<\/td>\n<\/tr>\n
\u4f73\u4f5c \u8cf4\u6069\u5b8f, Power-constrained Image Contrast Enhancement through Sparse Representation by Joint Mixed-norm Regularization, \u5143\u667a\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u8c6a )<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

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(\u694a\u660c\u5f6a), Yung-Hsing Peng(\u5f6d\u6c38\u8208), 82, pages2039\u20132062(2020) [Algorithmica] Paired-Domination Problem on Distance-Hereditary Graphs Ching-Chi Lin(\u6797\u6e05\u6c60), Keng-Chu Ku & Chan-Hung Hsu, 82, pages2809\u20132840(2020) [Algorithmica] Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":46,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/51"}],"collection":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/comments?post=51"}],"version-history":[{"count":12,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/51\/revisions"}],"predecessor-version":[{"id":260,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/51\/revisions\/260"}],"up":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/46"}],"wp:attachment":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/media?parent=51"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}