| 2012 | INFOCOM | Maximizing capacity with power control under physical interference model in duplex mode. | Peng-Jun Wan, Dechang Chen, Guojun Dai, Zhu Wang, F. Frances Yao |
| 2011 | INFOCOM | Multiflows in multi-channel multi-radio multihop wireless networks. | Peng-Jun Wan, Yu Cheng, Zhu Wang, F. Frances Yao |
| 2011 | INFOCOM | Wireless link scheduling under physical interference model. | Peng-Jun Wan, Ophir Frieder, Xiaohua Jia, F. Frances Yao, Xiaohua Xu, Shaojie Tang |
| 2010 | INFOCOM | Approximate Capacity Subregions of Uniform Multihop Wireless Networks. | Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li, F. Frances Yao |
| 2009 | ISAAC | Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. | Minming Li, Peng-Jun Wan, F. Frances Yao |
| 2008 | ICDCS | Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. | Peng-Jun Wan, Lixin Wang, F. Frances Yao |
| 2008 | ICDCS | On the Longest RNG Edge of Wireless Ad Hoc Networks. | Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei Yi |
| 2008 | MOBIHOC | Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks. | Lixin Wang, Chih-Wei Yi, F. Frances Yao |
| 2007 | COCOA | Algorithms for Minimum | Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu |
| 2007 | INFOCOM | Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. | Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yingshu Li, F. Frances Yao |
| 2006 | INFOCOM | Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks. | Hai Liu, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu, F. Frances Yao |
| 2006 | MOBIHOC | Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. | Peng-Jun Wan, Chih-Wei Yi, F. Frances Yao, Xiaohua Jia |
| 2005 | ISAAC | Algorithmic Problems in Wireless Ad Hoc Networks. | F. Frances Yao |
| 1998 | ICIP | A Linear Algorithm for Optimal Context Clustering with Application to Bi-level Image Coding. | Daniel H. Greene, F. Frances Yao, Tong Zhang |
| 1995 | CPM | Dictionary Loop-Up with Small Errors. | Andrew Chi-Chih Yao, F. Frances Yao |
| 1995 | FOCS | A Scheduling Model for Reduced CPU Energy. | F. Frances Yao, Alan J. Demers, Scott Shenker |
| 1994 | FOCS | Multi-Index Hashing for Information Retrieval | Daniel H. Greene, Michal Parnas, F. Frances Yao |
| 1993 | FOCS | Approximating Shortest Superstrings | Shang-Hua Teng, F. Frances Yao |
| 1992 | ICALP | On Nearest-Neighbor Graphs. | Mike Paterson, F. Frances Yao |
| 1991 | ICALP | The Expected Extremes in a Delaunay Triangulation. | Marshall W. Bern, David Eppstein, F. Frances Yao |
| 1991 | WADS | Neighborhood Graphs and Geometric Embedding. | F. Frances Yao |
| 1990 | SODA | Optimal Binary Space Partitions for Orthogonal Objects. | Mike Paterson, F. Frances Yao |
| 1986 | FOCS | Finite-Resolution Computational Geometry | Daniel H. Greene, F. Frances Yao |
| 1985 | STOC | A General Approach to d-Dimensional Geometric Queries (Extended Abstract) | Andrew Chi-Chih Yao, F. Frances Yao |
| 1983 | STOC | A 3-Space Partition and Its Applications (Extended Abstract) | F. Frances Yao |
| 1980 | FOCS | On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report) | F. Frances Yao |
| 1980 | STOC | On Translating a Set of Rectangles | Leonidas J. Guibas, F. Frances Yao |
| 1980 | STOC | Efficient Dynamic Programming Using Quadrangle Inequalities | F. Frances Yao |
| 1978 | FOCS | On the Average-case Complexity of Selecting k-th Best | Andrew Chi-Chih Yao, F. Frances Yao |
| 1976 | FOCS | The Complexity of Searching an Ordered Random Table (Extended Abstract) | Andrew Chi-Chih Yao, F. Frances Yao |