| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 2000 | A Faster Implementation of a Parallel Tree Contraction Scheme and Its Applications on Distance-Hereditary Graphs | Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Chen, Gen-Huey | Journal of Algorithms 35, 50-81 | | | |
| 1998 | A Linear-time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree | Peng, S. L.; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Tang, Chuan-Yi | | | | |
| 2001 | A Logical Model for Privacy | Hsu, Tsan-Sheng; Liau, Churn-Jung; Wang, Da-Wai | | | | |
| 2012 | A simple efficient technique to adjust the time step size in a stochastic discrete agent-based simulation | Kuo, Chia-Tung; Wang, Da-Wei; Hsu, Tsan-sheng | | | | |
| 1998 | A Simple Parallel Tree Contraction Scheme and Its Applications on Distance-Hereditary Graphs(preliminary version) | Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Chen, Gen-Huey | | | | |
| 2006 | Attribute-oriented Granulation for Privacy Protection | Wang, Da-Wei; Liau, Churn-Jung; Hsu, Tsan-sheng | | | | |
| 2006 | Bounds on the Client-Server Incremental Computing | Lin, Cho-chin; Wang, Da-Wei; Hsu, Tsan-sheng | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A | | | |
| 2004 | Bounds on the Client-Server Incremental Computing | Lin, Cho-Chin; Hsu, Tsan-Sheng; Wang, Da-Wei | | | | |
| 1998 | Characterization of Efficiently Computable Problems on Distance-Hereditary Graphs | Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Chen, Gen-Huey | | | | |
| 2002 | Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs | Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat | SIAM Journal on Discrete Mathematics 15, 488–518 | | | |
| 1998 | Edge and Node Searching Problems on Trees | Peng, Sheng-Lung; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat; Tang, Chuan Yi | TR-IIS-98-015 | | | |
| 2002 | Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs | Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-sheng | | | | |
| 1999 | Efficient Parallel Algorithms on Distance-Hereditary Graphs | Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Chen, Gen-Huey | Parallel Processing Letters 9, 43-52 | | | |
| 1997 | Efficient Parallel Algorithms on Distance-Hereditary Graphs(preliminary version) | Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Chen, Gen-Huey | | | | |
| 1997 | Graph Searching on Chordal Graphs | Peng, Sheng-Lung; Ko, Ming-Tat; Ho, Chin-Wen; Hsu, Tsan-Sheng; Tang, Chuan-Yi | TR-IIS-97-003 | | | |
| 2000 | Graph Searching on Some Subclasses of Chordal Graphs | Peng, Sheng-Lung; Ko, Ming-Tat; Ho, Chin-Wen; Hsu, Tsan-sheng; Tang, Chuan-Yi | Algorithmica 27, 395-426 | | | |
| 1996 | Graph Searching on Subclasses of Chordal Graphs(preliminary version) | Peng, Sheng-Lung; Ko, Ming-Tat; Ho, Chin-Wen; Hsu, Tsan-sheng; Tang, Chuan-Yi | | | | |
| 2006 | Information Theoretical Analysis of Two-Party Secret Computation | Wang, Da-Wei; Liau, Churn-Jung; Chiang, Yi-Ting; Hsu, Tsan-sheng | | | | |
| 2000 | Node and Edge Searching Problems on Trees | Peng, S. L.; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Tang, Chuan-Yi | Theoretic Computer Science 240, 429-446 | | | |
| 1997 | Node and Edge Searching Problems on Trees(preliminary version) | Peng, S. L.; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Tang, Chuan-Yi | | | | |
