New Upper Bounds for Selection. - Chee-Keng Yap (Commun. ACM, 1976)

On the Computational Power of Reversal-Bounded Machines. - Ronald V. Book; Chee-Keng Yap (ICALP, 1977)

On Lifted Problems (Preliminary Reports) - Chee-Keng Yap (FOCS, 1978)

On the formal specification and analysis for loosely connected processes. - Raymond E. Miller; Chee-Keng Yap (Mathematical Studies of Information Processing, 1978)

On Formulating Simultaneity for Studying Parallelism and Synchronization - Raymond E. Miller; Chee-Keng Yap (STOC, 1978)

Space-time Tradeoffs and First Order Problems in a Model of Programs - Chee-Keng Yap (STOC, 1980)

Generic Transformation of Data Structures - Colm Ó'Dúnlaing; Chee-Keng Yap (FOCS, 1982)

The Format Model: A Theory of Database Organization. - Richard Hull 001; Chee-Keng Yap (PODS, 1982)

Geometric Retrieval Problems - Richard Cole 001; Chee-Keng Yap (FOCS, 1983)

Retraction: A New Approach to Motion-Planning (Extended Abstract) - Colm Ó'Dúnlaing; Micha Sharir; Chee-Keng Yap (STOC, 1983)

A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs. - Chee-Keng Yap (Inf. Process. Lett., 1983)

Some Consequences of Non-Uniform Conditions on Uniform Classes. - Chee-Keng Yap (Theor. Comput. Sci., 1983)

A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems - Jyun-Sheng Chang; Chee-Keng Yap (FOCS, 1984)

On k-hulls and Related Problems - Richard Cole 001; Micha Sharir; Chee-Keng Yap (STOC, 1984)

Counting digraphs and hypergraphs. - Colm Ó'Dúnlaing; Chee-Keng Yap (Bull. EATCS, 1984)

Strong NP-Hardness of Moving Many Discs. - Paul G. Spirakis; Chee-Keng Yap (Inf. Process. Lett., 1984)

Finding minimal convex nested polygons. - Alok Aggarwal; Heather Booth; Joseph O'Rourke; Subhash Suri; Chee-Keng Yap (SCG, 1985)

Computing a convex skill of an orthogonal polygon. - Derick Wood; Chee-Keng Yap (SCG, 1985)

Parallel Computational Geometry (Extended Abstract) - Alok Aggarwal; Bernard Chazelle; Leonidas J. Guibas; Colm Ó'Dúnlaing; Chee-Keng Yap (FOCS, 1985)

Algebraic Cell Decomposition in NC (Preliminary Version) - Dexter Kozen; Chee-Keng Yap (FOCS, 1985)

A Parallel Median Algorithm. - Richard Cole 001; Chee-Keng Yap (Inf. Process. Lett., 1985)

A "Retraction" Method for Planning the Motion of a Disc. - Colm Ó'Dúnlaing; Chee-Keng Yap (J. Algorithms, 1985)

Minimum area circumscribing Polygons. - Alok Aggarwal; Jyun-Sheng Chang; Chee-Keng Yap (Vis. Comput., 1985)

Moving a Polygon Around the Corner in a Corridor. - S. Maddila; Chee-Keng Yap (SCG, 1986)

Coordinated motion of two robot arms. - Steven Fortune; Gordon T. Wilfong; Chee Yap (ICRA, 1986)

Probing Convex Polytopes - David P. Dobkin; Herbert Edelsbrunner; Chee-Keng Yap (STOC, 1986)

A Polynomial Solution for the Potato-peeling Problem. - Jyun-Sheng Chang; Chee-Keng Yap (Discret. Comput. Geom., 1986)

New Upper Bounds for Neighbor Searching - Bernard Chazelle; Richard Cole 001; Franco P. Preparata; Chee-Keng Yap (Inf. Control., 1986)

Reversal complexity. - Jianer Chen; Chee-Keng Yap (SCT, 1987)

Computing the Link Center of a Simple Polygon. - William J. Lenhart; Richard Pollack; Jörg-Rüdiger Sack; Raimund Seidel; Micha Sharir; Subhash Suri; Godfried T. Toussaint; Sue Whitesides; Chee-Keng Yap (SCG, 1987)

How to move a chair through a door. - Chee Yap (ICRA, 1987)

What Can be Parallelized in Computational Geometry?. - Chee-Keng Yap (Parallel Algorithms and Architectures, 1987)

Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. - Colm Ó'Dúnlaing; Micha Sharir; Chee-Keng Yap (Algorithmica, 1987)

Preface Special Issue on Robotics. - Chee-Keng Yap (Algorithmica, 1987)

An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. - Chee-Keng Yap (Discret. Comput. Geom., 1987)

Shape from Probing. - Richard Cole 001; Chee-Keng Yap (J. Algorithms, 1987)

The Design of LINETOOL, a Geometric Editor. - L. W. Ericson; Chee-Keng Yap (SCG, 1988)

A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. - Chee-Keng Yap (SCG, 1988)

New upper bounds in Klee's measure problem (extended abstract) - Mark H. Overmars; Chee-Keng Yap (FOCS, 1988)

Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. - Kurt Mehlhorn; Chee-Keng Yap (ICALP, 1988)

Applications of a Symbolic Perturbation Scheme (Abstract). - Chee-Keng Yap (SWAT, 1988)

Parallel Computational Geometry. - Alok Aggarwal; Bernard Chazelle; Leonidas J. Guibas; Colm Ó'Dúnlaing; Chee-Keng Yap (Algorithmica, 1988)

Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map. - Chee-Keng Yap (Algorithmica, 1988)

The Orthogonal Convex Skull Problem. - Derick Wood; Chee-Keng Yap (Discret. Comput. Geom., 1988)

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). - Michael T. Goodrich; Colm Ó'Dúnlaing; Chee-Keng Yap (WADS, 1989)

Motion Planning in the CL-Environment (Extended Abstract). - Chee-Keng Yap; Helmut Alt (WADS, 1989)

Editor's Foreword: Special Issue on Computational Geometry. - Chee-Keng Yap (Algorithmica, 1989)

Notes on Gröbner bases. - Bud Mishra; Chee-Keng Yap (Inf. Sci., 1989)

Probing Convex Polytopes. - David P. Dobkin; Herbert Edelsbrunner; Chee K. Yap (Autonomous Robot Vehicles, 1990)

On Simultaneous Inner and Outer Approximation of Shapes. - Rudolf Fleischer; Kurt Mehlhorn; Günter Rote; Emo Welzl; Chee-Keng Yap (SCG, 1990)

Computational Complexity of Combinatorial Surfaces. - Gert Vegter; Chee-Keng Yap (SCG, 1990)

Quantitative Steinitz's Theorems with Applications to Multifingered Grasping - David G. Kirkpatrick; Bhubaneswar Mishra; Chee-Keng Yap (STOC, 1990)

Symbolic Treatment of Geometric Degeneration. - Chee-Keng Yap (J. Symb. Comput., 1990)

On-line Motion Planning: Case of a Planar Rod. - James Cox; Chee-Keng Yap (Ann. Math. Artif. Intell., 1991)

A New Lower Bound Construction for Commutative Thue Systems with aApplications. - Chee-Keng Yap (J. Symb. Comput., 1991)

Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. - Kurt Mehlhorn; Chee-Keng Yap (SIAM J. Comput., 1991)

New Upper Bounds in Klee's Measure Problem. - Mark H. Overmars; Chee-Keng Yap (SIAM J. Comput., 1991)

Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) - Chee-Keng Yap (FOCS, 1992)

Refinement Methods for Geometric Bounds in Constructive Solid Geometry. - Stephen Cameron; Chee-Keng Yap (ACM Trans. Graph., 1992)

Low Level Issues in Computational Geometry. - Chee Yap (CCCG, 1993)

Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. - Dan Halperin; Chee-Keng Yap (SCG, 1993)

The Geometry in Constraint Logic Programs. - Thomas Dubé; Chee-Keng Yap (PPCP, 1993)

Combinatorial Complexity of Signed Discs (Extended Abstract). - Diane L. Souvaine; Chee-Keng Yap (WADS, 1993)

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. - Michael T. Goodrich; Colm Ó'Dúnlaing; Chee-Keng Yap (Algorithmica, 1993)

Shortest Paths for Line Segments. - Christian Icking; Günter Rote; Emo Welzl; Chee-Keng Yap (Algorithmica, 1993)

Approximate Euclidean Shortest Path in 3-Space. - Joonsoo Choi; Jürgen Sellen; Chee-Keng Yap (SCG, 1994)

Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). - Joonsoo Choi; Jürgen Sellen; Chee-Keng Yap (SCG, 1995)

Rectilinear Geodesics in 3-Space (Extended Abstract). - Joonsoo Choi; Chee-Keng Yap (SCG, 1995)

Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. - Timothy M. Chan; Jack Snoeyink; Chee-Keng Yap (SODA, 1995)

Combinatorial Complexity of Signed Discs. - Diane L. Souvaine; Chee-Keng Yap (Comput. Geom., 1995)

A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. - Ee-Chien Chang; Chee-Keng Yap (Inf. Process. Lett., 1995)

Efficient Algorithms for the Smallest Enclosing Cylinder Problem. - Elmar Schömer; Jürgen Sellen; Marek Teichmann; Chee-Keng Yap (CCCG, 1996)

d1-Optimal Motion for a Rod (Extended Abstract). - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (SCG, 1996)

Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). - Joonsoo Choi; Chee-Keng Yap (SCG, 1996)

Smallest Enclosing Cylinders. - Elmar Schömer; Jürgen Sellen; Marek Teichmann; Chee-Keng Yap (SCG, 1996)

The Habicht Approch to Subresultants. - Chung-Jen Ho; Chee-Keng Yap (J. Symb. Comput., 1996)

A Wavelet Approach to Foveating Images. - Ee-Chien Chang; Chee-Keng Yap (SCG, 1997)

A Complete Roundness Classification Procedure. - Kurt Mehlhorn; Thomas C. Shermer; Chee-Keng Yap (SCG, 1997)

Towards Exact Geometric Computation. - Chee-Keng Yap (Comput. Geom., 1997)

Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. - Timothy M. Chan; Jack Snoeyink; Chee-Keng Yap (Discret. Comput. Geom., 1997)

Approximate Euclidean Shortest Paths in 3-Space. - Joonsoo Choi; Jürgen Sellen; Chee-Keng Yap (Int. J. Comput. Geom. Appl., 1997)

A Core Library for Robust Numeric and Geometric Computation. - Vijay Karamcheti; Chen Li 003; Igor Pechtchanski; Chee-Keng Yap (SCG, 1999)

Emerging Challenges in Computational Topology - Marshall W. Bern; David Eppstein; Pankaj K. Agarwal; Nina Amenta; L. Paul Chew; Tamal K. Dey; David P. Dobkin; Herbert Edelsbrunner; Cindy Grimm; Leonidas J. Guibas; John Harer; Joel Hass; et al. (CoRR, 1999)

Fundamental problems of algorithmic algebra. - Chee-Keng Yap (Oxford University Press, 2000)

Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. - Daniela Tulone; Chee-Keng Yap; Chen Li 003 (Automated Deduction in Geometry, 2000)

A Simultaneous Search Problem. - Ee-Chien Chang; Chee-Keng Yap (Algorithmica, 2000)

Precision-Sensitive Euclidean Shortest Path in 3-Space. - Jürgen Sellen; Joonsoo Choi; Chee-Keng Yap (SIAM J. Comput., 2000)

Yet another look at fractional cascading: B-graphs with application to point location. - Chee Yap; Yunyue Zhu (CCCG, 2001)

Competitive Online Scheduling with Level of Service. - Ee-Chien Chang; Chee-Keng Yap (COCOON, 2001)

A new constructive root bound for algebraic expressions. - Chen Li 003; Chee-Keng Yap (SODA, 2001)

Pseudo approximation algorithms, with applications to optimal motion planning. - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (SCG, 2002)

Responsive scalable thinwire visualization: application to large geographic datasets. - Chee-Keng Yap; Kenneth Been; Zilin Du (Visualization and Data Analysis, 2002)

Different Manhattan project: automatic statistical model generation. - Chee-Keng Yap; Henning Biermann; Aaron Hertzmann; Chen Li 003; Jon Meyer; Hsing-Kuo Pao; Salvatore Paxia (Visualization and Data Analysis, 2002)

Hypergeometric Functions in Exact Geometric Computation. - Zilin Du; Maria Eleftheriou; José E. Moreira; Chee-Keng Yap (CCA, 2002)

Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (CCCG, 2003)

Constructive root bound for k-ary rational input numbers. - Sylvain Pion; Chee-Keng Yap (SCG, 2003)

Competitive On-Line Scheduling with Level of Service. - Ee-Chien Chang; Chee-Keng Yap (J. Sched., 2003)

Classroom Examples of Robustness Problems in Geometric Computations. - Lutz Kettner; Kurt Mehlhorn; Sylvain Pion; Stefan Schirra; Chee-Keng Yap (ESA, 2004)

Shortest Paths for Disc Obstacles. - Deok-Soo Kim; Kwangseok Yu; Youngsong Cho; Donguk Kim 001; Chee-Keng Yap (ICCSA (3), 2004)

Robust geometric computation. - Chee K. Yap (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Shortest path amidst disc obstacles is computable. - Ee-Chien Chang; Sung Woo Choi; DoYong Kwon; Hyungju Park; Chee-Keng Yap (SCG, 2005)

Robust Approximate Zeros. - Vikram Sharma 001; Zilin Du; Chee-Keng Yap (ESA, 2005)

k-Link Shortest Paths in Weighted Subdivisions. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (WADS, 2005)

Recent progress in exact geometric computation. - Chen Li 003; Sylvain Pion; Chee-Keng Yap (J. Log. Algebraic Methods Program., 2005)

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (SCG, 2006)

Complete subdivision algorithms, I: intersection of Bezier curves. - Chee-Keng Yap (SCG, 2006)

Reply to "Backward Error Analysis ...". - Lutz Kettner; Kurt Mehlhorn; Sylvain Pion; Stefan Schirra; Chee-Keng Yap (ICCSA (1), 2006)

Almost tight recursion tree bounds for the Descartes method. - Arno Eigenwillig; Vikram Sharma 001; Chee-Keng Yap (ISSAC, 2006)

An Experimental Study of Weighted k-Link Shortest Path Algorithms. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (WAFR, 2006)

Special Issue on Robust Geometric Algorithms and their Implementations. - Chee-Keng Yap; Sylvain Pion (Comput. Geom., 2006)

Constructive root bound for k-ary rational input numbers. - Sylvain Pion; Chee-Keng Yap (Theor. Comput. Sci., 2006)

Dynamic Map Labeling. - Ken Been; Eli Daiches; Chee-Keng Yap (IEEE Trans. Vis. Comput. Graph., 2006)

Complete numerical isolation of real zeros in zero-dimensional triangular systems. - Jin-San Cheng; Xiao-Shan Gao; Chee-Keng Yap (ISSAC, 2007)

Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions. - Paul Harrington; Colm Ó'Dúnlaing; Chee-Keng Yap (Int. J. Comput. Geom. Appl., 2007)

Foreword. - Chee-Keng Yap; Hoon Hong (Math. Comput. Sci., 2007)

Theory of Real Computation According to EGC. - Chee-Keng Yap (Reliable Implementation of Real Number Algorithms, 2008)

Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. - Michael A. Burr; Sung Woo Choi; Benjamin Galehouse; Chee-Keng Yap (ISSAC, 2008)

Robust Geometric Computation. - Chee-Keng Yap; Vikram Sharma 001 (Encyclopedia of Algorithms, 2008)

In Praise of Numerical Computation. - Chee-Keng Yap (Efficient Algorithms, 2009)

Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. - Long Lin; Chee-Keng Yap (SCG, 2009)

Lower bounds for zero-dimensional projections. - W. Dale Brownawell; Chee-Keng Yap (ISSAC, 2009)

Exact numerical computation in algebra and geometry. - Chee-Keng Yap (ISSAC, 2009)

Foundations of Exact Rounding. - Chee-Keng Yap; Jihun Yu (WALCOM, 2009)

Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique. - Michael A. Burr; Felix Krahmer; Chee Yap (Electron. Colloquium Comput. Complex., 2009)

Complete numerical isolation of real roots in zero-dimensional triangular systems. - Jin-San Cheng; Xiao-Shan Gao; Chee-Keng Yap (J. Symb. Comput., 2009)

The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. - Jihun Yu; Chee Yap; Zilin Du; Sylvain Pion; Hervé Brönnimann (ICMS, 2010)

Foreword. - Gert Vegter; Chee-Keng Yap (Math. Comput. Sci., 2010)

A simple but exact and efficient algorithm for complex root isolation. - Chee-Keng Yap; Michael Sagraloff (ISSAC, 2011)

Empirical study of an evaluation-based subdivision algorithm for complex root isolation. - Narayan Kamath; Irina Voiculescu; Chee K. Yap (SNC, 2011)

A Real Elementary Approach to the Master Recurrence and Generalizations. - Chee Yap (TAMC, 2011)

Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach. - Long Lin; Chee Yap (Discret. Comput. Geom., 2011)

Certified computation of planar morse-smale complexes. - Gert Vegter; Amit Chattopadhyay; Chee-Keng Yap (SCG, 2012)

Near optimal tree size bounds on a simple real root isolation algorithm. - Vikram Sharma 001; Chee-Keng Yap (ISSAC, 2012)

Towards Exact Numerical Voronoi Diagrams. - Chee-Keng Yap; Vikram Sharma 001; Jyh-Ming Lien (ISVD, 2012)

Explicit Mesh Surfaces for Particle Based Fluids. - Jihun Yu; Chris Wojtan; Greg Turk; Chee Yap (Comput. Graph. Forum, 2012)

Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. - Chee Yap; Michael Sagraloff; Vikram Sharma 001 (CiE, 2013)

On soft predicates in subdivision motion planning. - Cong Wang; Yi-Jen Chiang; Chee Yap (SoCG, 2013)

Non-local isotopic approximation of nonsingular surfaces. - Long Lin; Chee Yap; Jihun Yu (Comput. Aided Des., 2013)

Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision. - Jyh-Ming Lien; Vikram Sharma 001; Gert Vegter; Chee Yap (ICMS, 2014)

Amortized Analysis of Smooth Quadtrees in All Dimensions. - Huck Bennett; Chee Yap (SWAT, 2014)

Resolution-Exact Algorithms for Link Robots. - Zhongdi Luo; Yi-Jen Chiang; Jyh-Ming Lien; Chee-Keng Yap (WAFR, 2014)

Proceedings of the 1st Workshop on Robotics Challenges and Vision (RCV2013). - Aitor Aladren; Sasa Bodiroza; Hamid Reza Chitsaz; J. J. Guerrero; Verena V. Hafner; Kris K. Hauser; Aleksandar Jevtic; Moslem Kazemi; Bruno Lara 001; Gonzalo López-Nicolás; Peer Neubert; Peter Protzel; et al. (CoRR, 2014)

Soft Subdivision Search in Motion Planning, II: Axiomatics. - Chee-Keng Yap (FAW, 2015)

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Chee-Keng Yap (CoRR, 2015)

Path Planning for Simple Robots using Soft Subdivision Search. - Ching-Hsiang Hsu; John Paul Ryan; Chee Yap (SoCG, 2016)

Complexity Analysis of Root Clustering for a Complex Polynomial. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Juan Xu; Chee Yap (ISSAC, 2016)

Resolution-Exact Planner for Thick Non-Crossing 2-Link Robots. - Chee K. Yap; Zhongdi Luo; Ching-Hsiang Hsu (WAFR, 2016)

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. - Huck Bennett; Evanthia Papadopoulou; Chee Yap (Comput. Graph. Forum, 2016)

Robust Geometric Computation. - Chee K. Yap; Vikram Sharma 001 (Encyclopedia of Algorithms, 2016)

Preface. - Jianxin Wang 001; Chee K. Yap (Theor. Comput. Sci., 2017)

Soft Subdivision Motion Planning for Complex Planar Robots. - Bo Zhou; Yi-Jen Chiang; Chee Yap (ESA, 2018)

Implementation of a Near-Optimal Complex Root Clustering Algorithm. - Rémi Imbach; Victor Y. Pan; Chee Yap (ICMS, 2018)

On mu μ -Symmetric Polynomials and D-Plus. - Jing Yang 039; Chee K. Yap (ICMS, 2018)

An Approach for Certifying Homotopy Continuation Paths: Univariate Case. - Juan Xu; Michael A. Burr; Chee Yap (ISSAC, 2018)

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Chee Yap (J. Symb. Comput., 2018)

Root-Finding with Implicit Deflation. - Rémi Imbach; Victor Y. Pan; Chee Yap; Ilias S. Kotsireas; Vitaly Zaderman (CASC, 2019)

Towards Soft Exact Computation (Invited Talk). - Chee Yap (CASC, 2019)

Rods and Rings: Soft Subdivision Planner for R^3 x S^2. - Ching-Hsiang Hsu; Yi-Jen Chiang; Chee Yap (SoCG, 2019)

An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: The Averaging Method Revisited. - Bo Huang 015; Chee Yap (ISSAC, 2019)

Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis. - Juan Xu; Chee Yap (ISSAC, 2019)

SIAN: software for structural identifiability analysis of ODE models. - Hoon Hong; Alexey Ovchinnikov; Gleb Pogudin; Chee Yap (Bioinform., 2019)

SIAN: a tool for assessing structural identifiability of parametric ODEs. - Hoon Hong; Alexey Ovchinnikov; Gleb Pogudin; Chee Yap (ACM Commun. Comput. Algebra, 2019)

An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: the Averaging Method Revisited. - Bo Huang; Chee Yap (CoRR, 2019)

On mu-Symmetric Polynomials. - Jing Yang 039; Chee K. Yap (CoRR, 2020)

Special Issue on Symbolic and Algebraic Computation: ISSAC 2017. - Mohab Safey El Din; Chee Yap (J. Symb. Comput., 2020)

Certified Approximation Algorithms for the Fermat Point and n-Ellipses. - Kolja Junginger; Ioannis Mantas; Evanthia Papadopoulou; Martin Suderland; Chee Yap (ESA, 2021)

Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation. - Kai Hormann; Lucas Kania; Chee Yap (ISSAC, 2021)

The D-plus Discriminant and Complexity of Root Clustering. - Jing Yang 039; Chee K. Yap (CoRR, 2021)

Clustering Complex Zeros of Triangular Systems of Polynomials. - Rémi Imbach; Marc Pouget; Chee Yap (Math. Comput. Sci., 2021)

Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition). - Ioannis Mantas; Evanthia Papadopoulou; Martin Suderland; Chee Yap (SoCG, 2022)

Range Functions of Any Convergence Order and Their Amortized Complexity Analysis. - Kai Hormann; Chee Yap; Ya Shi Zhang (CASC, 2023)

Symbolic-Numeric Parameter Estimation Software Package in Julia. - Soo Go; Hoon Hong; Ilia Ilmer; Alexey Ovchinnikov; Pedro Soto 001; Chee Yap (CoRR, 2023)

An algorithmic approach to small limit cycles of nonlinear differential systems: The averaging method revisited. - Bo Huang 015; Chee Yap (J. Symb. Comput., 2023)

Theory and Explicit Design of a Path Planner for an SE(3) Robot. - Zhaoqi Zhang; Yi-Jen Chiang; Chee Yap (CoRR, 2024)

A Novel Approach to the Initial Value Problem with a complete validated algorithm. - Bingwei Zhang; Chee Yap (CoRR, 2025)

Distortion Bounds of Subdivision Models for SO(3). - Zhaoqi Zhang; Chee Yap (CoRR, 2025)

Robust parameter estimation for rational ordinary differential equations. - Oren Bassik; Yosef Berman; Soo Go; Hoon Hong; Ilia Ilmer; Alexey Ovchinnikov; Chris Rackauckas; Pedro Soto 001; Chee Yap (Appl. Math. Comput., 2026)