The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ting-Yem Ho: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ting-Yem Ho, Jou-Ming Chang, Yue-Li Wang
    On the powers of graphs with bounded asteroidal number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:223, n:1-3, pp:125-133 [Journal]
  2. Ting-Yem Ho, Jou-Ming Chang
    An efficient distributed algorithm for finding all hinge vertices in networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2005, v:82, n:7, pp:821-825 [Journal]
  3. Ting-Yem Ho, Jou-Ming Chang
    Sorting a sequence of strong kings in a tournament. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:6, pp:317-320 [Journal]
  4. Ting-Yem Ho, Yue-Li Wang, Ming-Tsan Juan
    A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:2, pp:103-107 [Journal]
  5. Jou-Ming Chang, Chiun-Chieh Hsu, Yue-Li Wang, Ting-Yem Ho
    Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1997, v:99, n:3-4, pp:173-182 [Journal]
  6. Fu-Long Yeh, Shyue-Ming Tang, Yue-Li Wang, Ting-Yem Ho
    The tree longest detour problem in a biconnected graph. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:155, n:3, pp:631-637 [Journal]

  7. The rook problem on saw-toothed chessboards. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002