{"id":142,"date":"2017-09-27T07:53:50","date_gmt":"2017-09-27T07:53:50","guid":{"rendered":"http:\/\/140.114.54.13\/test_aact2\/?page_id=142"},"modified":"2026-04-15T20:32:09","modified_gmt":"2026-04-15T12:32:09","slug":"best_paper","status":"publish","type":"page","link":"http:\/\/www.aact.org.tw\/index.php\/awards\/best_paper\/","title":{"rendered":"\u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e"},"content":{"rendered":"\n
2025 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Information and Computation]<\/strong>
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90) and Ralf Klasing, The g-good-neighbor diagnosability of product networks under the PMC model (DOI: 10.1016\/j.ic.2025.105341)<\/td><\/tr>
[Information and Computation]<\/strong>
En-An Song(\u5b8b\u6069\u5b89), Chang-Biau Yang(\u694a\u660c\u5f6a) and Kuo-Tsung Tseng(\u66fe\u570b\u5c0a), The generalized constrained longest common subsequence in the run-length encoded format (DOI: 10.1016\/j.ic.2025.105311)<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2024 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Algorithmica]<\/strong>
Sheng-Yen Ko(\u67ef\u8056\u5f65), Ho-Lin Chen(\u9673\u548c\u9e9f), Siu-Wing Cheng, Wing-Kai Hon(\u97d3\u6c38\u6977) and Chung-Shou Liao(\u5ed6\u5d07\u78a9), Polynomial-time Combinatorial Algorithm for General Max\u2013Min Fair Allocation (DOI: 10.1007\/s00453-023-01105-3)<\/td><\/tr>
[Algorithmica]<\/strong>
Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Hoang-Oanh Le, Van Bang Le and Sheng-Lung Peng(\u5f6d\u52dd\u9f8d), On the d-Claw Vertex Deletion Problem (DOI: 10.1007\/s00453-023-01144-w)<\/td><\/tr>
[Information and Computation]<\/strong>
Yung-Chung Chiu(\u90b1\u5141\u4e2d) and Hsueh-I Lu(\u5442\u5b78\u4e00), Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths (DOI: 10.1016\/j.ic.2024.105227 )<\/td><\/tr>
[Journal of Computer and System Science]<\/strong>
Chenxu Yang, Gang Yang, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Yaping Mao and Ralf Klasing, Monitoring the edges of a graph using distances with given girth (DOI: 10.1016\/j.jcss.2024.103528)<\/td><\/tr>
[Journal of Computer and System Science]<\/strong>
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Ralf Klasing and Yuzhi Xiao, The g-extra connectivity of graph products (DOI: 10.1016\/j.jcss.2024.103552)<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2023 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Journal of ACM]
Rate-independent Computation in Continuous Chemical Reaction Networks
Ho-Lin Chen (\u9673\u548c\u9e9f), David Doty, Wyatt Reeves, David Soloveichik, 70(3): Article No. 22, pp 1\u201361 (2023)<\/td><\/tr>
[Journal of ACM]
On the Need for Large Quantum Depth
Nai-Hui Chia, Kai-Min Chung (\u9418\u6977\u9594), Ching-Yi Lai (\u8cf4\u6e05\u6c82), 70(1): Article No. 6, pp 1\u201338 (2023)<\/td><\/tr>
[Journal of Computer and System Science]
Improved IP lookup technology for trie-based data structures
Yen-Heng Lin (\u6797\u5f65\u4ea8), Sun-Yuan Hsieh (\u8b1d\u5b6b\u6e90), 133: 41-55 (2023)<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2020 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[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)<\/td><\/tr>
[Algorithmica]
Paired-Domination Problem on Distance-Hereditary Graphs
Ching-Chi Lin(\u6797\u6e05\u6c60), Keng-Chu Ku & Chan-Hung Hsu, 82, pages2809\u20132840(2020)<\/td><\/tr>
[Algorithmica]
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization
Fu-Hong Liu(\u5289\u5bcc\u7fc3), Hsiang-Hsuan Liu & Prudence W. H. Wong, 82, pages 3415\u20133457(2020)<\/td><\/tr>
[Algorithmica]
Approximating the Canadian Traveller Problem with Online Randomization,
Erik D. Demaine, Yamming Huang, Chung-Shou Liao(\u5ed6\u5d07\u78a9) & Kunihiko Sadakane, Published online, DOI:10.1007\/s00453-020-00792-6 (2020).<\/td><\/tr>
[Journal of Computer and System Sciences]
Vulnerability of super extra edge-connected graphs
Chia-Wen Cheng, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Ralf Klasing, 108: 1~9, (2020)<\/td><\/tr>
[Journal of Computer and System Sciences]
Multilevel length-based classified index table for IP lookups and updates
Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Sin-Jie Huang, Tai-Hsuan Ho, 112, Pages 66-84(2020)<\/td><\/tr>
[Journal of Computer and System Sciences]
An improved algorithm for the minmax regret path center problem on trees
Biing-Feng Wang(\u738b\u70b3\u8c50), Jhih-Hong Ye, Chih-Yu Li, 114, Pages 36-47 (2020)<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2019 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Algorithmica]
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities
Mong-Jen Kao(\u9ad8\u5b5f\u99ff), Hai-Lun Tu, D. T. Lee(\u674e\u5fb7\u8ca1), 81(5), Algorithmica, 2019, pp. 1800-1817.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2018 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Algorithmica]
Dictionary Matching with a Bounded Gap in Pattern or in Text
Wing-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><\/tr>
[Journal of Computer and System Sciences]
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
Li-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><\/tr>
[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(\u8b1d\u5b6b\u6e90), Li Xu, Shuming Zhou, Riqing Chen, 95 (1), JCSS, 2018, pp. 1-18.<\/td><\/tr>
[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(\u738b\u70b3\u8c50), 97(7 ), JCSS, 2018, pp. 94-105.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2017 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Algorithmica]
An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree
Hung-Lung Wang(\u738b\u5f18\u502b), Algorithmica, 77(2), Feb. 2017, pp. 426-439.<\/td><\/tr>
[Algorithmica]
On the Impossibility of Cryptography with Tamperable Randomness
Per Austrin, Kai-Min Chung(\u9418\u6977\u9594), Mohammad Mahmoody, Rafael Pass, Karn Seth, Algorithmica, 79(4), Dec. 2017, pp. 1052-1101.<\/td><\/tr>
[Algorithmica]
Random and Conditional (t, k)-Diagnosis of Hypercubes
Chia-Chen Wei(\u9b4f\u5609\u6210), Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), Algorithmica, 79(3), Nov. 2017, pp. 625-644.<\/td><\/tr>
[SIAM Journal on Computing]
Parallelism and Time in Hierarchical Self-Assembly
Ho-Lin Chen(\u9673\u548c\u9e9f), David Doty, Algorithmica, SIAM Journal on Computing, 46(2), Feb. 2017, pp. 661-709.<\/td><\/tr>
[ACM Transactions on Algorithms]
Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation
Axel 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><\/tr>
[ACM Transactions on Algorithms]
Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation
Hsien-Kuei Hwang(\u9ec3\u986f\u8cb4), Svante Janson, Tsung-Hsi Tsai(\u8521\u5b97\u5e0c), ACM Transactions on Algorithms, 13(4): 47, Dec. 2017.<\/td><\/tr>
[Journal of Computer and System Sciences]
A lower bound for metric 1-median selection
Ching-Lueh Chang(\u5f35\u7d93\u7565), Journal of Computer and System Sciences, Vol.84, Mar. 2017, pp. 44-51.<\/td><\/tr>
[Journal of Computer and System Sciences]
Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption
Kaibin 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><\/tr>
[Journal of Computer and System Sciences]
CDPS: A cryptographic data publishing system
Tong 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><\/tr>
[Journal of Computer and System Sciences]
Driver behaviour detection and vehicle rating using multi-UAV coordinated vehicular networks
Vishal Sharma, Hsing-Chung Chen(\u9673\u8208\u5fe0), Rajesh Kumar, Journal of Computer and System Sciences, Vol.86, Jun. 2017, pp. 3-32.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2016 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[SIAM Journal on Computing]
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
Kai-Min Chung(\u9418\u6977\u9594), Rafael Pass, and Karn Seth, SIAM J. Comput., 45(2), pp. 415-458.<\/td><\/tr>
[Journal of Computer and System Sciences]
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
Chia-Wen Cheng(\u912d\u5609\u6587), Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90), 82(5), JCSS, Aug. 2016, pp. 767-781.<\/td><\/tr>
[Journal of Computer and System Sciences]
Efficient algorithms for the round-trip 1-center and 1-median problems
Biing-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><\/tr>
[Journal of Computer and System Sciences]
Collaboration reputation for trustworthy Web service selection in social networks
Shangguang Wang, Lin Huang, Ching-Hsien Hsu(\u8a31\u6176\u8ce2), Fangchun Yang, 82(1), Part B, JCSS, Feb. 2016, pp. 130-143.<\/td><\/tr>
[Journal of Computer and System Sciences]
Evaluating rail transit timetable using big passengers’ data
Zhibin Jiang, Ching-Hsien Hsu(\u8a31\u6176\u8ce2), Daqiang Zhang, Xiaolei Zou, 82(1), Part B, JCSS, Feb. 2016, pp. 144\u2013155.<\/td><\/tr>
[Information and Computation]
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks
Sun-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><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2015 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Algorithmica]
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching
Yu-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><\/tr>
[Algorithmica]
The k-Nearest-Neighbor Voronoi Diagram Revisited
Chih-Hung Liu (\u5289\u667a\u5f18), Evanthia Papadopoulou, Der-Tsai Lee (\u674e\u5fb7\u8ca1), Algorithmica 71(2), 429-449, 2015.<\/td><\/tr>
[Algorithmica]
Linear-Time Algorithms for Tree Root Problems
Maw-Shang Chang (\u5f35\u8cbf\u7fd4), Ming-Tat Ko (\u9ad8\u660e\u9054), Hsueh-I Lu (\u5442\u5b78\u4e00), Algorithmica 71(2), 471-495, 2015.<\/td><\/tr>
[Algorithmica]
Capacitated Domination: Problem Complexity and Approximation Algorithms
Mong-Jen Kao (\u9ad8\u5b5f\u99ff), Han-Lin Chen (\u9673\u7ff0\u9716), Der-Tsai Lee (\u674e\u5fb7\u8ca1), Algorithmica 72(1), 1-43, 2015.<\/td><\/tr>
[Algorithmica]
Resequencing a Set of Strings Based on a Target String
Chih-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><\/tr>
[Algorithmica]
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions
Bang Ye Wu (\u5433\u90a6\u4e00), Li-Hsuan Chen (\u9673\u7acb\u8ed2), Algorithmica 72(3), 818-835, 2015.<\/td><\/tr>
[Algorithmica]
Program Size and Temperature in Self-Assembly
Ho-Lin Chen (\u9673\u548c\u9e9f), David Doty, Shinnosuke Seki, Algorithmica 72(3), 884-899, 2015.<\/td><\/tr>
[Journal of Computer and System Sciences]
Dynamic grey platform for efficient forecasting management
Chen-Fang Tsai (\u8521\u632f\u82b3) JCSS 81(6), 966-980, 2015.<\/td><\/tr>
[Journal of Computer and System Sciences]
Malware behavioural detection and vaccine development by using a support vector model classifier
Ping Wang (\u738b\u5e73), Yu-Shih Wan (\u738b\u5b87\u6cbb), Journal of Computer and System Sciences 81(6), 1012-1026, 2015.<\/td><\/tr>
[Journal of Computer and System Sciences]
On the minmax regret path median problem on trees
Jhih-Hong Ye (\u8449\u5fd7\u9d3b), Biing-Feng Wang (\u738b\u70b3\u8c50), Journal of Computer and System Sciences 81(7), 1159-1170, 2015.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
2014 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[SIAM Journal on Computing]
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits
Hsueh-I Lu, SIAM J. Comput. 43(2), 477\u2013496, 2014.<\/td><\/tr>
[Information and Computation]
Finding the gapped longest common subsequence by incremental suffix maximum queries
Yung-Hsing Peng, Chang-Biau Yang, Information and Computation 237, 95\u2013100, 2014.<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"

2025 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e [Information and Computation]Zhao Wang, Yaping Mao, Sun-Yuan Hsieh(\u8b1d\u5b6b\u6e90) and Ralf Klasing, The g-good-neighbor diagnosability of product networks under the PMC model (DOI: 10.1016\/j.ic.2025.105341) [Information and Computation]En-An Song(\u5b8b\u6069\u5b89), Chang-Biau Yang(\u694a\u660c\u5f6a) and Kuo-Tsung Tseng(\u66fe\u570b\u5c0a), The generalized constrained longest common subsequence in the run-length encoded format (DOI: 10.1016\/j.ic.2025.105311) 2024 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e [Algorithmica]Sheng-Yen Ko(\u67ef\u8056\u5f65), Ho-Lin Chen(\u9673\u548c\u9e9f), Siu-Wing Cheng, […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":25,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/142"}],"collection":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/comments?post=142"}],"version-history":[{"count":26,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/142\/revisions"}],"predecessor-version":[{"id":1790,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/142\/revisions\/1790"}],"up":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/25"}],"wp:attachment":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/media?parent=142"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}