Ting-Yem Ho

According to our database, Ting-Yem Ho authored at least 7 papers between 1996 and 2008.

Collaborative distances:

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

2008

The rook problem on saw-toothed chessboards.

Hon-Chan Chen, Ting-Yem Ho

Appl. Math. Lett., 2008

2005

An efficient distributed algorithm for finding all hinge vertices in networks.

Ting-Yem Ho, Jou-Ming Chang

Int. J. Comput. Math., 2005

2004

The tree longest detour problem in a biconnected graph.

Fu-Long Yeh, Shyue-Ming Tang, Yue-Li Wang, Ting-Yem Ho

Eur. J. Oper. Res., 2004

2003

Sorting a sequence of strong kings in a tournament.

Ting-Yem Ho, Jou-Ming Chang

Inf. Process. Lett., 2003

2000

On the powers of graphs with bounded asteroidal number.

Ting-Yem Ho, Jou-Ming Chang, Yue-Li Wang

Discret. Math., 2000

1997

Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time.

Jou-Ming Chang, Chiun-Chieh Hsu, Yue-Li Wang, Ting-Yem Ho

Inf. Sci., 1997

1996

A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph.

Ting-Yem Ho, Yue-Li Wang, Ming-Tsan Juan

Inf. Process. Lett., 1996