Selected Publications --- Tsan-sheng Hsu

• (A) Edited Volumes
• (B) Selected Journal Articles
• (C) Selected Proceedings Articles
• (D) Selected Journal Articles with Students
• (E) Selected Proceedings Articles with Students

• Proc. 11th Advances in Computer Games Conference (ACG), 2005,

  edited by H. Jaap van den Herik, Shun-Chin Hsu, Tsan-sheng Hsu and H.H.L.M. Donkers,

  Springer-Verlag, Lecture Notes in Computer Science (LNCS) volume 4250, December 2006.

• I-Cheng Wang, Chih-Hao Shen, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang and Justin Zhan, "Towards Empirical Aspects of Secure Scalar Product," IEEE Transactions on Systems, Man, and Cybernetics, 2008, accepted.

• Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "Granulation as a Privacy Protection Mechanism," LNCS Transactions on Rough Sets VII, pages 256--273, 2007. (LNCS # 4400 Journal Subline)

  Extended abstract of early ideas in

  • Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "Attribute-Oriented Granulation for Privacy Protection," Proc. 2006 IEEE International Conference on Granular Computing, pages 726--731, 2006.

• Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "An Epistemic Framework for Privacy Protection in Database Linking," Data and Knowledge Engineering, pages 176--205, 2007.

  Extended abstract of early ideas in

  • Tsan-sheng Hsu, Churn-Jung Liau and Da-Wai Wang, "A Logical Model for Privacy Protection," Proc. 4th Information Security Conference (ISC), Springer-Verlag LNCS# 2200, pages 110--124, 2001.

• Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu, and Jeremy K.-P. Chen, "Value and Damage of Information: A Data Security Perspective," International Journal of Approximate Reasoning, pages 179--201, 2006.

  Extended abstracts in

  • Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu and Jeremy K.-P. Chen, "On The Damage and Compensation of Privacy Leakage," Proc. 18th Annual IFIP WG 11.3 Working Conference on Data and Applications Security , pages 311--324, 2004.
  • Tsan-sheng Hsu, Churn-Jung Liau, Da-Wai Wang and Jeremy K.-P. Chen, "Quantifying Privacy Leakage Through Answering Database Queries," Proc. 5th Information Security Conference (ISC), Springer-Verlag LNCS# 2433, pages 162--175, 2002.

• Cho-chin Lin, Da-Wei Wang and Tsan-sheng Hsu, "Bounds on the Client-Server Incremental Computing," IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, volume E89-A, number 5, pages 1198--1206, 2006.

  Extended abstract in Proc. 7th International Symp. on Parallel Architectures, Algorithms, and Networks (I-SPAN), pages 86--91, 2004.

• 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, 2005.

  Extended abstract in Proc. 7th International Symp. on Algorithms and Computation (ISAAC), Springer-Verlag LNCS# 1178, pages 213--222, 1996.

• Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang and D.T. Lee, "Two Variations of the Minimum Steiner Problem," Journal of Combinatorial Optimization, volume 9, pages 101--120, 2005.

  Extended abstract in Proc. 2nd International Computing and Combinatorics Conf. (COCOON), Springer-Verlag LNCS# 1090, pages 21--30, 1996, under the title "Steiner Problems on Directed Acyclic Graphs."

• Da-Wei Wang, Churn-Jung Liau and Tsan-sheng Hsu, "Medical Privacy Protection Based on Granular Computing," Artificial Intelligence in Medicine (AIM), volume 32, number 2, pages 137--149, 2004.

  A preliminary extended abstract appeared in Yi-Ting Chiang, Yu-cheng Chiang, Tsan-sheng Hsu, Churn-Jung Liau and Da-Wai Wang, "How Much Privacy? --- A System to Safe Guard Personal Privacy While Releasing Databases," Proceedings of the 3rd International Conference on Rough Sets and Current Trends in Computing (RSCTC), Springer-Verlag LNCS/AI# 2475, Pages 226--233, 2002.

• Tsan-sheng Hsu and Ping-Yi Liu, "Verification of Endgame Databases," International Computer Game Association (ICGA) Journal, volume 25, number 3, pages 132--144, 2002.

• Tsan-sheng Hsu, "Simpler and Faster Biconnectivity Augmentation," Journal of Algorithms, volume 45, number 1, pages 55--71, 2002.

• 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.

  Extended abstract of early ideas in

  • Tsan-sheng Hsu and Dian Rae Lopez, "Executing Divisible Jobs on a Network with a Fixed Number of Processors (Extended Abstract)," Proc. 4th International Computing and Combinatorics Conf. (COCOON), Springer-Verlag LNCS# 1449, pages 241--250, 1998.

• 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.

• Tsan-sheng 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.

• Tsan-sheng Hsu and Ming-Yang Kao, "A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity," Journal of Combinatorial Optimization, volume 2, pages 237--256, 1998.

  Extended abstract in Proc. 2nd International Computing and Combinatorics Conf. (COCOON) , volume LNCS# 1090, pages 169--178. Springer-Verlag, 1996, under the title "Optimal Bi-Level Augmentation for Selectively Enhancing Graph Connectivity with Applications."

• Lisa Hollermann, Tsan-sheng Hsu, Dian Rae Lopez, and Keith Vertanen, "Scheduling Problems in a Practical Allocation Model," Journal of Combinatorial Optimization, volume 1, number 2, Pages 129--149, 1997.

  Extended abstract of early ideas in

  • Tsan-sheng Hsu and Dian Rae Lopez, "Bounds and Algorithms for a Practical Task Allocation Model," Proc. 7th International Symp. on Algorithms and Computation (ISAAC), Springer-Verlag LNCS# 1178, pages 397--406, 1996.

• 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, American Mathematical Society, 1997.

• Tsan-sheng Hsu and Vijaya Ramachandran, "Efficient Massively Parallel Implementation of Some Combinatorial Algorithms," Theoretical Computer Science, volume 162, pages 297--322, 1996.

  Extended abstract in Proc. 7th IEEE Symp. Parallel and Distributed Processing (ISPDP), pages 154--159, 1995, under the title "Efficient Implementation of Virtual Processing for Some Combinatorial Algorithms on the MasPar MP-1."

• 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. American Mathematical Society, 1994.

• Tsan-sheng Hsu and Vijaya Ramachandran, "On Finding a Smallest Augmentation to Biconnect a Graph," SIAM J. on Computing, Vol. 22, pages 889--912, 1993.

  Extended abstract in Proc. 2nd International Symp. on Algorithms, Springer-Verlag LNCS# 557, pages 326--335, 1991.

• Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "Logical Definability in Social Position Analysis", Proc. 2008 IEEE International Conference on Granular Computing, 2008, to appear.

• Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "A GrC-based Approach to Social Network Data Protection," Proc. 5th International Conference on Rough Sets and Current Trends in Computing Springer-Verlag LNCS/AI# 4259, pages 438--447, 2006.

• Da-Wei Wang, Churn-Jung Liau, Yi-Ting Chiang, and Tsan-sheng Hsu, "Information Theoretical Analysis of Two-Party Secret Computation," Proc. 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Springer-Verlag LNCS# 4127, pages 310--317, 2006.

• Da-Wei Wang, Churn-Jung Liau, and Tsan-sheng Hsu, "Privacy Protection in Social Network Data Disclosure Based On Granular Computing," Proc. 2006 IEEE International Conference on Fuzzy Systems, pages 5485--5491, 2006.

• 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 Applications Security, Springer-Verlag LNCS# 3654, pages 114--123, 2005.

• 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), Springer-Verlag LNCS# 3846, pages 145--160, 2004.

• Tsan-sheng Hsu, "Simpler and Faster Vertex-Connectivity Augmentation Algorithms (Extended Abstract)," Proc. 8th European Symp. on Algorithms (ESA), Springer-Verlag LNCS# 1879, pages 278--289, 2000.

• Tsan-sheng Hsu and Ming-Yang Kao, "Security Problems for Statistical Databases with General Cell Suppressions," Proc. 9th International Conference on Scientific and Statistical Database Management (SSDBM), pages 155--164, 1997.

• Tsan-sheng Hsu, "Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation (Extended Abstract)," Proc. 6th International Symp. on Algorithms and Computation (ISAAC), Springer-Verlag LNCS# 1004, pages 274--283, 1995.

• 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.

• Tsan-sheng Hsu and Vijaya Ramachandran, "A Linear Time Algorithm for Triconnectivity Augmentation," Proc. 32th Annual IEEE Conf. on Foundations of Computer Science (FOCS), pages 548--559, 1991.

• Tsan-sheng Hsu, Shun-Shii Lin, and Shun-Chin Hsu, "Some Studies in the Game of OTHELLO," Proc. of National Computer Symp. (NCS), Taiwan, Republic of China, pp. 596--604, 1987.

• Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih and Hsan-sheng Hsu, "Smallest Bipartite Bridge-connectivity Augmentation," Algorithmica, 2007, to appear.

  Extended abstract in Proc. 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), Springer-Verlag LNCS# 4508, pages 153--166, 2007.

• 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.

  Extended abstract in Proceedings of the 8th International Computing and Combinatorics Conference (COCOON), Springer-Verlag LNCS# 2387, Pages 67--76, 2002, under the title "Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs."

• 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.

  Extended abstract in Proc. Asia Pacific Medical Informatics Conference (APAMI-MIC), 2000, under the title "Preserving Confidentially When Sharing Medical Data."

• 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.

  Extended abstract in Proc. 8th International Symp. on Algorithms and Computation (ISAAC), Springer-Verlag LNCS# 1533, pages 257--266, 1998, under the title "Characterization of Efficiently Computable Problems on Distance-Hereditary Graphs."

• 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.

  Extended abstract in Proc. 3rd International Computing and Combinatorics Conf. (COCOON), Springer-Verlag LNCS# 1276, pages 284--293, 1997.

• 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, 2000.

  Extended abstract in Proc. 7th International Symp. on Algorithms and Computation (ISAAC), Springer-Verlag LNCS# 1178, pages 156--165, 1996, under the title "Graph Searching on Chordal Graphs."

• 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," Journal of Algorithms, volume 35, pages 50--81, 2000.

  Extended abstract in Proc. 5th International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRR), Springer-Verlag LNCS# 1457, pages 298--309, 1998.

• 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, 1999.

  Extended abstract in Proc. International Conference on Parallel Processing (ICPP), pages 20--23, 1997.

• 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), 2008, to appear.

• 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.

• 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), Springer-Verlag LNCS# 4250, pages 165--179, 2005.

• 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," Proc. 4th International Computing and Combinatorics Conf. (COCOON), Springer-Verlag LNCS# 1449, pages 279--288, 1998.