| 2015 | FAW | Soft Subdivision Search in Motion Planning, II: Axiomatics. | Chee-Keng Yap |
| 2014 | WAFR | Resolution-Exact Algorithms for Link Robots. | Zhongdi Luo, Yi-Jen Chiang, Jyh-Ming Lien, Chee-Keng Yap |
| 2012 | ISSAC | Near optimal tree size bounds on a simple real root isolation algorithm. | Vikram Sharma, Chee-Keng Yap |
| 2011 | ISSAC | A simple but exact and efficient algorithm for complex root isolation. | Chee-Keng Yap, Michael Sagraloff |
| 2009 | ISSAC | Lower bounds for zero-dimensional projections. | W. Dale Brownawell, Chee-Keng Yap |
| 2009 | ISSAC | Exact numerical computation in algebra and geometry. | Chee-Keng Yap |
| 2009 | WALCOM | Foundations of Exact Rounding. | Chee-Keng Yap, Jihun Yu |
| 2008 | ISSAC | Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. | Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap |
| 2007 | ISSAC | Complete numerical isolation of real zeros in zero-dimensional triangular systems. | Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap |
| 2006 | ICCSA | Reply to "Backward Error Analysis ...". | Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap |
| 2006 | ISSAC | Almost tight recursion tree bounds for the Descartes method. | Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap |
| 2006 | WAFR | An Experimental Study of Weighted k-Link Shortest Path Algorithms. | Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap |
| 2005 | ESA | Robust Approximate Zeros. | Vikram Sharma, Zilin Du, Chee-Keng Yap |
| 2005 | WADS | Untitled record | Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap |
| 2004 | ESA | Classroom Examples of Robustness Problems in Geometric Computations. | Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap |
| 2004 | ICCSA | Shortest Paths for Disc Obstacles. | Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap |
| 2002 | VDA | Responsive scalable thinwire visualization: application to large geographic datasets. | Chee-Keng Yap, Kenneth Been, Zilin Du |
| 2002 | VDA | Different Manhattan project: automatic statistical model generation. | Chee-Keng Yap, Henning Biermann, Aaron Hertzmann, Chen Li, Jon Meyer, Hsing-Kuo Pao, Salvatore Paxia |
| 2001 | COCOON | Competitive Online Scheduling with Level of Service. | Ee-Chien Chang, Chee-Keng Yap |
| 2001 | SODA | A new constructive root bound for algebraic expressions. | Chen Li, Chee-Keng Yap |
| 1995 | SODA | Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. | Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap |
| 1993 | WADS | Combinatorial Complexity of Signed Discs (Extended Abstract). | Diane L. Souvaine, Chee-Keng Yap |
| 1992 | FOCS | Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) | Chee-Keng Yap |
| 1990 | STOC | Quantitative Steinitz's Theorems with Applications to Multifingered Grasping | David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap |
| 1989 | WADS | Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). | Michael T. Goodrich, Colm 'Dnlaing, Chee-Keng Yap |
| 1989 | WADS | Motion Planning in the CL-Environment (Extended Abstract). | Chee-Keng Yap, Helmut Alt |
| 1988 | FOCS | New upper bounds in Klee's measure problem (extended abstract) | Mark H. Overmars, Chee-Keng Yap |
| 1988 | ICALP | Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. | Kurt Mehlhorn, Chee-Keng Yap |
| 1986 | STOC | Probing Convex Polytopes | David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap |
| 1985 | FOCS | Parallel Computational Geometry (Extended Abstract) | Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm 'Dnlaing, Chee-Keng Yap |
| 1985 | FOCS | Algebraic Cell Decomposition in NC (Preliminary Version) | Dexter Kozen, Chee-Keng Yap |
| 1984 | FOCS | A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems | Jyun-Sheng Chang, Chee-Keng Yap |
| 1984 | STOC | On k-hulls and Related Problems | Richard Cole, Micha Sharir, Chee-Keng Yap |
| 1983 | FOCS | Geometric Retrieval Problems | Richard Cole, Chee-Keng Yap |
| 1983 | STOC | Retraction: A New Approach to Motion-Planning (Extended Abstract) | Colm 'Dnlaing, Micha Sharir, Chee-Keng Yap |
| 1982 | FOCS | Generic Transformation of Data Structures | Colm 'Dnlaing, Chee-Keng Yap |
| 1982 | PODS | The Format Model: A Theory of Database Organization. | Richard Hull, Chee-Keng Yap |
| 1980 | STOC | Space-time Tradeoffs and First Order Problems in a Model of Programs | Chee-Keng Yap |
| 1978 | FOCS | On Lifted Problems (Preliminary Reports) | Chee-Keng Yap |
| 1978 | STOC | On Formulating Simultaneity for Studying Parallelism and Synchronization | Raymond E. Miller, Chee-Keng Yap |
| 1977 | ICALP | On the Computational Power of Reversal-Bounded Machines. | Ronald V. Book, Chee-Keng Yap |