Chinese
English
Research Fellow  |  Hsu, Tsan-sheng  
 
contact
vita
education
experience
interests
descriptions
activities
invited_talk
honors
publications
 
 
 
 
 
Publications
 
1. Bo-Nian Chen and Tsan-sheng Hsu, "Automatic Generation of Chinese Dark Chess Opening Books," to appear in Proceedings of the 8th International Conference on Computers and Games (CG), Springer-Verlag.
2. Hung-Jui Chang and Tsan-sheng Hsu, "Quantitative study of 2 by 4 Chinese Dark Chess," to appear in Proceedings of the 8th International Conference on Computers and Games (CG), Springer-Verlag.
3. Y.-C. Liu, Y.-T. Chiang, T.-s. Hsu, C.-J. Liau, and D.-W. Wang, "Floating point arithmetic protocols for constructing secure data analysis application," to appear in Proceeedings of the 17th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems (KES),.
4. Chia-Tung Kuo, Da-Wei Wang and Tsan-sheng Hsu, "Simple and efficient algorithms to get finer resolution in a stochastic discrete time agent-based simulation," to appear in Advances in Intelligent and Soft Computing, volume 4240.
5. T.-s. Hsu, C.J. Liau and D.W. Wang, "Privacy-preserving social network publication based on positional indiscernibility," Proceedings of the 7th International Conference on Scalable Uncertainty Management (SUM), Lecture Notes in Artificial Intelligence, V.S. Subrahmanian and W. Liu and J. Wijsen, editors, Springer-Verlag, Washington DC Area, USA, September 2013.
6. Tseng-Yi Chen, Hsin-Wen Wei, Che-Rung Lee, Tsan-sheng Hsu and Wei-Kuan Shih, "EEGRA: Energy Efficient Geographic Routing Algorithms for Wireless Sensor Network," Proceedings of the 2012 International Symposium on Pervasive Systems, Algorithms, and Networks (I-SPAN), pages 104--113, December 2012.
7. Tseng-Yi Chen, Tsung-Tai Yeh, Hsin-Wen Wei, Yu-Hsun Fang, Wei-Kuan Shih and Tsan-sheng Hsu, "CacheRAID: An Efficient Adaptive Write Cache Policy to Conserve RAID Disk Array Energy," Proceedings of the the 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC), pages 117--124, November 2012.
8. Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu and Tsan-sheng Hsu, "Aggregating Consistent Endgame Knowledge in Chinese Chess," Knowledge-Based Systems, volume 34, pages 34--42, October 2012.
9. Hung-Jui Chang, Meng-Tsung Tsai and Tsan-sheng Hsu, "Game Tree Search with Adaptive Resolution," Proceedings of the 13th Advances in Computer Games Conference, (ACG), Lecture Notes in Computer Science, 7168, pages 306--319, October 2012.
10. Chia-Tung Kuo, Da-Wei Wang and Tsan-sheng Hsu, "A simple efficient technique to adjust the time step size in a stochastic discrete agent-based simulation," Proceedings of the 2012 International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH), pages 42-48, September 2012.
11. T.-s. Hsu, C.J. Liau and D.W. Wang, "A probabilistic hybrid logic for sanitized information systems," Proceedings of the 6th International Conference on Scalable Uncertainty Management (SUM), Lecture Notes in Computer Science, 7520, E. Hüllermeier, S. Link, T. Fober and and B. Seeger, editors, Springer, pages 500-513, September 2012.
12. K. Chen, T.-s. Hsu, W.K. Huang, C.J. Liau and D.W. Wang, "Towards a scripting language for automating secure multiparty computation," 2012 Asia-Pacific Programming Languages and Compilers Workshop (APPLC), June 2012.
13. T.-s. Hsu, C.J. Liau and D.W. Wang, "Logic, probability, and privacy: A framework for specifying privacy requirements," Turing-100. The Alan Turing Centenary, volume 10, EasyChair Proceedings in Computing (EPiC), A. Voronkov, editor, pages 157-167, June 2012.
14. Hsiu-Lien Yeh, Yan-Fu Chen, Tsung-Tai Yeh, Pei-Chi Huang, Shin-Hao Liu, Hsin-Wen Wei and Tsan-sheng Hsu, "A Monitoring System Based on Nagios for Data Grid Environments," Proceedings of the 2011 International Conference on Grid Computing and Applications (GCA), July 2011.
15. Meng-Tsung Tsai and Tsan-sheng Hsu, "Scalable Space-efficient Algorithms for Triangle Counting," Proceedings of the Third Workshop on Massive Data Algorithmics (MASSIVE), June 2011.
16. Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu and Tsan-sheng Hsu, "Knowledge Abstraction in Chinese Chess Endgame databases," Proceedings of the 7th International Conference on Computers and Games (CG), volume LNCS# 6515, pages 176--187, 2011.
17. T.C. Chern, M.T. Tsai, H.J. Chang, J.H. Chuang, T.-s. Hsu, H.S. Kuo, C.J. Liau, D.W. Wang, "Quantitative assessment of early intervention strategies: a case study of 2009 H1N1 pandemic in Taiwan," Options for the Control of Influenza VII Conference, September 2010.
18. M.T. Tsai, D.W. Wang, C.J.Liau and T.-s. Hsu,, "Heterogeneous subset sampling," The 16th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science, 5196, pages 500-509, July 2010.
19. Bo-Nian Chen, Bing-Jie Shen and Tsan-sheng Hsu, "Chinese Dark Chess," International Computer Game Association (ICGA) Journal, volume 33, number 2, pages 93--106, June 2010.
20. Yen-Chiu Chen, Hsin-Wen Wei, Pei-Chi Huang, Wei-Kuan Shih and Tsan-sheng Hsu, "The Bridge-connectivity Augmentation with a General Partition Constraint," Theoretical Computer Science, volume 411, pages 2878--2889, 2010.
21. 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.
22. Bo-Nian Chen and Pangfeng Liu and Shun-Chin Hsu and Tsan-sheng Hsu, "Knolwedge Abstraction in Chinese Chess Endgame Databases," Proceedings of the 7th International Conference on Computers and Games (CG), 2010.
23. J. Zhan, C.L. Hsieh, I.C. Wang, T.-s. Hsu, C.J. Liau and D.W. Wang, "Privacy-preserving collaborative recommender systems," IEEE Transactions on Systems, Man, and Cybernetics Part C: Applications and Reviews, pages 472--476, 2010.
24. I.C. Wang, K. Chen, J.H. Chuang, C.H. Lee, T.-s. Hsu, C.J. Liau, P.Y. Wang, D.W. Wang, "On applying secure multi-party computation: A case report," Asia Pacific Association for Medical Informatics (APAMI 2009), November 2009.
25. 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.
26. 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.
27. 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.
28. Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Lu, Ming-Yang Kao, Wei-Kuan Shih and Tsan-sheng Hsu, "Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)," Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), 2009.
29. 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.
30. 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.
31. 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.
32. 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
33. 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.
34. 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.
35. 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.
36. 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.
37. 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.
38. 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.
39. 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.
40. 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.
41. 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.
42. 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.
43. 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.
44. 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.
45. 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.
46. 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.
47. 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.
48. 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.
49. 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.
50. 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.
51. 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.
52. Tsan-sheng Hsu and Ping-Yi Liu, "Verification of Endgame Databases," International Computer Game Association (ICGA) Journal, volume 25, number 3, pages 132--144, September 2002.
53. 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.
54. 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.
55. 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.
56. Tsan-sheng Hsu, "Simpler and Faster Biconnectivity Augmentation," Journal of Algorithms, volume 45, number 1, pages 55--71, January 2002.
57. 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.
58. 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.
59. 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.
60. 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.
61. 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.
62. 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.
63. 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.
64. 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.
65. 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.
66. 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.
67. 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.
68. 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.
69. 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.
70. 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
71. 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.
72. 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.
73. 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.
74. 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.
75. 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.
76. 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
77. 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.
78. 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.
79. 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.
80. 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.
81. 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.
82. 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.
83. 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.
84. 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.
85. 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.
86. 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
87. 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.
88. 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.
89. 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.
90. 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.
91. 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.
92. 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.
93. Tsan-sheng Hsu and Vijaya Ramachandran, "Efficient Massively Parallel Implementation of Some Combinatorial Algorithms," Theoretical Computer Science, volume 162, pages 297--322, 1996.
94. 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.
95. 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.
96. 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.
97. 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.
98. 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.
99. 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.
100. 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
101. 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.
102. T.-s. Hsu and V. Ramachandran, "Efficient Sequential and Parallel Algorithms forEdge Connectivity Augmentation," 1992, Manuscript
103. T.-s. Hsu and V. Ramachandran, "Smallest Triconnectivity AugmentationPart 2: General Graphs," 1992, Manuscript
104. T.-s. Hsu and V. Ramachandran, "An Efficient Parallel Algorithm for TriconnectivityAugmentation," 1992, Manuscript
105. T.-s. Hsu and V. Ramachandran, "Smallest Triconnectivity AugmentationPart 1: Biconnected Graphs," 1992, Manuscript
106. T.-s. Hsu, "On Four-Connecting a Triconnected Graph(Extended Abstract)," IEEE Symposium on Foundations of Computer Science, pages 70--79, 1992.
107. 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.
108. 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.
109. 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.
 
 
bg