Efficient parallel algorithms for a class of graph theoretic problems YH Tsin, FY Chin SIAM Journal on Computing 13 (3), 580-599, 1984 | 117 | 1984 |
Yet another optimal algorithm for 3-edge-connectivity YH Tsin Journal of Discrete Algorithms 7 (1), 130-146, 2009 | 62 | 2009 |
A simple 3-edge-connected component algorithm YH Tsin Theory of Computing Systems 40 (2), 125-142, 2007 | 40 | 2007 |
An O (log n) time parallel algorithm for triangulating a set of points in the plane CA Wang, YH Tsin Information Processing Letters 25 (1), 55-60, 1987 | 37 | 1987 |
On handling vertex deletion in updating spanning trees YH Tsin Information Processing Letters 27 (4), 167-168, 1988 | 27 | 1988 |
Some remarks on distributed depth-first search YH Tsin Information Processing Letters 82 (4), 173-178, 2002 | 26 | 2002 |
Improved online algorithms for 1-space bounded 2-dimensional bin packing Y Zhang, J Chen, FYL Chin, X Han, HF Ting, YH Tsin Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010 | 19 | 2010 |
Efficient estimation of triangles in very large graphs R Etemadi, J Lu, YH Tsin Proceedings of the 25th ACM International on Conference on Information and …, 2016 | 18 | 2016 |
Finding constrained and weighted Voronoi diagrams in the plane CA Wang, YH Tsin Computational Geometry 10 (2), 89-104, 1998 | 17 | 1998 |
A general program scheme for finding bridges YH Tsin, FY Chin Information processing letters 17 (5), 269-272, 1983 | 16 | 1983 |
Finding lowest common ancestors in parallel Tsin IEEE transactions on computers 100 (8), 764-769, 1986 | 13 | 1986 |
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing Y Zhang, FYL Chin, HF Ting, X Han, CK Poon, YH Tsin, D Ye Theoretical Computer Science 554, 135-149, 2014 | 11 | 2014 |
A Simple Algorithm for Finding All k-Edge-Connected Components T Wang, Y Zhang, FYL Chin, HF Ting, YH Tsin, SH Poon Plos one 10 (9), e0136264, 2015 | 10 | 2015 |
An efficient distributed algorithm for 3-edge-connectivity YH Tsin International Journal of Foundations of Computer Science 17 (03), 677-701, 2006 | 10 | 2006 |
On finding an ear decomposition of an undirected graph distributively YH Tsin Information processing letters 91 (3), 147-153, 2004 | 10 | 2004 |
A self-stabilizing algorithm for 3-edge-connectivity AM Saifullah, YH Tsin Parallel and Distributed Processing and Applications: 5th International …, 2007 | 9 | 2007 |
Uniformly inserting points on square grid Y Zhang, Z Chang, FYL Chin, HF Ting, YH Tsin Information processing letters 111 (16), 773-779, 2011 | 8 | 2011 |
Decomposing a Multigraph into Split Components. YH Tsin CATS, 3-12, 2012 | 6 | 2012 |
A self-stabilising algorithm for 3-edge-connectivity AM Saifullah, YH Tsin International Journal of High Performance Computing and Networking 7 (1), 40-52, 2011 | 6 | 2011 |
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity YH Tsin Information processing letters 102 (1), 27-34, 2007 | 6 | 2007 |