Finding Connected Components in O(log n log log n) Time on the EREW PRAM. - Ka Wong Chong; Tak Wah Lam (J. Algorithms, 1995)

Towards More Precise Parallel Biconnectivity Approximation. - Ka Wong Chong; Tak Wah Lam (ISAAC, 1996)

Improving Biconnectivity Approximation via Local Optimization. - Ka Wong Chong; Tak Wah Lam (SODA, 1996)

Improved algorithms for some classical graph problems - Ka Wong Chong (1996)

Improved Deterministic Parallel Padded Sorting. - Ka Wong Chong; Edgar A. Ramos (ESA, 1998)

Approximating Biconnectivity in Parallel. - Ka Wong Chong; Tak Wah Lam (Algorithmica, 1998)

Improving Parallel Computation with Fast Integer Sorting. - Ka Wong Chong; Yijie Han; Yoshihide Igarashi; Tak Wah Lam (COCOON, 1999)

On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. - Ka Wong Chong; Yijie Han; Tak Wah Lam (SODA, 1999)

Concurrent threads and optimal parallel minimum spanning trees algorithm. - Ka Wong Chong; Yijie Han; Tak Wah Lam (J. ACM, 2001)

Improving the efficiency of parallel minimum spanning tree algorithms. - Ka Wong Chong; Yijie Han; Yoshihide Igarashi; Tak Wah Lam (Discret. Appl. Math., 2003)

An Optimal Parallel Co-Connectivity Algorithm. - Ka Wong Chong; Stavros D. Nikolopoulos; Leonidas Palios (Theory Comput. Syst., 2004)

An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs. - Ka Wong Chong; Christos D. Zaroliagis (Algorithms, Probability, Networks, and Games, 2015)