Tze-Heng Ma

According to our database, Tze-Heng Ma authored at least 10 papers between 1990 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1999

Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs.

Wen-Lian Hsu, Tze-Heng Ma

SIAM J. Comput., 1999

1998

On the Complexity of the <i>k</i>-Chain Subgraph Cover Problem.

Chang-Wu Yu, Gen-Huey Chen, Tze-Heng Ma

Theor. Comput. Sci., 1998

1996

A finiteness theorem for maximal independent sets.

Min-Jen Jou, Gerard J. Chang, Chiang Lin, Tze-Heng Ma

Graphs Comb., 1996

1994

On the 2-Chain Subgraph Cover and Related Problems.

Tze-Heng Ma, Jeremy P. Spinrad

J. Algorithms, 1994

An O(n²) Algorithm for Undirected Split Decompositon.

Tze-Heng Ma, Jeremy P. Spinrad

J. Algorithms, 1994

1992

Algorithms for Rectilinear Optimal Multicast Tree Problem.

Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

An O(n²) Time Algorithm for the 2-Chain Cover Problem and Related Problems.

Tze-Heng Ma, Jeremy P. Spinrad

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Substitution Decomposition on Chordal Graphs and Applications.

Wen-Lian Hsu, Tze-Heng Ma

Proceedings of the ISA '91 Algorithms, 1991

1990

Avoiding Matrix Multiplication.

Tze-Heng Ma, Jeremy P. Spinrad

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

Split Decomposition of Undirected Graphs.

Tze-Heng Ma, Jeremy P. Spinrad

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990