 | 2008 |
| 11 |  | James Glenn,
Haw-ren Fang,
Clyde P. Kruskal:
A Retrograde Approximation Algorithm for Multi-player Can't Stop.
Computers and Games 2008: 252-263 |
| 10 |  | Sophia Sakellaridi,
Haw-ren Fang,
Yousef Saad:
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing.
ICMLA 2008: 194-200 |
| 9 |  | Haw-ren Fang,
Yousef Saad:
Farthest Centroids Divisive Clustering.
ICMLA 2008: 232-238 |
| 8 |  | Haw-ren Fang,
Dianne P. O'Leary:
Modified Cholesky algorithms: a catalog with new approaches.
Math. Program. 115(2): 319-349 (2008) |
| 2006 |
| 7 |  | James Glenn,
Haw-ren Fang,
Clyde P. Kruskal:
A Retrograde Approximation Algorithm for One-Player Can't Stop.
Computers and Games 2006: 148-159 |
| 2005 |
| 6 |  | Haw-ren Fang:
The Nature of Retrograde Analysis for Chinese Chess - Part 1.
ICGA Journal 28(2): 91-105 (2005) |
| 5 |  | Haw-ren Fang:
The Nature of Retrograde Analysis for Chinese Chess - Part 2.
ICGA Journal 28(3): 140-152 (2005) |
| 2004 |
| 4 |  | Haw-ren Fang:
Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases.
Computers and Games 2004: 129-144 |
| 3 |  | Haw-ren Fang,
Tsan-sheng Hsu,
Shun-chin Hsu:
Checking Indefinitely in Chinese Chess Endgames.
ICGA Journal 27(1): 19-37 (2004) |
| 2002 |
| 2 |  | Haw-ren Fang,
Tsan-sheng Hsu,
Shun-chin Hsu:
Indefinite Sequence of Moves in Chinese Chess Endgames.
Computers and Games 2002: 264-279 |
| 2000 |
| 1 |  | Haw-ren Fang,
Tsan-sheng Hsu,
Shun-chin Hsu:
Construction of Chinese Chess Endgame Databases by Retrograde Analysis.
Computers and Games 2000: 96-114 |