{"id":121,"date":"2017-09-27T06:58:58","date_gmt":"2017-09-27T06:58:58","guid":{"rendered":"http:\/\/140.114.54.13\/test_aact2\/?page_id=121"},"modified":"2026-04-15T20:29:01","modified_gmt":"2026-04-15T12:29:01","slug":"news_awards","status":"publish","type":"page","link":"http:\/\/www.aact.org.tw\/index.php\/news\/news_awards\/","title":{"rendered":"\u5f97\u734e\u8a0a\u606f"},"content":{"rendered":"
2025 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
[Information and Computation]<\/strong>
\nZhao 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)<\/p>\n

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>\n<\/tr>\n<\/tbody>\n<\/table>\n

2025\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
[\u91d1\u734e]<\/strong><\/p>\n

\u9673\u6631\u5b8f \u4e09\u5c64\u96fb\u8def\u4e0b\u754c\u4e4b\u7814\u7a76\uff1a\u4ee5\u591a\u6578\u6c7a\u51fd\u6578\u70ba\u4f8b \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u6578\u64da\u79d1\u5b78\u8207\u2f2f\u7a0b\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u8521\u932b\u921e\u6559\u6388)<\/p>\n

[\u9280\u734e]<\/strong><\/p>\n

\u9673\u5f65\u5b87 \u6578\u503c\u8cc7\u6599\u58d3\u7e2e\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/p>\n

[\u9285\u734e]<\/strong><\/p>\n

\u5468\u667a\u6db5 \u5e36\u6709\u65b9\u5411\u6027\u7d04\u675f\u7684GPS \u8ecc\u8de1\u7684\u6700\u4f73\u6295\u5f71 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/p>\n

[\u4f73\u4f5c]<\/strong><\/p>\n

\u5ed6\u5c55\u9038 \u57fa\u65bc\u689d\u4ef6\u9ad8\u65af\u7db2\u8def\u5206\u985e\u5668\u7684\u7d50\u69cb\u611f\u77e5\u7a69\u5065\u53cd\u4e8b\u5be6\u89e3\u91cb \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89\u6559\u6388\u3001\u4fde\u5728\u5143\u6559\u6388)<\/p>\n

\u694a\u777f\u8b19 \u8d85\u7d1a\u652f\u914d\u96c6\u5408\u554f\u984c\u4e4b\u7814\u7a76 \u81fa\u5317\u5e02\u7acb\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u5f65\u5b8f\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2024 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n\n\n
[Algorithmica]<\/strong>
\nSheng-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)<\/p>\n

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>\n<\/tr>\n

[Information and Computation]<\/strong>
\nYung-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>\n<\/tr>\n
[Journal of Computer and System Science]<\/strong>
\nChenxu 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)<\/p>\n

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>\n<\/tr>\n<\/tbody>\n<\/table>\n

2024\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
[\u91d1\u734e]<\/strong><\/p>\n

\u674e\u6021\u8431 \u8868\u9762\u5316\u5b78\u53cd\u61c9\u7db2\u8def\u7684\u6a21\u64ec\u80fd\u529b \u570b\u7acb\u81fa\u7063\u5927\u5b78\u96fb\u6a5f\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u548c\u9e9f\u6559\u6388)<\/p>\n

[\u9280\u734e]<\/strong><\/p>\n

\u9673\u51a0\u660a \u5728\u647a\u758a\u5f0f\u8d85\u7acb\u65b9\u9ad4\u4e2d\u5efa\u69cb\u4e09\u68f5\u5b8c\u5168\u7368\u7acb\u751f\u6210\u6a39 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/p>\n

[\u9285\u734e]<\/strong><\/p>\n

\u5ed6\u739f\u96ef \u8fd1\u4e4e\u4fdd\u5e8f\u5339\u914d\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/p>\n

[\u4f73\u4f5c]<\/strong><\/p>\n

\u8a31\u73ee\u8431 \u591a\u6a5f\u5668\u4eba\u5728\u6a39\u7d50\u69cb\u4e0a\u6700\u5c0f\u5316\u6700\u5927\u5ef6\u9072\u5de1\u908f\u8abf\u5ea6 \u570b\u7acb\u4e2d\u592e\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u6667\u742e\u6559\u6388)<\/p>\n

\u738b\u5ee3\u548c \u7d50\u5408\u9810\u6e2c\u4e4b\u7dda\u4e0a\u6d88\u9632\u54e1\u554f\u984c\u65bc\u6a39\u72c0\u7d50\u69cb \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89\u6559\u6388\u3001\u5289\u5411\u7444\u6559\u6388)<\/p>\n

\u7a0b\u81f3\u69ae \u89e3\u78bcPC1\u7684\u529b\u91cf\uff1a\u4e00\u7a2e\u5feb\u901f\u6e96\u78ba\u4e26\u57fa\u65bc\u5171\u8b8a\u7570\u7684Hi-C\u8cc7\u6599A_B\u67d3\u8272\u9ad4\u5340\u5ba4\u8fa8\u5225\u65b9\u6cd5 \u570b\u7acb\u653f\u6cbb\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u5bb6\u9298\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2023 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n\n\n
[Journal of ACM]
\nRate-independent Computation in Continuous Chemical Reaction Networks
\nHo-Lin Chen (\u9673\u548c\u9e9f), David Doty, Wyatt Reeves, David Soloveichik, 70(3): Article No. 22, pp 1\u201361 (2023)<\/td>\n<\/tr>\n
[Journal of ACM]
\nOn the Need for Large Quantum Depth
\nNai-Hui Chia, Kai-Min Chung (\u9418\u6977\u9594), Ching-Yi Lai (\u8cf4\u6e05\u6c82), 70(1): Article No. 6, pp 1\u201338 (2023)<\/td>\n<\/tr>\n
[Journal of Computer and System Science]
\nImproved IP lookup technology for trie-based data structures
\nYen-Heng Lin (\u6797\u5f65\u4ea8), Sun-Yuan Hsieh (\u8b1d\u5b6b\u6e90), 133: 41-55 (2023)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2023\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
\u76e4\u7fbd\u5022 \u57fa\u65bc\u5f37\u512a\u52e2\u7b56\u7565\u5f71\u97ff\u50b3\u64ad\u7684\u6df7\u5408\u7dda\u6027\u95a5\u503c SIS \u6a21\u578b \u570b\u7acb\u81fa\u5317\u5546\u696d\u5927\u5b78\u8cc7\u8a0a\u8207\u6c7a\u7b56\u79d1\u5b78\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u8087\u660e\u6559\u6388)<\/p>\n

\u8521\u5b5f\u4fee \u5728\u2206\u03b2\u5ea6\u91cf\u5716\u4e0a\u661f\u72c0p-\u4e2d\u7e7c\u7ad9\u5b9a\u4f4d\u554f\u984c\u7684\u6539\u826f\u8fd1\u4f3c\u6f14\u7b97\u6cd5\u5206\u6790 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388\u3001\u6d2a\u7dbe\u73e0\u6559\u6388)<\/p>\n

\u5442\u5b97\u9716 \u6700\u9577\u5171\u540c\u8fd1\u4e4e\u6ce2\u52d5\u5b50\u5e8f\u5217\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/p>\n

\u9673\u51a0\u5ef7 \u6700\u591a\u8207\u6700\u9577\u905e\u589e\u5340\u9593\u5b50\u5e8f\u5217\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2021\u6700\u4f73\u535a\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
\u512a\u7b49\uff0c\u9ec3\u7686\u5bcc \uff0c\u5728\u4ea4\u66ff\u7fa4\u7d44\u7db2\u8def\u8207(n,k)-\u661f\u5716\u4e0a\u4ee5\u905e\u8ff4\u8207\u5e73\u884c\u65b9\u6cd5\u5efa\u69cb\u7368\u7acb\u751f\u6210\u6a39\uff0c\u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb<\/p>\n

(\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2021\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
\u4f73\u4f5c \u9ec3\u97cb\u9716 \u6709\u95dc\u7279\u5b9a\u5716\u7684(\u8d85)\u5f37\u5f69\u8679\u9023\u901a\u6578\u63a2\u8a0e \u570b\u7acb\u5609\u7fa9\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb(\u6307\u5c0e\u6559\u6388\uff1a\u8cf4\u6cf3\u4f36\u6559\u6388)<\/p>\n

\u4f73\u4f5c \u59da\u51f1\u52db Constructing Independent Spanning Trees on Generalized Recursive Circulant Graph \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb(\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/p>\n

\u4f73\u4f5c \u4f55\u5efa\u6587 \u7279\u5b9a\u51f1\u840a\u5716\u7684\u5f69\u8679\u8457\u8272 \u570b\u7acb\u5609\u7fa9\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb(\u6307\u5c0e\u6559\u6388\uff1a\u8cf4\u6cf3\u4f36\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2020 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/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
2020 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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

2019 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/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 \u6700\u4f73\u671f\u520a\u8ad6\u6587\u734e<\/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
2018 & 2019 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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":"

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) 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) 2025\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c [\u91d1\u734e] \u9673\u6631\u5b8f \u4e09\u5c64\u96fb\u8def\u4e0b\u754c\u4e4b\u7814\u7a76\uff1a\u4ee5\u591a\u6578\u6c7a\u51fd\u6578\u70ba\u4f8b \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u6578\u64da\u79d1\u5b78\u8207\u2f2f\u7a0b\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u8521\u932b\u921e\u6559\u6388) [\u9280\u734e] \u9673\u5f65\u5b87 \u6578\u503c\u8cc7\u6599\u58d3\u7e2e\u554f\u984c […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":8,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/121"}],"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=121"}],"version-history":[{"count":53,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/121\/revisions"}],"predecessor-version":[{"id":1787,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/121\/revisions\/1787"}],"up":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/8"}],"wp:attachment":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/media?parent=121"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}