- PC-Trees vs. PQ-Trees Wen-Lian Hsu
- A Simple Test for the Consecutive Ones Property Wen-Lian Hsu1
- ON PHONEME-TO-CHARACTER CONVERSION SYSTEMS IN CHINESE PROCESSING
- A NEW PLANARITY TEST (To appear in Theoretical Computer Science)
- A Clustering Algorithm for Interval Graph Test on Noisy Data
- Biological Question Answering with Syntactic and Semantic Feature Matching an Improved Mean Reciprocal Ranking Measurement
- PQ Trees, PC Trees, and Planar Wen-Lian Hsu
- An Efficient Implementation of the PC-Tree Algorithm of Shih & Hsu's Planarity Test Wen-Lian Hsu, hsu@iis.sinica.edu.tw
- A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
- A Test for the Consecutive Ones Property on Noisy Data Institute of Computer and Information Science
- Proceedings of the 2011 Named Entities Workshop, IJCNLP 2011, pages 8690, Chiang Mai, Thailand, November 12, 2011.
- Proceedings of the Workshop on Advances in Text Input Methods (WTIM 2011), pages 5361, Chiang Mai, Thailand, November 13, 2011.
