Chinese
English
Research Fellow  |  Hsu, Tsan-sheng  
 
contact
vita
education
experience
interests
descriptions
activities
invited_talk
honors
publications
 
 
 
 
 
Publications
 
Journal Articles
 
1. I-C. Wang, C.-H. Shen, T.-s. Hsu, C.J. Liau, D.W. Wang, and J. Zhan, "Towards empirical aspects of secure scalar product," IEEE Transactions on Systems, Man, and Cybernetics Part C: Applications and Reviews, volume 39, pages 440-447, July 2009.
2. Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih and Tsan-sheng Hsu, "Smallest Bipartite Bridge-connectivity Augmentation," Algorithmica, volume 54, pages 353--378, 2009.
3. Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "An Epistemic Framework for Privacy Protection in Database Linking," Data and Knowledge Engineering, volume 61, number 1, pages 176-205, April 2007.
4. D.W. Wang, C.J. Liau, and T.-s. Hsu, "An epistemic framework for privacy protection in database linking," Data and Knowledge Engineering, volume 61, pages 176-205, 2007. :::icon
5. D.W. Wang, C.J. Liau, and T.-s. Hsu, "Granulation as a privacy protection mechanism," Transactions on Rough Sets, volume VII, pages 256-273, 2007, LNCS 4400 :::icon
6. Cho-chin Lin, Da-Wei Wang and Tsan-sheng Hsu, "Bounds on the Client-Server Incremental Computing," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, volume E89-A, number 5, pages 1198-1206, May 2006.
7. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, and Ming-Tat Ko, "The Hamiltonian Problem on Distance-Hereditary Graphs," Discrete Applied Mathematics, volume 154, number 3, pages 508--524, 2006. :::icon
8. D.W. Wang, C.J. Liau, T.-s. Hsu, and J.K.-P. Chen, "Value and damage of information: A data security perspective," International Journal of Approximate Reasoning, volume 43, pages 179--201, 2006. :::icon
9. Tsan-sheng Hsu and Ming-Yang Kao, "Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time," SIAM Journal on Discrete Mathematics, volume 19, number 2, pages 345--362, January 2005.
10. T.-s. Hsu, K.-H. Tsai, D.-W. Wang, and D. T. Lee, "Two variations of the minimum," Journal of Combinatorial Optimization, volume 9, pages 101--120, 2005.
11. D.-W. Wang, C.-J. Liau, and T.-s. Hsu, "Medical privacy protection based on granular computing," Artificial Intelligence in Medicine, volume 32, number 2, pages 137-149, 2004.
12. D.W. Wang, C.J. Liau, and T.-s. Hsu, "Medical privacy protection based on granular computing," Artificial Intelligence in Medicine, volume 32, number 2, pages 137-149, 2004. :::icon
13. Yu-cheng Chiang, Tsan-sheng Hsu, Sun Kuo, Churn-Jung Liau and Dai-Wei Wang, "Preserving confidentiality when sharing medical database with the Cellsecu system," International Journal of Medical Informatics, volume 71, pages 17-23, 2003.
14. Y.C. Chiang, T.-s. Hsu, S. Kuo, C.J. Liau, and D.W. Wang, "Preserving confidentiality when sharing medical database with the Cellsecu system," International Journal of Medical Informatics, volume 71, pages 17-23, 2003. :::icon
15. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu and Ming-Tat Ko, "Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs," SIAM Journal on Discrete Mathematics, volume 15, number 4, pages 488–518, January 2002. :::icon
16. Tsan-sheng Hsu, "Simpler and Faster Biconnectivity Augmentation," Journal of Algorithms, volume 45, number 1, pages 55--71, January 2002.
17. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Gen-Huey Chen, "Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs," SIAM Journal on Discrete Mathematics, volume 15, number 4, pages 488--518, 2002.
18. Tsan-sheng Hsu and Ping-Yi Liu, "Verification of Endgame Databases," Internation Computer Game Association (ICGA) Journal, volume 25, number 3, pages 132--144, 2002.
19. S. L. Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and Chuan-Yi Tang, "Node and Edge Searching Problems on Trees," Theoretic Computer Science, volume 240, number 2, pages 429-446, June 2000. :::icon
20. Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu and Chuan-Yi Tang, "Graph Searching on Some Subclasses of Chordal Graphs," Algorithmica, volume 27, pages 395-426, January 2000. :::icon
21. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and Gen-Huey Chen, "A Faster Implementation of a Parallel Tree Contraction Scheme and Its Applications on Distance-Hereditary Graphs," Journal of Algorithms, volume 35, pages 50-81, January 2000. :::icon
22. Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, and Chuan-Yi Tang, "Graph Searching on Some Subclasses of Chordal Graphs," Algorithmica, volume 27, pages 395--426, January 2000.
23. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Gen-Huey Chen, "A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs," Algorithms, volume 35, pages 50--81, January 2000.
24. Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Chuan-Yi Tang, "Edge and Node Searching Problems on Trees," Theoretical Computer Science, volume 240, number 2, pages 429-446, 2000, 3rd International Computing and Combinatorics Conf. (COCOON), Springer-Verlag LNCS #1276, pages 284--293, 1997.
25. Tsan-sheng Hsu, Joseph C. Lee, Dian Rae Lopez and William A. Royce, "Task Allocation on a Network of Processors," IEEE Transactions on Computers, volume 49, number 12, pages 1339--1353, 2000.
26. T.-s. Hsu, "On Four-Connecting a Triconnected Graph," Journal of Algorithms, volume 35, pages 202--234, 2000, Extended abstract in Proc. 33rd Annual IEEE Conf. on Foundations of Computer Science (FOCS), pages 70--79, 1992
27. Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu and Ram Swaminathan, "A Multi-Tree Generating Routing Scheme Using Acyclic Orientations," Theoretical Computer Science, volume 240, number 2, pages 487--494, 2000.
28. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Gen-Huey Chen, "Efficient Parallel Algorithms on Distance-Hereditary Graphs," Parallel Processing Letters, volume 9, pages 43-52, January 1999.
29. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and Gen-Huey Chen, "Efficient Parallel Algorithms on Distance-Hereditary Graphs," Parallel Processing Letters, volume 9, number 1, pages 43-52, January 1999.
30. T.-s. Hsu and M.~Y.~Kao, "A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity," Journal of Combinatorial Optimization, volume 2, pages 237--256, 1998.
31. Lisa Hollermann, Tsan-sheng Hsu, Dian Rae Lopez, and Keith Vertanen, "Scheduling Problems in a Practical Allocation Model," Combinatorial Optimization, volume 1, number 2, pages 129--149, 1997.
32. Tsan-sheng Hsu, Vijaya Ramachandran, and Nathaniel Dean, "Parallel Implementation of Algorithms for Finding Connected Components," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 30, pages 23-41, 1997, American Mathematical Society
33. Tsan-sheng Hsu and Vijaya Ramachandran, "Efficient Massively Parallel Implementation of Some Combinatorial Algorithms," Theoretical Computer Science, volume 162, pages 297--322, 1996.
34. Tsan-sheng Hsu, Vijaya Ramachandran, and Nathaniel Dean, "Implementation of Parallel Graph Algorithms on the MasPar," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 15, pages 165-198, 1994, American Mathematical Society
35. T.-s. Hsu and V. Ramachandran, "On Finding a Smallest Augmentation to Biconnect a Graph," SIAM Journal on Computing, volume 22, pages 889--912, January 1991.
 
 
Conference Papers
 
1. Bo-Nian Chen and Pangfeng Liu and Shun-Chin Hsu and Tsan-sheng Hsu, "Conflict Resolution of Chinese Chess Endgame Knowledge Base," Proc. 12th Advances in Computer Games Conference (ACG12), Lecture Notes in Computer Science, 6048, pages 146--157, 2010.
2. I.-C. Wang, C.-H. Shen, K. Chen, T.-s. Hsu, C.-J. Liau, and D.-W. Wang, "An empirical study on privacy and secure multi-party computation using exponentiation," Proc. of the 12th IEEE International Conference on Computational Science and Engineering (CSE09), pages 182--188, 2009.
3. I-Cheng Wang, Chih-Hao Shen, Tsan-Sheng Hsu, Churn-Chung Liao, Da-Wei Wang, Justin Zhan, "Towards Empirical Aspects of Secure Scalar Product," Information Security and Assurance, 2008, pages 573-578, April 2008.
4. Bo-Nian Chen and Pangfeng Liu and Shun-Chin Hsu and Tsan-sheng Hsu, "Knowledge Inferencing on Chinese Chess Endgames," Proc. 6th International Conference on Computers and Games (CG), Springer-Verlag LNCS# 5131, pages 180--191, 2008.
5. D.W.Wang, C.J. Liau, and T.-s. Hsu, "Logical definability in social position analysis," Proc. 2008 IEEE International Conference on Granular Computing, pages 35--38, 2008.
6. Chih-Hao Shen, Justin Zhan, Da-Wei Wang, Tsan-Sheng Hsu, Churn-Jung Liau, "Information-Theoretically Secure Number-Product Protocol," 2007 International Conference on Machine Learning and Cybernetics, volume 5, pages 3006-3011, August 2007.
7. Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "Granulation as a Privacy Protection Mechanism," LNCS Transactions on Rough Sets VII, Lecture Notes in Computer Science, number 4400, pages 256-273, 2007.
8. D.W. Wang, C.J. Liau, and T.-s. Hsu, "Privacy protection in social network data disclosure based on granular computing," Proc. 2006 IEEE International Conference on Fuzzy Systems, pages 5485--5491, 2006. :::icon
9. Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "A GrC-based Approach to Social Network Data Protection," Proceedings of the 3rd International Conference on Rough Sets and Current Trends in Computing (RSCTC), Lecture Notes in Artificial Intelligence, 2475, volume 4259, pages 438-447, 2006.
10. D.W. Wang, C.J. Liau, and T.-s. Hsu, "Attribute-oriented granulation for privacy protection," Proc. 2006 IEEE International Conference on Granular Computing, pages 726--731, 2006. :::icon
11. Bo-Nian Chen and Pangfeng Liu and Shun-Chin Hsu and Tsan-sheng Hsu, "Abstracting Knowledge from Annotated Chinese-Chess game Records," Proc. 5th International Conference on Computers and Games (CG), Springer-Verlag LNCS# 4630, pages 100--111, 2006.
12. D.W. Wang, C.J. Liau, and T.-s. Hsu, "A GrC-based approach to social network data protection," Proc. 5th International Conference on Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence, 4259, pages 438--447, 2006. :::icon
13. D.W. Wang, C.J. Liau, Y.T. Chiang, and T.-s. Hsu, "Information theoretical analysis of two-party secret computation," Proc. 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Lecture Notes in Computer Science, 4127, pages 310--317, 2006. :::icon
14. Yi-Ting Chiang, Da-Wei Wang, Churn-Jung Liau and Tsan-sheng Hsu, "Secrecy of Two-Party Secure Computation," Proc. 19th Annual IFIP WG 11.3 Working Conference on Data and Application Security, Lecture Notes in Computer Science, volume 3654, LNCS, Jajodia, Sushil; Wijesekera and Duminda, editors, pages 114--123, August 2005.
15. Y.T. Chiang, D.W. Wang, C.J. Liau, and T.-s. Hsu, "Secrecy of two-party secure computation," Proc. of the 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Lecture Notes in Computer Science, 3654, pages 114-123, 2005. :::icon
16. Kuang-che Wu, Shun-Chin Hsu and Tsan-sheng Hsu, "The Graph History Interaction Problem in Chinese Chess," Proc. 11th Advances in Computer Games Conference, (ACG) LNCS 4250, Lecture Notes in Computer Science, 2005.
17. D.-W. Wang, C.-J. Liau, T.-s. Hsu, and Jeremy K.-P. Chen, "On the damage and compensation of privacy leakage," Proceedings of the 18th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, pages 311-324, 2004.
18. C.-C. Lin, T.-s. Hsu, and D.-W. Wang, "Bounds on the client-server incremental computing," Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pages 86-91, 2004.
19. D.W. Wang, C.J. Liau, T.-s. Hsu, and J.K.-P. Chen, "On the damage and compensation of privacy leakage," Proc. of the 18th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, pages 311-324, 2004. :::icon
20. Ping-hsun Wu, Ping-Yi Liu and Tsan-sheng Hsu, "An External-Memory Retrograde Analysis Algorithm," Proc. 4th International Conference on Computers and Games (CG) LNCS3846, Lecture Notes in Computer Science, Springer-Verlag, 2004.
21. Y. L. Lin and T. S. Hsu, "Efficient algorithms for descendent subtrees comparison of phylogenetic trees with applications to co-evolutionary classifications in bacterial genome," Proceedings of the 14th International Symposium on Algorithms and Computation(ISAAC), Lecture Notes in Computer Science, 2906, Springer-Verlag, pages 339-351, Kyoto, Japan, January 2003.
22. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, "Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs," proceedings of International Conference on Computing and Combinatorics(COCOON), Lecture Notes in Computer Science, 2387, pages 77-86, Singapore, August 2002.
23. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, and Ming-Tat Ko, "Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs," 8th International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science, 2378, Springer-Verlag, pages 67-76, January 2002.
24. Tsan-sheng Hsu, Churn-Jung Liau, Da-Wai Wang and Jeremy K.-P. Chen, "Quantifying Privacy Leakage Through Answering Database Queries," 5th Information Security Conference (ISC), Lecture Notes in Computer Science, 2433, Springer-Verlag, pages 162--175, January 2002.
25. Yi-Ting Chiang, Yucheng Chiang, Tsan-sheng Hsu, Churn-Jung Liau and Da-Wai Wang, "How Much Privacy? --- A System to Safe Guard Personal Privacy While Releasing Databases," 3rd International Conference on Rough Sets and Current Trends in Computing (RSCTC), Lecture Notes in Computer Science, 2475, Springer-Verlag, pages 226-233, January 2002.
26. Y.T. Chiang, Y.C. Chiang, T.-s. Hsu, C.-J. Liau, and D.W. Wang, "How much privacy? - A system to safe guard personal privacy while releasing database," Proceedings of the 3rd International Conference on Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence, 2475, pages 226-233, 2002. :::icon
27. T.-s. Hsu, C.-J. Liau, D.W. Wang, and J. K.-P. Chen, "Quantifying privacy leakage through answering database queries," Proc. of the 5th International Conference on Information Security, Lecture Notes in Computer Science, 2433, pages 162-175, 2002. :::icon
28. T.-S. Hsu, C.-J. Liau, D.-W. Wang, and Jeremy K.-P. Chen, "Quantifying Privacy Leakage Through Answering Database Queries," Proceedings of the 5the Information Security Conference, number LNSC2433, Agnes Chan and virgil Gligor, editor, Springer-Verlag, pages 162-176, 2002.
29. Tsan-sheng Hsu, Churn-Jung Liau and Da-Wai Wang, "A Logical Model for Privacy Protection," Proc. 4th Information Security Conference (ISC), Lecture Notes in Computer Science, 2200, Springer-Verlag, pages 110-124, January 2001.
30. T.-s. Hsu, "Simpler and Faster Vertex-Connectivity Augmentation Algorithms (Extended Abstract)," European Symposium on Algorithms, Lecture Notes in Computer Science, 1879, M. Paterson, editor, Springer-Verlag, pages 278--289, New York NY, 2000.
31. Yucheng Chiang, Tsan-sheng Hsu, Sun Kuo and Dai-Wei Wang, "Preserving Confidentially When Sharing Medical Data," Proc. Asia Pacific Medical Informatics Conference (APAMI-MIC), 2000.
32. Yu-Cheng Chiang, Tsan-Sheng Hsu, Sun Kuo, and Da-Wei Wang, "Preserving Confidentiality When Sharing Medical Database with the Cellsecu System," APAMI-MIC2000, HongKong, 2000.
33. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and Gen-Huey Chen, "Characterization of Efficiently Computable Problems on Distance-Hereditary Graphs," 9th International Symposium of Algorithms and Computation(ISAAC), Lecture Notes in Computer Science, 1533, pages 257-266, Taejon, Korea, December 1998.
34. S. L. Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and Chuan-Yi Tang, "A Linear-time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree," Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, 1449, pages 279-288, Taipei, Taiwan, August 1998.
35. Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Chuan-Yi Tang, "A Linear-time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree," 4th International Computing and Combinatorics Conf. (COCOON), Lecture Notes in Computer Science, 1449, Springer-Verlag, pages 279-288, January 1998.
36. Tsan-sheng Hsu and Dian Rae Lopez, "Executing Divisible Jobs on a Network with a Fixed Number of Processors (Extended Abstract)," 4th International Computing and Combinatorics Conf. (COCOON), Lecture Notes in Computer Science, 1449, Springer-Verlag, pages 241--250, January 1998, Springer-Verlag
37. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Gen-Huey Chen, "Characterization of Efficiently Computable Problems on Distance-Hereditary Graphs," 8th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1533, Springer-Verlag, pages 257--266, January 1998.
38. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Gen-Huey Che, "A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs(Extended abstract )," Proc. 5th International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRR), Lecture Notes in Computer Science, 1457, Springer-Verlag, pages 298--309, January 1998.
39. S. L. Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and Chuan-Yi Tang, "Node and Edge Searching Problems on Trees(preliminary version)," Annual Int'l Computing and Combinatorics Conf, Lecture Notes in Computer Science, 1276, pages 284-293, Shanghai, China, August 1997.
40. Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Chuan-Yi Tang, "Edge and Node Searching Problems on Trees(Extended abstract )," Proc. 3rd International Computing and Combinatorics Conf. (COCOON), Lecture Notes in Computer Science, 1276, Springer-Verlag, pages 284--293, January 1997.
41. T.-s. Hsu and M.~Y.~Kao, "Security Problems for Statistical Databases with General Cell Suppressions," Proceedings of the 9th International Conference on Scientific and Statistical Database Management(SSDBM), pages 155--164, January 1997.
42. Sun-yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, and Gen-Huey Chen, "Efficient Parallel Algorithms on Distance-Hereditary Graphs(Extended abstract )," Proc. International Conference on Parallel Processing (ICPP), pages 20--23, January 1997.
43. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and Gen-Huey Chen, "Efficient Parallel Algorithms on Distance-Hereditary Graphs(preliminary version)," International Conference on Parallel Processing (ICPP97), pages 20-23, January 1997.
44. Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang and D.T. Lee, "Steiner Problems on Directed Acyclic Graphs," Proc. 2nd International Computing and Combinatorics Conf. (COCOON), Lecture Notes in Computer Science, 1090, Springer-Verlag, pages 21--30, January 1996.
45. Tsan-sheng Hsu and Ming-Yang Kao, "Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time(Extended Abstract)," 7th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1178, pages 213-222, January 1996.
46. Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, and Chuan-Yi Tang, "Graph Searching on Chordal Graphs," Proc. 7th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1178, Springer-Verlag, pages 156--165, January 1996.
47. Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu and Chuan-Yi Tang, "Graph Searching on Subclasses of Chordal Graphs(preliminary version)," Int'l Symp on Algorithms and Computation, Lecture Notes in Computer Science, 1178, pages 156-165, Osaka, Japan, January 1996.
48. T.-s. Hsu and M.~Y.~Kao, "Optimal Bi-Level Augmentation for Selectively EnhancingGraph Connectivity with Applications," Proceedings of the 2nd International Computing and Combinatorics Conference(COCOON), Lecture Notes in Computer Science, 1090, J. Y. Cai and C. K. Wang, editor, Springer-Verlag, pages 169--178, New York NY, January 1996.
49. Tsan-sheng Hsu and Dian Rae Lopez, "Bounds and Algorithms for a Practical Task Allocation Model," 7th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1178, pages 397-406, 1996.
50. Tsan-sheng Hsu, Vijaya Ramachandran, and Nathaniel Dean, "mplementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing," 9th International Parallel Processing Symp. (IPPS), pages 106-112, 1995.
51. Tsan-sheng Hsu, "Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation (Extended Abstract)," 6th International Symp. on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1004, pages 274-283, 1995.
52. Tsan-sheng Hsu, Vijaya Ramachandran, and Nathaniel Dean, "Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing," Proc. 9th International Parallel Processing Symp. (IPPS), pages 106--112, 1995.
53. Tsan-sheng Hsu and Vijaya Ramachandran, "Efficient Implementation of Virtual Processing for Some Combinatorial Algorithms on the MasPar MP-1," Proc. 7th IEEE Symp. Parallel and Distributed Processing (ISPDP), pages 154--159, 1995.
54. T.-s. Hsu and V. Ramachandran, "On Finding a Smallest Augmentation to Biconnect a Graph(Extended abstract)," Proc. 2nd International Symp. on Algorithms, Lecture Notes in Computer Science, 557, Springer-Verlag, pages 326--335, January 1993.
55. T.-s. Hsu, "On Four-Connecting a Triconnected Graph(Extended Abstract)," IEEE Symposium on Foundations of Computer Science, pages 70--79, 1992.
56. T.-s. Hsu and V. Ramachandran, "A Linear Time Algorithm for Triconnectivity Augmentation," Proceedings of the 32th Annual IEEE Symposium on Foundations of Computer Science(FOCS), pages 548--559, January 1991.
57. Tsan-sheng Hsu, Shun-Shii Lin, and Shun-Chin Hsu, "Some Studies in the Game of OTHELLO," National Computer Symp. (NCS), pages 596--604, Taiwan, Republic of China, January 1987.
 
 
Technical Reports
 
1. T.-s. Hsu, Tech. Rep., "Undirected Vertex-Connectivity Structure and SmallestFour-Vertex-Connectivity Augmentation," number TR-IIS-95-002 (45 pages), Institute of Information ScienceAcademia Sinica Nankang Taipei Taiwan ROC, 1995.
 
 
 
Others
 
1. T.-s. Hsu and V. Ramachandran, "Smallest Triconnectivity AugmentationPart 1: Biconnected Graphs," 1992, Manuscript
2. T.-s. Hsu and V. Ramachandran, "Smallest Triconnectivity AugmentationPart 2: General Graphs," 1992, Manuscript
3. T.-s. Hsu and V. Ramachandran, "Efficient Sequential and Parallel Algorithms forEdge Connectivity Augmentation," 1992, Manuscript
4. T.-s. Hsu and V. Ramachandran, "An Efficient Parallel Algorithm for TriconnectivityAugmentation," 1992, Manuscript
 
 
bg