Split Decomposition of Undirected Graphs. - Tze-Heng Ma; Jeremy P. Spinrad (SODA, 1990)

Avoiding Matrix Multiplication. - Tze-Heng Ma; Jeremy P. Spinrad (WG, 1990)

Substitution Decomposition on Chordal Graphs and Applications. - Wen-Lian Hsu; Tze-Heng Ma (ISA, 1991)

An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. - Tze-Heng Ma; Jeremy P. Spinrad (SODA, 1991)

Algorithms for Rectilinear Optimal Multicast Tree Problem. - Jan-Ming Ho; Ming-Tat Ko; Tze-Heng Ma; Ting-Yi Sung (ISAAC, 1992)

An O(n²) Algorithm for Undirected Split Decompositon. - Tze-Heng Ma; Jeremy P. Spinrad (J. Algorithms, 1994)

On the 2-Chain Subgraph Cover and Related Problems. - Tze-Heng Ma; Jeremy P. Spinrad (J. Algorithms, 1994)

A finiteness theorem for maximal independent sets. - Min-Jen Jou; Gerard J. Chang; Chiang Lin; Tze-Heng Ma (Graphs Comb., 1996)

On the Complexity of the k-Chain Subgraph Cover Problem. - Chang-Wu Yu 001; Gen-Huey Chen; Tze-Heng Ma (Theor. Comput. Sci., 1998)

Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs. - Wen-Lian Hsu; Tze-Heng Ma (SIAM J. Comput., 1999)