 | 1999 |
|---|
| 10 |       | Wen-Lian Hsu,
Tze-Heng Ma:
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs.
SIAM J. Comput. 28(3): 1004-1020 (1999) |
| 1998 |
|---|
| 9 | | Chang-Wu Yu,
Gen-Huey Chen,
Tze-Heng Ma:
On the Complexity of the k-Chain Subgraph Cover Problem.
Theor. Comput. Sci. 205(1-2): 85-98 (1998) |
| 1996 |
|---|
| 8 | | Min-Jen Jou,
Gerard J. Chang,
Chiang Lin,
Tze-Heng Ma:
A finiteness theorem for maximal independent sets.
Graphs and Combinatorics 12(1): 321-326 (1996) |
| 1994 |
|---|
| 7 | | Tze-Heng Ma,
Jeremy Spinrad:
An O(n²) Algorithm for Undirected Split Decompositon.
J. Algorithms 16(1): 154-160 (1994) |
| 6 | | Tze-Heng Ma,
Jeremy Spinrad:
On the 2-Chain Subgraph Cover and Related Problems.
J. Algorithms 17(2): 251-268 (1994) |
| 1992 |
|---|
| 5 | | Jan-Ming Ho,
Ming-Tat Ko,
Tze-Heng Ma,
Ting-Yi Sung:
Algorithms for Rectilinear Optimal Multicast Tree Problem.
ISAAC 1992: 106-115 |
| 1991 |
|---|
| 4 | | Wen-Lian Hsu,
Tze-Heng Ma:
Substitution Decomposition on Chordal Graphs and Applications.
ISA 1991: 52-60 |
| 3 | | Tze-Heng Ma,
Jeremy Spinrad:
An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems.
SODA 1991: 363-372 |
| 1990 |
|---|
| 2 | | Tze-Heng Ma,
Jeremy Spinrad:
Split Decomposition of Undirected Graphs.
SODA 1990: 252-260 |
| 1 | | Tze-Heng Ma,
Jeremy Spinrad:
Avoiding Matrix Multiplication.
WG 1990: 61-71 |
Data released under the ODC-BY 1.0 license — See also our legal information page