| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 1988 | An O(Min[M.N,N2Loglogn]) Maximum Weight Clique Algorithm for Circular-Arc Graphs | Shih, Wei-Kuan; Hsu, Wen-Lian | TR-88-015 | | | |
| 1980 | An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Engineering Optimization 4, 179-192 | | | |
| 1981 | An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Networks 11, 23-29 | | | |
| 1997 | An O(N Log N) R-B Curve Drawing Algorithm for the Admission Control of Vbr Video Transmission | Ko, Ming-Tat; Ho, Jan-Ming; Chen, Meng Chang; Chang, Ray-I | TR-IIS-97-018 | | | |
| 1989 | An O(n1.5) algorithm for coloring proper circular-arc graphs | Shih, W. K.; Hsu, W. L. | Discrete Applied Mathematics 25, 321-323 | | | |
| 1989 | An O(nlogn mloglogn) algorithm for finding a maximum weight clique in circular-arc graphs | Shih, W. K.; Hsu, W. L. | Infor. Process. Letters , 129-134 | | | |
| 1996 | An Object Transaction Service in Corba | Liang, Deron; Kao, Y. M.; Yuan, S. M. | TR-IIS-96-005 | | | |
| 2001 | An oblivious and robust watermarking scheme using communications-with-side-information mechanism | Lu, C. -S; Liao, H. -Y. Mark | | | | |
| 2001 | An Oblivious and Robust Watermarking Scheme Using Communications-with-Side-Information Mechanism | Lu, Chun-Shien; Liao, Hong-Yuan Mark | | | | |
| 1981 | An On-Chip Compare/Steer Bubble Sorter | Lee, D. T. ; Chang, H.; Wong, C. K. | IEEE Trans. Comput. 30, 396-405 | | | |
| 2008 | An Online Boosted People Counting System for Electronic Advertising Machines | Duan-Yu Chen; Chih-Wen Su; Yi-Chong Zeng; Shih-Wei Sun; Wei-Ru Lai; Hong-Yuan Mark Liao | TR-IIS-08-009 | | | |
| 2009 | An Online Boosted People Counting System for Electronic Advertising Machines | Chen, D. -Y.; Su, C. -W.; Zeng, Y. -C.; Sun, S. -W; Lai, W. -R.; Liao, H. -Y. Mark | | | | |
| 2017 | An Open Framework for Participatory PM2.5 Monitoring in Smart Cities | Ling-Jyh Chen ; Yao-Hua Ho; Hu-Cheng Lee; Hsuan-Cho Wu; Hao-Min Liu; Hsin-Hung Hsieh; Yu-Te Huang; Shih-Chun Candice Lung | IEEE Access 5, 14441-14454 | | | |
| 1986 | An Optimal Adaptive Routing Algorithm | Chang, F.; Wu, L. | IEEE Transactions on Automatic Control AC-31 | | | |
| 1979 | An Optimal Algorithm for Finding the Kernel of a polygon | Lee, D. T. ; Preparata, F. P. | J. ACM 26, 415-421 | | | |
| 2004 | An Optimal Algorithm for Maximum-Density Segment Problem | Kai-Min Chung; Hsueh-I Lu | SIAM Journal on Computing 34(2), 373-387 | | | |
| 2003 | An Optimal Algorithm for Maximum-Density Segment Problem | Kai-Min Chung; Hsueh-I Lu | | | | |
| 1995 | An Optimal Algorithm for Roundness Determination on Convex Polygons | Swanson, K.; Lee, D. T. ; Wu, V. L. | Computational Geometry: Theory and Applications 5, 225-235 | | | |
| 1995 | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-arc Graphs with Applications | Atallah, M. J.; Chen, D. Z.; Lee, D. T. | Algorithmica 14, 429-441 | | | |
| 1992 | An Optimal Algorithm for the Maximum Two-Chain Problem | Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. | SIAM J. Discrete Algorithms 5, 285-304 | | | |
