2007 | ||
---|---|---|
18 | EE | Abusayeed M. Saifullah, Yung H. Tsin: A Self-stabilizing Algorithm For 3-Edge-Connectivity. ISPA 2007: 6-19 |
17 | EE | Yung H. Tsin: An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity. Inf. Process. Lett. 102(1): 27-34 (2007) |
16 | EE | Yung H. Tsin: A Simple 3-Edge-Connected Component Algorithm. Theory Comput. Syst. 40(2): 125-142 (2007) |
2006 | ||
15 | EE | Yung H. Tsin: An Efficient Distributed Algorithm for 3-edge-connectivity. Int. J. Found. Comput. Sci. 17(3): 677-702 (2006) |
2004 | ||
14 | Yung H. Tsin: An Efficient Distributed Algorithm for Ear Decomposition. MSV/AMCS 2004: 413-418 | |
13 | EE | Yung H. Tsin: On finding an ear decomposition of an undirected graph distributively. Inf. Process. Lett. 91(3): 147-153 (2004) |
2002 | ||
12 | EE | Yung H. Tsin: Some remarks on distributed depth-first search. Inf. Process. Lett. 82(4): 173-178 (2002) |
1998 | ||
11 | Cao An Wang, Yung H. Tsin: Finding constrained and weighted Voronoi diagrams in the plane. Comput. Geom. 10(2): 89-104 (1998) | |
1996 | ||
10 | Yung H. Tsin, Cao An Wang: Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers. Nord. J. Comput. 3(1): 1-26 (1996) | |
1993 | ||
9 | Yung H. Tsin: Incremental Distributed Asynchronous Algorithm for Minimum Spanning Trees. Computer Networks and ISDN Systems 26(2): 227-232 (1993) | |
1988 | ||
8 | Yung H. Tsin: On Handling Vertex Deletion in Updating Spanning Trees. Inf. Process. Lett. 27(4): 167-168 (1988) | |
1987 | ||
7 | Cao An Wang, Yung H. Tsin: An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane. Inf. Process. Lett. 25(1): 55-60 (1987) | |
1986 | ||
6 | Yung H. Tsin: Finding Lowest Common Ancestors in Parallel. IEEE Trans. Computers 35(8): 764-769 (1986) | |
1985 | ||
5 | Yung H. Tsin: An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph. Inf. Process. Lett. 20(3): 143-146 (1985) | |
1984 | ||
4 | Yung H. Tsin, Francis Y. L. Chin: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems. SIAM J. Comput. 13(3): 580-599 (1984) | |
1983 | ||
3 | Yung H. Tsin: Bridge-Connectivity and Biconnectivity Algorithms for Parallel Computer Models. ICPP 1983: 180-182 | |
2 | Yung H. Tsin, Francis Y. L. Chin: A General Program Scheme for Finding Bridges. Inf. Process. Lett. 17(5): 269-272 (1983) | |
1982 | ||
1 | Yung H. Tsin: Extending the Power of Pascal's External Procedure Mechanism. Softw., Pract. Exper. 12(3): 283-292 (1982) |
1 | Francis Y. L. Chin | [2] [4] |
2 | Abusayeed M. Saifullah | [18] |
3 | Cao An Wang | [7] [10] [11] |