Extending the Power of Pascal's External Procedure Mechanism. - Yung H. Tsin (Softw. Pract. Exp., 1982)

Bridge-Connectivity and Biconnectivity Algorithms for Parallel Computer Models. - Yung H. Tsin (ICPP, 1983)

A General Program Scheme for Finding Bridges. - Yung H. Tsin; Francis Y. L. Chin (Inf. Process. Lett., 1983)

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems. - Yung H. Tsin; Francis Y. L. Chin (SIAM J. Comput., 1984)

An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph. - Yung H. Tsin (Inf. Process. Lett., 1985)

Finding Lowest Common Ancestors in Parallel. - Yung H. Tsin (IEEE Trans. Computers, 1986)

An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane. - Cao An Wang; Yung H. Tsin (Inf. Process. Lett., 1987)

On Handling Vertex Deletion in Updating Spanning Trees. - Yung H. Tsin (Inf. Process. Lett., 1988)

Incremental Distributed Asynchronous Algorithm for Minimum Spanning Trees. - Yung H. Tsin (Comput. Networks ISDN Syst., 1993)

Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers. - Yung H. Tsin; Cao An Wang (Nord. J. Comput., 1996)

Finding constrained and weighted Voronoi diagrams in the plane. - Cao An Wang; Yung H. Tsin (Comput. Geom., 1998)

Some remarks on distributed depth-first search. - Yung H. Tsin (Inf. Process. Lett., 2002)

An Efficient Distributed Algorithm for Ear Decomposition. - Yung H. Tsin (MSV/AMCS, 2004)

On finding an ear decomposition of an undirected graph distributively. - Yung H. Tsin (Inf. Process. Lett., 2004)

An Efficient Distributed Algorithm for 3-edge-connectivity. - Yung H. Tsin (Int. J. Found. Comput. Sci., 2006)

A Self-stabilizing Algorithm For 3-Edge-Connectivity. - Abusayeed M. Saifullah; Yung H. Tsin (ISPA, 2007)

An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity. - Yung H. Tsin (Inf. Process. Lett., 2007)

A Simple 3-Edge-Connected Component Algorithm. - Yung H. Tsin (Theory Comput. Syst., 2007)

Yet another optimal algorithm for 3-edge-connectivity. - Yung H. Tsin (J. Discrete Algorithms, 2009)

Online Uniformly Inserting Points on Grid. - Yong Zhang 001; Zhuo Chang; Francis Y. L. Chin; Hing-Fung Ting; Yung H. Tsin (AAIM, 2010)

Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing. - Yong Zhang 001; Jing-Chi Chen; Francis Y. L. Chin; Xin Han; Hing-Fung Ting; Yung H. Tsin (ISAAC (2), 2010)

Recognizing and Embedding Outerplanar Distributed Computer Networks. - Yung H. Tsin (CyberC, 2011)

Self-Stabilizing Computation of 3-Edge-Connected Components. - Abusayeed M. Saifullah; Yung H. Tsin (Int. J. Found. Comput. Sci., 2011)

A self-stabilising algorithm for 3-edge-connectivity. - Abusayeed M. Saifullah; Yung H. Tsin (Int. J. High Perform. Comput. Netw., 2011)

Uniformly inserting points on square grid. - Yong Zhang 001; Zhuo Chang; Francis Y. L. Chin; Hing-Fung Ting; Yung H. Tsin (Inf. Process. Lett., 2011)

Decomposing a Multigraph into Split Components. - Yung H. Tsin (CATS, 2012)

On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs. - Amr Elmasry; Yung H. Tsin (Int. J. Found. Comput. Sci., 2014)

A simple 3-edge connected component algorithm revisited. - Nima Norouzi; Yung H. Tsin (Inf. Process. Lett., 2014)

Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. - Yong Zhang 001; Francis Y. L. Chin; Hing-Fung Ting; Xin Han; Chung Keung Poon; Yung H. Tsin; Deshi Ye (Theor. Comput. Sci., 2014)

Efficient Estimation of Triangles in Very Large Graphs. - Roohollah Etemadi; Jianguo Lu; Yung H. Tsin (CIKM, 2016)

On finding 2-cuts and 3-edge-connected components in parallel. - Yung H. Tsin (CoRR, 2023)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs. - Yung H. Tsin (CoRR, 2023)

A linear-time certifying algorithm for recognizing generalized series-parallel graphs. - Francis Y. L. Chin; Hing-Fung Ting; Yung H. Tsin; Yong Zhang 001 (Discret. Appl. Math., 2023)

A simple certifying algorithm for 3-edge-connectivity. - Yung H. Tsin (Theor. Comput. Sci., 2023)