2008 | ||
---|---|---|
59 | EE | Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu: Knowledge Inferencing on Chinese Chess Endgames. Computers and Games 2008: 180-191 |
2007 | ||
58 | EE | Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei Kuan Shih, Tsan-sheng Hsu: Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract). AAIM 2007: 153-166 |
57 | EE | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: An epistemic framework for privacy protection in database linking. Data Knowl. Eng. 61(1): 176-205 (2007) |
56 | EE | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Granulation as a Privacy Protection Mechanism. T. Rough Sets 7: 256-273 (2007) |
2006 | ||
55 | H. Jaap van den Herik, Shun-chin Hsu, Tsan-sheng Hsu, H. H. L. M. Donkers: Advances in Computer Games, 11th International Conference, ACG 2005, Taipei, Taiwan, September 6-9, 2005. Revised Papers Springer 2006 | |
54 | EE | Kuang-che Wu, Shun-chin Hsu, Tsan-sheng Hsu: The Graph-History Interaction Problem in Chinese Chess. ACG 2006: 165-179 |
53 | EE | Bo-Nian Chen, Pangfeng Liu, Shun-chin Hsu, Tsan-sheng Hsu: Abstracting Knowledge from Annotated Chinese-Chess Game Records. Computers and Games 2006: 100-111 |
52 | EE | Da-Wei Wang, Churn-Jung Liau, Yi-Ting Chiang, Tsan-sheng Hsu: Information Theoretical Analysis of Two-Party Secret Computation. DBSec 2006: 310-317 |
51 | EE | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: A GrC-Based Approach to Social Network Data Protection. RSCTC 2006: 438-447 |
50 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: The Hamiltonian problem on distance-hereditary graphs. Discrete Applied Mathematics 154(3): 508-524 (2006) |
49 | EE | Cho-chin Lin, Da-Wei Wang, Tsan-sheng Hsu: Bounds on the Client-Server Incremental Computing. IEICE Transactions 89-A(5): 1198-1206 (2006) |
48 | EE | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu, Jeremy K.-P. Chen: Value versus damage of information release: A data privacy perspective. Int. J. Approx. Reasoning 43(2): 179-201 (2006) |
2005 | ||
47 | EE | Yi-Ting Chiang, Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Secrecy of Two-Party Secure Computation. DBSec 2005: 114-123 |
46 | EE | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee: Two Variations of the Minimum Steiner Problem. J. Comb. Optim. 9(1): 101-120 (2005) |
45 | EE | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. SIAM J. Discrete Math. 19(2): 345-362 (2005) |
2004 | ||
44 | EE | Ping-hsun Wu, Ping-Yi Liu, Tsan-sheng Hsu: An External-Memory Retrograde Analysis Algorithm. Computers and Games 2004: 145-160 |
43 | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu, Jeremy K.-P. Chen: On The Damage and Compensation of Privacy Leakage. DBSec 2004: 311-324 | |
42 | EE | Cho-chin Lin, Tsan-sheng Hsu, Da-Wei Wang: Bounds on the Client-Server Incremental Computing. ISPAN 2004: 86-91 |
41 | EE | Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu: Medical privacy protection based on granular computing. Artificial Intelligence in Medicine 32(2): 137-149 (2004) |
40 | Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu: Checking Indefinitely in Chinese Chess Endgames. ICGA Journal 27(1): 19-37 (2004) | |
2003 | ||
39 | EE | Yaw-Ling Lin, Tsan-sheng Hsu: Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome. ISAAC 2003: 339-351 |
2002 | ||
38 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. COCOON 2002: 77-86 |
37 | EE | Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu: Indefinite Sequence of Moves in Chinese Chess Endgames. Computers and Games 2002: 264-279 |
36 | EE | Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang, Jeremy K.-P. Chen: Quantifying Privacy Leakage through Answering Database Queries. ISC 2002: 162-176 |
35 | EE | Yi-Ting Chiang, Yu-Cheng Chiang, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: How Much Privacy? - A System to Safe Guard Personal Privacy while Releasing Databases. Rough Sets and Current Trends in Computing 2002: 226-233 |
34 | EE | Tsan-sheng Hsu: Simpler and faster biconnectivity augmentation. J. Algorithms 45(1): 55-71 (2002) |
33 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs. SIAM J. Discrete Math. 15(4): 488-518 (2002) |
2001 | ||
32 | EE | Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang: A Logical Model for Privacy Protection. ISC 2001: 110-124 |
31 | EE | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time CoRR cs.DS/0102009: (2001) |
2000 | ||
30 | EE | Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu: Construction of Chinese Chess Endgame Databases by Retrograde Analysis. Computers and Games 2000: 96-114 |
29 | Tsan-sheng Hsu: Simpler and Faster Vertex-Connectivity Augmentation Algorithms. ESA 2000: 278-289 | |
28 | EE | Sheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu: Graph Searching on Some Subclasses of Chordal Graphs. Algorithmica 27(3): 395-426 (2000) |
27 | EE | Tsan-sheng Hsu, Joseph C. Lee, Dian Rae Lopez, William A. Royce: Task Allocation on a Network of Processors. IEEE Trans. Computers 49(12): 1339-1353 (2000) |
26 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. J. Algorithms 35(1): 50-81 (2000) | |
25 | Tsan-sheng Hsu: On Four-Connecting a Triconnected Graph. J. Algorithms 35(2): 202-234 (2000) | |
24 | EE | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and node searching problems on trees. Theor. Comput. Sci. 240(2): 429-446 (2000) |
23 | EE | Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan: A multi-tree routing scheme using acyclic orientations. Theor. Comput. Sci. 240(2): 487-494 (2000) |
1999 | ||
22 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Efficient Parallel Algorithms on Distance Hereditary Graphs. Parallel Processing Letters 9(1): 43-52 (1999) | |
1998 | ||
21 | EE | Tsan-sheng Hsu, Dian Rae Lopez: Executing Divisible Jobs on a Network with a Fixed Number of Processors. COCOON 1998: 241-250 |
20 | EE | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. COCOON 1998: 279-288 |
19 | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. IRREGULAR 1998: 298-309 | |
18 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. ISAAC 1998: 257-266 |
17 | Tsan-sheng Hsu, Ming-Yang Kao: A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. J. Comb. Optim. 2(3): 237-256 (1998) | |
1997 | ||
16 | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and Node Searching Problems on Trees. COCOON 1997: 284-293 | |
15 | EE | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko: . Efficient Parallel Algorithms on Distance-Hereditary Graphs. ICPP 1997: 20- |
14 | EE | Tsan-sheng Hsu, Ming-Yang Kao: Security Problems for Statistical Databases with General Cell Suppressions. SSDBM 1997: 155-164 |
13 | Lisa Hollermann, Tsan-sheng Hsu, Dian Rae Lopez, Keith Vertanen: Scheduling Problems in a Practical Allocation Model. J. Comb. Optim. 1(2): 129-149 (1997) | |
1996 | ||
12 | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. COCOON 1996: 169-178 | |
11 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee: Steiner Problems on Directed Acyclic Graphs. COCOON 1996: 21-30 | |
10 | Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan Yi Tang: Graph Searching on Chordal Graphs. ISAAC 1996: 156-165 | |
9 | Tsan-sheng Hsu, Ming-Yang Kao: Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract). ISAAC 1996: 213-222 | |
8 | Tsan-sheng Hsu, Dian Rae Lopez: Bounds and Algorithms for a Practical Task Allocation Model (Extended Abstract). ISAAC 1996: 397-406 | |
7 | EE | Tsan-sheng Hsu, Vijaya Ramachandran: Efficient Massively Parallel Implementation of some Combinatorial Algorithms. Theor. Comput. Sci. 162(2): 297-322 (1996) |
1995 | ||
6 | EE | Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean: Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS 1995: 106-112 |
5 | Tsan-sheng Hsu: Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation. ISAAC 1995: 274-283 | |
1993 | ||
4 | Tsan-sheng Hsu, Vijaya Ramachandran: Finding a Smallest Augmentation to Biconnect a Graph. SIAM J. Comput. 22(5): 889-912 (1993) | |
1992 | ||
3 | Tsan-sheng Hsu: On Four-Connecting a Triconnected Graph (Extended Abstract) FOCS 1992: 70-79 | |
1991 | ||
2 | Tsan-sheng Hsu, Vijaya Ramachandran: A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract) FOCS 1991: 548-559 | |
1 | Tsan-sheng Hsu, Vijaya Ramachandran: On Finding a Smallest Augmentation to Biconnect a Graph. ISA 1991: 326-335 |