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)

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)

On the powers of graphs with bounded asteroidal number. - Ting-Yem Ho; Jou-Ming Chang; Yue-Li Wang (Discret. Math., 2000)

Sorting a sequence of strong kings in a tournament. - Ting-Yem Ho; Jou-Ming Chang (Inf. Process. Lett., 2003)

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)

An efficient distributed algorithm for finding all hinge vertices in networks. - Ting-Yem Ho; Jou-Ming Chang (Int. J. Comput. Math., 2005)

The rook problem on saw-toothed chessboards. - Hon-Chan Chen; Ting-Yem Ho (Appl. Math. Lett., 2008)