The SCEAS System
Navigation Menu

Search the dblp DataBase


Tze-Heng Ma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wen-Lian Hsu, Tze-Heng Ma
    Substitution Decomposition on Chordal Graphs and Applications. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:52-60 [Conf]
  2. Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung
    Algorithms for Rectilinear Optimal Multicast Tree Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:106-115 [Conf]
  3. Tze-Heng Ma, Jeremy Spinrad
    Split Decomposition of Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:252-260 [Conf]
  4. Tze-Heng Ma, Jeremy Spinrad
    An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:363-372 [Conf]
  5. Tze-Heng Ma, Jeremy Spinrad
    Avoiding Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:61-71 [Conf]
  6. Tze-Heng Ma, Jeremy Spinrad
    An O(n²) Algorithm for Undirected Split Decompositon. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:1, pp:154-160 [Journal]
  7. Tze-Heng Ma, Jeremy Spinrad
    On the 2-Chain Subgraph Cover and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:251-268 [Journal]
  8. Wen-Lian Hsu, Tze-Heng Ma
    Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:3, pp:1004-1020 [Journal]
  9. Chang-Wu Yu, Gen-Huey Chen, Tze-Heng Ma
    On the Complexity of the k-Chain Subgraph Cover Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:85-98 [Journal]

Search in 0.006secs, Finished in 0.006secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002