{"id":74,"date":"2017-10-02T11:40:35","date_gmt":"2017-10-02T11:40:35","guid":{"rendered":"http:\/\/140.114.54.13\/test_aact2\/en\/?page_id=74"},"modified":"2021-03-04T19:29:13","modified_gmt":"2021-03-04T11:29:13","slug":"the-best-journal-papers","status":"publish","type":"page","link":"http:\/\/www.aact.org.tw\/en\/index.php\/awards\/the-best-journal-papers\/","title":{"rendered":"The Best Journal Papers"},"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

\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
2017 The Best Journal Papers<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n
[Algorithmica]
\nAn Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree
\nHung-Lung Wang(\u738b\u5f18\u502b), Algorithmica, 77(2), Feb. 2017, pp. 426-439.<\/td>\n<\/tr>\n
[Algorithmica]
\nOn the Impossibility of Cryptography with Tamperable Randomness
\nPer Austrin, Kai-Min Chung(\u9418\u6977\u9594), Mohammad Mahmoody, Rafael Pass, Karn Seth, Algorithmica, 79(4), Dec. 2017, pp. 1052-1101.<\/td>\n<\/tr>\n
[Algorithmica]
\nRandom and Conditional (t, k)-Diagnosis of Hypercubes
\nChia-Chen Wei(\u9b4f\u5609\u6210), Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Algorithmica, 79(3), Nov. 2017, pp. 625-644.<\/td>\n<\/tr>\n
[SIAM Journal on Computing]
\nParallelism and Time in Hierarchical Self-Assembly
\nHo-Lin Chen(\u9673\u548c\u9e9f), David Doty, Algorithmica, SIAM Journal on Computing, 46(2), Feb. 2017, pp. 661-709.<\/td>\n<\/tr>\n
[ACM Transactions on Algorithms]
\nGenerating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation
\nAxel Bacher, Olivier Bodini, Hsien-Kuei Hwang(\u9ec3\u986f\u8cb4), Tsung-Hsi Tsai(\u8521\u5b97\u5e0c), ACM Transactions on Algorithms, 13(2): 24, May 2017.<\/td>\n<\/tr>\n
[ACM Transactions on Algorithms]
\nGenerating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation
\nHsien-Kuei Hwang(\u9ec3\u986f\u8cb4), Svante Janson, Tsung-Hsi Tsai(\u8521\u5b97\u5e0c), ACM Transactions on Algorithms, 13(4): 47, Dec. 2017.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nA lower bound for metric 1-median selection
\nChing-Lueh Chang(\u5f35\u7d93\u7565), Journal of Computer and System Sciences, Vol.84, Mar. 2017, pp. 44-51.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nSomewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption
\nKaibin Huang, Raylin Tso(\u5de6\u745e\u9e9f), Yu-Chi Chen(\u9673\u6631\u573b), Journal of Computer and System Sciences, Vol.89, Nov. 2017, pp. 400-409.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nCDPS: A cryptographic data publishing system
\nTong Li, Zheli Liu, Jin Li, Chunfu Jia, Kuan-Ching Li(\u674e\u51a0\u61ac), Journal of Computer and System Sciences, Vol.89, Nov. 2017, pp. 80-91.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nDriver behaviour detection and vehicle rating using multi-UAV coordinated vehicular networks
\nVishal Sharma, Hsing-Chung Chen(\u9673\u8208\u5fe0), Rajesh Kumar, Journal of Computer and System Sciences, Vol.86, Jun. 2017, pp. 3-32.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2016 The Best Journal Papers<\/strong><\/h5>\n\n\n\n\n\n\n\n\n
[SIAM Journal on Computing]
\nNon-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
\nKai-Min Chung(\u9418\u6977\u9594), Rafael Pass, and Karn Seth, SIAM J. Comput., 45(2), pp. 415-458.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nEdge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
\nChia-Wen Cheng(\u912d\u5609\u6587), Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), 82(5), JCSS, Aug. 2016, pp. 767-781.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nEfficient algorithms for the round-trip 1-center and 1-median problems
\nBiing-Feng Wang(\u738b\u70b3\u8c50), Jhih-Hong Ye(\u8449\u5fd7\u9d3b), Pei-Jung Chen(\u9673\u6c9b\u84c9), 82(5), JCSS, Aug. 2016, pp. 782-792.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nCollaboration reputation for trustworthy Web service selection in social networks
\nShangguang Wang, Lin Huang, Ching-Hsien Hsu(\u8a31\u6176\u8ce2), Fangchun Yang, 82(1), Part B, JCSS, Feb. 2016, pp. 130-143.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nEvaluating rail transit timetable using big passengers’ data
\nZhibin Jiang, Ching-Hsien Hsu(\u8a31\u6176\u8ce2), Daqiang Zhang, Xiaolei Zou, 82(1), Part B, JCSS, Feb. 2016, pp. 144\u2013155.<\/td>\n<\/tr>\n
[Information and Computation]
\nConditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks
\nSun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Chia-Wei Lee(\u674e\u4f73\u885b), Chien-Hsiang Huang(\u9ec3\u5efa\u7fd4), Vol.251, Inform. & Comput., Dec. 2016, pp. 314-334.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2015 The Best Journal Papers<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n
[Algorithmica]
\nGeometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching
\nYu-Feng Chien (\u7c21\u88d5\u5cf0), Wing-Kai Hon (\u97d3\u6c38\u6977), Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter, Algorithmica 71(2), 258-278, 2015.<\/td>\n<\/tr>\n
[Algorithmica]
\nThe k-Nearest-Neighbor Voronoi Diagram Revisited
\nChih-Hung Liu (\u5289\u667a\u5f18), Evanthia Papadopoulou, Der-Tsai Lee (\u674e\u5fb7\u8ca1), Algorithmica 71(2), 429-449, 2015.<\/td>\n<\/tr>\n
[Algorithmica]
\nLinear-Time Algorithms for Tree Root Problems
\nMaw-Shang Chang (\u5f35\u8cbf\u7fd4), Ming-Tat Ko (\u9ad8\u660e\u9054), Hsueh-I Lu (\u5442\u5b78\u4e00), Algorithmica 71(2), 471-495, 2015.<\/td>\n<\/tr>\n
[Algorithmica]
\nCapacitated Domination: Problem Complexity and Approximation Algorithms
\nMong-Jen Kao (\u9ad8\u5b5f\u99ff), Han-Lin Chen (\u9673\u7ff0\u9716), Der-Tsai Lee (\u674e\u5fb7\u8ca1), Algorithmica 72(1), 1-43, 2015.<\/td>\n<\/tr>\n
[Algorithmica]
\nResequencing a Set of Strings Based on a Target String
\nChih-En Kuo (\u90ed\u81f3\u6069), Yue-Li Wang (\u738b\u6709\u79ae), Jia-Jie Liu (\u5289\u5609\u5091), Ming-Tat Ko (\u9ad8\u660e\u9054), Algorithmica 72(2), 430-449, 2015.<\/td>\n<\/tr>\n
[Algorithmica]
\nParameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions
\nBang Ye Wu (\u5433\u90a6\u4e00), Li-Hsuan Chen (\u9673\u7acb\u8ed2), Algorithmica 72(3), 818-835, 2015.<\/td>\n<\/tr>\n
[Algorithmica]
\nProgram Size and Temperature in Self-Assembly
\nHo-Lin Chen (\u9673\u548c\u9e9f), David Doty, Shinnosuke Seki, Algorithmica 72(3), 884-899, 2015.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nDynamic grey platform for efficient forecasting management
\nChen-Fang Tsai (\u8521\u632f\u82b3) JCSS 81(6), 966-980, 2015.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nMalware behavioural detection and vaccine development by using a support vector model classifier
\nPing Wang (\u738b\u5e73), Yu-Shih Wan (\u738b\u5b87\u6cbb), Journal of Computer and System Sciences 81(6), 1012-1026, 2015.<\/td>\n<\/tr>\n
[Journal of Computer and System Sciences]
\nOn the minmax regret path median problem on trees
\nJhih-Hong Ye (\u8449\u5fd7\u9d3b), Biing-Feng Wang (\u738b\u70b3\u8c50), Journal of Computer and System Sciences 81(7), 1159-1170, 2015.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2014 The Best Journal Papers<\/strong><\/h5>\n\n\n\n\n
[SIAM Journal on Computing]
\nLinear-time compression of bounded-genus graphs into information-theoretically optimal number of bits
\nHsueh-I Lu, SIAM J. Comput. 43(2), 477\u2013496, 2014.<\/td>\n<\/tr>\n
[Information and Computation]
\nFinding the gapped longest common subsequence by incremental suffix maximum queries
\nYung-Hsing Peng, Chang-Biau Yang, Information and Computation 237, 95\u2013100, 2014.<\/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":68,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/74"}],"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=74"}],"version-history":[{"count":7,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/74\/revisions"}],"predecessor-version":[{"id":264,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/74\/revisions\/264"}],"up":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/68"}],"wp:attachment":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/media?parent=74"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}