| 2008 |
|---|
| 7 | EE | Hon-Chan Chen,
Ting-Yem Ho:
The rook problem on saw-toothed chessboards.
Appl. Math. Lett. 21(12): 1234-1237 (2008) |
| 2005 |
|---|
| 6 | EE | Ting-Yem Ho,
Jou-Ming Chang:
An efficient distributed algorithm for finding all hinge vertices in networks.
Int. J. Comput. Math. 82(7): 821-825 (2005) |
| 2004 |
|---|
| 5 | EE | Fu-Long Yeh,
Shyue-Ming Tang,
Yue-Li Wang,
Ting-Yem Ho:
The tree longest detour problem in a biconnected graph.
European Journal of Operational Research 155(3): 631-637 (2004) |
| 2003 |
|---|
| 4 | EE | Ting-Yem Ho,
Jou-Ming Chang:
Sorting a sequence of strong kings in a tournament.
Inf. Process. Lett. 87(6): 317-320 (2003) |
| 2000 |
|---|
| 3 | EE | Ting-Yem Ho,
Jou-Ming Chang,
Yue-Li Wang:
On the powers of graphs with bounded asteroidal number.
Discrete Mathematics 223(1-3): 125-133 (2000) |
| 1997 |
|---|
| 2 | | 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.
Inf. Sci. 99(3-4): 173-182 (1997) |
| 1996 |
|---|
| 1 | EE | Ting-Yem Ho,
Yue-Li Wang,
Ming-Tsan Juan:
A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph.
Inf. Process. Lett. 59(2): 103-107 (1996) |
