
Research Fellow  Hsu, Tsansheng 





Publications 

1. 
BoNian Chen and Tsansheng Hsu, "Automatic Generation of Chinese Dark Chess Opening Books," to appear in Proceedings of the 8th International Conference on Computers and Games (CG), SpringerVerlag. 
2. 
HungJui Chang and Tsansheng Hsu, "Quantitative study of 2 by 4 Chinese Dark Chess," to appear in Proceedings of the 8th International Conference on Computers and Games (CG), SpringerVerlag. 
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 KnowledgeBased and Intelligent Information & Engineering Systems (KES),. 
4. 
ChiaTung Kuo, DaWei Wang and Tsansheng Hsu, "Simple and efficient algorithms to get finer resolution in a stochastic discrete time agentbased simulation," to appear in Advances in Intelligent and Soft Computing, volume 4240. 
5. 
T.s. Hsu, C.J. Liau and D.W. Wang, "Privacypreserving 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, SpringerVerlag, Washington DC Area, USA, September 2013. 
6. 
TsengYi Chen, HsinWen Wei, CheRung Lee, Tsansheng Hsu and WeiKuan Shih, "EEGRA: Energy Efficient Geographic Routing Algorithms for Wireless Sensor Network," Proceedings of the 2012 International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN), pages 104113, December 2012. 
7. 
TsengYi Chen, TsungTai Yeh, HsinWen Wei, YuHsun Fang, WeiKuan Shih and Tsansheng 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 117124, November 2012. 
8. 
BoNian Chen, Pangfeng Liu, ShunChin Hsu and Tsansheng Hsu, "Aggregating Consistent Endgame Knowledge in Chinese Chess," KnowledgeBased Systems, volume 34, pages 3442, October 2012. 
9. 
HungJui Chang, MengTsung Tsai and Tsansheng Hsu, "Game Tree Search with Adaptive Resolution," Proceedings of the 13th Advances in Computer Games Conference, (ACG), Lecture Notes in Computer Science, 7168, pages 306319, October 2012. 
10. 
ChiaTung Kuo, DaWei Wang and Tsansheng Hsu, "A simple efficient technique to adjust the time step size in a stochastic discrete agentbased simulation," Proceedings of the 2012 International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH), pages 4248, 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 500513, 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 AsiaPacific 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," Turing100. The Alan Turing Centenary, volume 10, EasyChair Proceedings in Computing (EPiC), A. Voronkov, editor, pages 157167, June 2012. 
14. 
HsiuLien Yeh, YanFu Chen, TsungTai Yeh, PeiChi Huang, ShinHao Liu, HsinWen Wei and Tsansheng 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. 
MengTsung Tsai and Tsansheng Hsu, "Scalable Spaceefficient Algorithms for Triangle Counting," Proceedings of the Third Workshop on Massive Data Algorithmics (MASSIVE), June 2011. 
16. 
BoNian Chen, Pangfeng Liu, ShunChin Hsu and Tsansheng Hsu, "Knowledge Abstraction in Chinese Chess Endgame databases," Proceedings of the 7th International Conference on Computers and Games (CG), volume LNCS# 6515, pages 176187, 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 500509, July 2010. 
19. 
BoNian Chen, BingJie Shen and Tsansheng Hsu, "Chinese Dark Chess," International Computer Game Association (ICGA) Journal, volume 33, number 2, pages 93106, June 2010. 
20. 
YenChiu Chen, HsinWen Wei, PeiChi Huang, WeiKuan Shih and Tsansheng Hsu, "The Bridgeconnectivity Augmentation with a General Partition Constraint," Theoretical Computer Science, volume 411, pages 28782889, 2010. 
21. 
BoNian Chen and Pangfeng Liu and ShunChin Hsu and Tsansheng Hsu, "Conflict Resolution of Chinese Chess Endgame Knowledge Base," Proc. 12th Advances in Computer Games Conference (ACG12), Lecture Notes in Computer Science, 6048, pages 146157, 2010. 
22. 
BoNian Chen and Pangfeng Liu and ShunChin Hsu and Tsansheng 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, "Privacypreserving collaborative recommender systems," IEEE Transactions on Systems, Man, and Cybernetics Part C: Applications and Reviews, pages 472476, 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 multiparty computation: A case report," Asia Pacific Association for Medical Informatics (APAMI 2009), November 2009. 
25. 
IC. 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 440447, 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 multiparty computation using exponentiation," Proc. of the 12th IEEE International Conference on Computational Science and Engineering (CSE09), pages 182188, 2009. 
27. 
PeiChi Huang, HsinWen Wei, WanChen Lu, WeiKuan Shih and Tsansheng Hsu, "Smallest Bipartite Bridgeconnectivity Augmentation," Algorithmica, volume 54, pages 353378, 2009. 
28. 
PeiChi Huang, HsinWen Wei, YenChiu Lu, MingYang Kao, WeiKuan Shih and Tsansheng Hsu, "TwoVertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)," Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), 2009. 
29. 
ICheng Wang, ChihHao Shen, TsanSheng Hsu, ChurnChung Liao, DaWei Wang, Justin Zhan, "Towards Empirical Aspects of Secure Scalar Product," Information Security and Assurance, 2008, pages 573578, April 2008. 
30. 
BoNian Chen and Pangfeng Liu and ShunChin Hsu and Tsansheng Hsu, "Knowledge Inferencing on Chinese Chess Endgames," Proc. 6th International Conference on Computers and Games (CG), SpringerVerlag LNCS# 5131, pages 180191, 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 176205, 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 256273, 2007, LNCS 4400 
33. 
Chochin Lin, DaWei Wang and Tsansheng Hsu, "Bounds on the ClientServer Incremental Computing," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, volume E89A, number 5, pages 11981206, May 2006. 
34. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, and MingTat Ko, "The Hamiltonian Problem on DistanceHereditary Graphs," Discrete Applied Mathematics, volume 154, number 3, pages 508524, 2006. 
35. 
D.W. Wang, C.J. Liau, Y.T. Chiang, and T.s. Hsu, "Information theoretical analysis of twoparty secret computation," Proc. 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Lecture Notes in Computer Science, 4127, pages 310317, 2006. 
36. 
D.W. Wang, C.J. Liau, and T.s. Hsu, "A GrCbased 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 438447, 2006. 
37. 
BoNian Chen and Pangfeng Liu and ShunChin Hsu and Tsansheng Hsu, "Abstracting Knowledge from Annotated ChineseChess game Records," Proc. 5th International Conference on Computers and Games (CG), SpringerVerlag LNCS# 4630, pages 100111, 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 179201, 2006. 
39. 
D.W. Wang, C.J. Liau, and T.s. Hsu, "Attributeoriented granulation for privacy protection," Proc. 2006 IEEE International Conference on Granular Computing, pages 726731, 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 54855491, 2006. 
41. 
Tsansheng Hsu and MingYang Kao, "Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time," SIAM Journal on Discrete Mathematics, volume 19, number 2, pages 345362, 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 101120, 2005. 
43. 
Y.T. Chiang, D.W. Wang, C.J. Liau, and T.s. Hsu, "Secrecy of twoparty 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 114123, 2005. 
44. 
Kuangche Wu, ShunChin Hsu and Tsansheng 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 311324, 2004. 
46. 
Pinghsun Wu, PingYi Liu and Tsansheng Hsu, "An ExternalMemory Retrograde Analysis Algorithm," Proc. 4th International Conference on Computers and Games (CG) LNCS3846, Lecture Notes in Computer Science, SpringerVerlag, 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 137149, 2004. 
48. 
C.C. Lin, T.s. Hsu, and D.W. Wang, "Bounds on the clientserver incremental computing," Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN), pages 8691, 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 137149, 2004. 
50. 
Y. L. Lin and T. S. Hsu, "Efficient algorithms for descendent subtrees comparison of phylogenetic trees with applications to coevolutionary classifications in bacterial genome," Proceedings of the 14th International Symposium on Algorithms and Computation(ISAAC), Lecture Notes in Computer Science, 2906, SpringerVerlag, pages 339351, 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 1723, 2003. 
52. 
Tsansheng Hsu and PingYi Liu, "Verification of Endgame Databases," International Computer Game Association (ICGA) Journal, volume 25, number 3, pages 132144, September 2002. 
53. 
SunYuan Hsieh, ChinWen Ho, Tsansheng Hsu, "Efficient Algorithms for the Hamiltonian Problem on DistanceHereditary Graphs," proceedings of International Conference on Computing and Combinatorics(COCOON), Lecture Notes in Computer Science, 2387, pages 7786, Singapore, August 2002. 
54. 
SunYuan Hsieh, ChinWen Ho, Tsansheng Hsu and MingTat Ko, "Characterization of Efficiently Solvable Problems on DistanceHereditary Graphs," SIAM Journal on Discrete Mathematics, volume 15, number 4, pages 488â€“518, January 2002. 
55. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, and MingTat Ko, "Efficient Algorithms for the Hamiltonian Problem on DistanceHereditary Graphs," 8th International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science, 2378, SpringerVerlag, pages 6776, January 2002. 
56. 
Tsansheng Hsu, "Simpler and Faster Biconnectivity Augmentation," Journal of Algorithms, volume 45, number 1, pages 5571, 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 162175, 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 226233, 2002. 
59. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and GenHuey Chen, "Characterization of Efficiently Parallel Solvable Problems on DistanceHereditary Graphs," SIAM Journal on Discrete Mathematics, volume 15, number 4, pages 488518, 2002. 
60. 
Tsansheng Hsu, ChurnJung Liau and DaWai Wang, "A Logical Model for Privacy Protection," Proc. 4th Information Security Conference (ISC), Lecture Notes in Computer Science, 2200, SpringerVerlag, pages 110124, January 2001. 
61. 
S. L. Peng, ChinWen Ho, Tsansheng Hsu, MingTat Ko and ChuanYi Tang, "Node and Edge Searching Problems on Trees," Theoretic Computer Science, volume 240, number 2, pages 429446, June 2000. 
62. 
ShengLung Peng, MingTat Ko, ChinWen Ho, Tsansheng Hsu, and ChuanYi Tang, "Graph Searching on Some Subclasses of Chordal Graphs," Algorithmica, volume 27, pages 395426, January 2000. 
63. 
ShengLung Peng, MingTat Ko, ChinWen Ho, Tsansheng Hsu and ChuanYi Tang, "Graph Searching on Some Subclasses of Chordal Graphs," Algorithmica, volume 27, pages 395426, January 2000. 
64. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and GenHuey Chen, "A New Simple Parallel Tree Contraction Scheme and Its Application on DistanceHereditary Graphs," Algorithms, volume 35, pages 5081, January 2000. 
65. 
SunYuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko and GenHuey Chen, "A Faster Implementation of a Parallel Tree Contraction Scheme and Its Applications on DistanceHereditary Graphs," Journal of Algorithms, volume 35, pages 5081, January 2000. 
66. 
T.s. Hsu, "Simpler and Faster VertexConnectivity Augmentation Algorithms (Extended Abstract)," European Symposium on Algorithms, Lecture Notes in Computer Science, 1879, M. Paterson, editor, SpringerVerlag, pages 278289, New York NY, 2000. 
67. 
Tsansheng 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 13391353, 2000. 
68. 
Fred S. Annexstein, Kenneth A. Berman, Tsansheng Hsu and Ram Swaminathan, "A MultiTree Generating Routing Scheme Using Acyclic Orientations," Theoretical Computer Science, volume 240, number 2, pages 487494, 2000. 
69. 
ShengLung Peng, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and ChuanYi Tang, "Edge and Node Searching Problems on Trees," Theoretical Computer Science, volume 240, number 2, pages 429446, 2000, 3rd International Computing and Combinatorics Conf. (COCOON), SpringerVerlag LNCS #1276, pages 284293, 1997. 
70. 
T.s. Hsu, "On FourConnecting a Triconnected Graph," Journal of Algorithms, volume 35, pages 202234, 2000, Extended abstract in Proc. 33rd Annual IEEE Conf. on Foundations of Computer Science (FOCS), pages 7079, 1992 
71. 
YuCheng Chiang, TsanSheng Hsu, Sun Kuo, and DaWei Wang, "Preserving Confidentiality When Sharing Medical Database with the Cellsecu System," APAMIMIC2000, HongKong, 2000. 
72. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and GenHuey Chen, "Efficient Parallel Algorithms on DistanceHereditary Graphs," Parallel Processing Letters, volume 9, pages 4352, January 1999. 
73. 
SunYuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko and GenHuey Chen, "Efficient Parallel Algorithms on DistanceHereditary Graphs," Parallel Processing Letters, volume 9, number 1, pages 4352, January 1999. 
74. 
SunYuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko and GenHuey Chen, "Characterization of Efficiently Computable Problems on DistanceHereditary Graphs," 9th International Symposium of Algorithms and Computation(ISAAC), Lecture Notes in Computer Science, 1533, pages 257266, Taejon, Korea, December 1998. 
75. 
S. L. Peng, ChinWen Ho, Tsansheng Hsu, MingTat Ko and ChuanYi Tang, "A Lineartime Algorithm for Constructing an Optimal NodeSearch Strategy of a Tree," Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, 1449, pages 279288, Taipei, Taiwan, August 1998. 
76. 
Tsansheng 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, SpringerVerlag, pages 241250, January 1998, SpringerVerlag 
77. 
ShengLung Peng, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and ChuanYi Tang, "A Lineartime Algorithm for Constructing an Optimal NodeSearch Strategy of a Tree," 4th International Computing and Combinatorics Conf. (COCOON), Lecture Notes in Computer Science, 1449, SpringerVerlag, pages 279288, January 1998. 
78. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and GenHuey Chen, "Characterization of Efficiently Computable Problems on DistanceHereditary Graphs," 8th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1533, SpringerVerlag, pages 257266, January 1998. 
79. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and GenHuey Che, "A New Simple Parallel Tree Contraction Scheme and Its Application on DistanceHereditary Graphs(Extended abstract )," Proc. 5th International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRR), Lecture Notes in Computer Science, 1457, SpringerVerlag, pages 298309, January 1998. 
80. 
T.s. Hsu and M.~Y.~Kao, "A Unifying Augmentation Algorithm for TwoEdge Connectivity and Biconnectivity," Journal of Combinatorial Optimization, volume 2, pages 237256, 1998. 
81. 
S. L. Peng, ChinWen Ho, Tsansheng Hsu, MingTat Ko and ChuanYi Tang, "Node and Edge Searching Problems on Trees(preliminary version)," Annual Int'l Computing and Combinatorics Conf, Lecture Notes in Computer Science, 1276, pages 284293, 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 155164, January 1997. 
83. 
SunYuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko and GenHuey Chen, "Efficient Parallel Algorithms on DistanceHereditary Graphs(preliminary version)," International Conference on Parallel Processing (ICPP97), pages 2023, January 1997. 
84. 
ShengLung Peng, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and ChuanYi Tang, "Edge and Node Searching Problems on Trees(Extended abstract )," Proc. 3rd International Computing and Combinatorics Conf. (COCOON), Lecture Notes in Computer Science, 1276, SpringerVerlag, pages 284293, January 1997. 
85. 
Sunyuan Hsieh, ChinWen Ho, Tsansheng Hsu, MingTat Ko, and GenHuey Chen, "Efficient Parallel Algorithms on DistanceHereditary Graphs(Extended abstract )," Proc. International Conference on Parallel Processing (ICPP), pages 2023, January 1997. 
86. 
Tsansheng 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 2341, 1997, American Mathematical Society 
87. 
Lisa Hollermann, Tsansheng Hsu, Dian Rae Lopez, and Keith Vertanen, "Scheduling Problems in a Practical Allocation Model," Combinatorial Optimization, volume 1, number 2, pages 129149, 1997. 
88. 
T.s. Hsu and M.~Y.~Kao, "Optimal BiLevel 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, SpringerVerlag, pages 169178, New York NY, January 1996. 
89. 
ShengLung Peng, MingTat Ko, ChinWen Ho, Tsansheng Hsu, and ChuanYi Tang, "Graph Searching on Chordal Graphs," Proc. 7th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1178, SpringerVerlag, pages 156165, January 1996. 
90. 
ShengLung Peng, MingTat Ko, ChinWen Ho, Tsansheng Hsu and ChuanYi Tang, "Graph Searching on Subclasses of Chordal Graphs(preliminary version)," Int'l Symp on Algorithms and Computation, Lecture Notes in Computer Science, 1178, pages 156165, Osaka, Japan, January 1996. 
91. 
Tsansheng Hsu and MingYang 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 213222, January 1996. 
92. 
Tsansheng Hsu, KuoHui Tsai, DaWei 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, SpringerVerlag, pages 2130, January 1996. 
93. 
Tsansheng Hsu and Vijaya Ramachandran, "Efficient Massively Parallel Implementation of Some Combinatorial Algorithms," Theoretical Computer Science, volume 162, pages 297322, 1996. 
94. 
Tsansheng 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 397406, 1996. 
95. 
T.s. Hsu, Tech. Rep., "Undirected VertexConnectivity Structure and SmallestFourVertexConnectivity Augmentation," number TRIIS95002 (45 pages), Institute of Information ScienceAcademia Sinica Nankang Taipei Taiwan ROC 1995. 
96. 
Tsansheng 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 106112, 1995. 
97. 
Tsansheng Hsu and Vijaya Ramachandran, "Efficient Implementation of Virtual Processing for Some Combinatorial Algorithms on the MasPar MP1," Proc. 7th IEEE Symp. Parallel and Distributed Processing (ISPDP), pages 154159, 1995. 
98. 
Tsansheng Hsu, "Undirected VertexConnectivity Structure and Smallest FourVertexConnectivity Augmentation (Extended Abstract)," 6th International Symp. on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, 1004, pages 274283, 1995. 
99. 
Tsansheng 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 106112, 1995. 
100. 
Tsansheng 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 165198, 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, SpringerVerlag, pages 326335, 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 FourConnecting a Triconnected Graph(Extended Abstract)," IEEE Symposium on Foundations of Computer Science, pages 7079, 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 548559, 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 889912, January 1991. 
109. 
Tsansheng Hsu, ShunShii Lin, and ShunChin Hsu, "Some Studies in the Game of OTHELLO," National Computer Symp. (NCS), pages 596604, Taiwan, Republic of China, January 1987. 











