The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Chee-Keng Yap: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard Hull, Chee-Keng Yap
    The Format Model: A Theory of database Organization. [Citation Graph (47, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:518-544 [Journal]
  2. Richard Hull, Chee-Keng Yap
    The Format Model: A Theory of Database Organization. [Citation Graph (8, 13)][DBLP]
    PODS, 1982, pp:205-211 [Conf]
  3. Dexter Kozen, Chee-Keng Yap
    Algebraic Cell Decomposition in NC (Preliminary Version) [Citation Graph (5, 0)][DBLP]
    FOCS, 1985, pp:515-521 [Conf]
  4. Colm Ó'Dúnlaing, Chee-Keng Yap
    Generic Transformation of Data Structures [Citation Graph (2, 0)][DBLP]
    FOCS, 1982, pp:186-195 [Conf]
  5. David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap
    Probing Convex Polytopes [Citation Graph (2, 0)][DBLP]
    STOC, 1986, pp:424-432 [Conf]
  6. Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
    Parallel Computational Geometry (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1985, pp:468-477 [Conf]
  7. Richard Cole, Chee-Keng Yap
    Geometric Retrieval Problems [Citation Graph (1, 0)][DBLP]
    FOCS, 1983, pp:112-121 [Conf]
  8. Raymond E. Miller, Chee-Keng Yap
    On Formulating Simultaneity for Studying Parallelism and Synchronization. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:2, pp:203-218 [Journal]
  9. Chee-Keng Yap
    Some Consequences of Non-Uniform Conditions on Uniform Classes. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:287-300 [Journal]
  10. Daniela Tulone, Chee-Keng Yap, Chen Li 0003
    Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. [Citation Graph (0, 0)][DBLP]
    Automated Deduction in Geometry, 2000, pp:58-82 [Conf]
  11. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:10-13 [Conf]
  12. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
    Efficient Algorithms for the Smallest Enclosing Cylinder Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:264-269 [Conf]
  13. Ee-Chien Chang, Chee-Keng Yap
    Competitive Online Scheduling with Level of Service. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:453-462 [Conf]
  14. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    Pseudo approximation algorithms, with applications to optimal motion planning. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:170-178 [Conf]
  15. Chee-Keng Yap
    Complete subdivision algorithms, I: intersection of Bezier curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:217-226 [Conf]
  16. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    d1-Optimal Motion for a Rod (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:252-263 [Conf]
  17. Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap
    Shortest path amidst disc obstacles is computable. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:116-125 [Conf]
  18. Ee-Chien Chang, Chee-Keng Yap
    A Wavelet Approach to Foveating Images. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:397-399 [Conf]
  19. Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
    Approximate Euclidean Shortest Path in 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:41-48 [Conf]
  20. Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
    Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:350-359 [Conf]
  21. Joonsoo Choi, Chee-Keng Yap
    Rectilinear Geodesics in 3-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:380-389 [Conf]
  22. Joonsoo Choi, Chee-Keng Yap
    Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:339-348 [Conf]
  23. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
    Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:483-484 [Conf]
  24. L. W. Ericson, Chee-Keng Yap
    The Design of LINETOOL, a Geometric Editor. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:83-92 [Conf]
  25. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    On Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:216-224 [Conf]
  26. Dan Halperin, Chee-Keng Yap
    Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:29-37 [Conf]
  27. Chee-Keng Yap
    A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:134-142 [Conf]
  28. Vijay Karamcheti, C. Li, Igor Pechtchanski, C. Yap
    A Core Library for Robust Numeric and Geometric Computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:351-359 [Conf]
  29. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
    Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  30. S. Maddila, Chee-Keng Yap
    Moving a Polygon Around the Corner in a Corridor. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:187-192 [Conf]
  31. Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap
    A Complete Roundness Classification Procedure. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:129-138 [Conf]
  32. Sylvain Pion, Chee-Keng Yap
    Constructive root bound for k-ary rational input numbers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:256-263 [Conf]
  33. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
    Smallest Enclosing Cylinders. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-13 [Conf]
  34. Gert Vegter, Chee-Keng Yap
    Computational Complexity of Combinatorial Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:102-111 [Conf]
  35. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
    Classroom Examples of Robustness Problems in Geometric Computations. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:702-713 [Conf]
  36. Vikram Sharma, Zilin Du, Chee-Keng Yap
    Robust Approximate Zeros. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:874-886 [Conf]
  37. Jyun-Sheng Chang, Chee-Keng Yap
    A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:408-416 [Conf]
  38. Mark H. Overmars, Chee-Keng Yap
    New upper bounds in Klee's measure problem (extended abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:550-556 [Conf]
  39. Chee-Keng Yap
    On Lifted Problems (Preliminary Reports) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:267-279 [Conf]
  40. Chee-Keng Yap
    Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:437-446 [Conf]
  41. Ronald V. Book, Chee-Keng Yap
    On the Computational Power of Reversal-Bounded Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:111-119 [Conf]
  42. Kurt Mehlhorn, Chee-Keng Yap
    Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:410-423 [Conf]
  43. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
    Reply to "Backward Error Analysis ...". [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2006, pp:60-60 [Conf]
  44. Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee Yap
    Shortest Paths for Disc Obstacles. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2004, pp:62-70 [Conf]
  45. Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap
    Almost tight recursion tree bounds for the Descartes method. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:71-78 [Conf]
  46. Raymond E. Miller, Chee-Keng Yap
    On the formal specification and analysis for loosely connected processes. [Citation Graph (0, 0)][DBLP]
    Mathematical Studies of Information Processing, 1978, pp:33-66 [Conf]
  47. Chee-Keng Yap
    What Can be Parallelized in Computational Geometry?. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:184-195 [Conf]
  48. Thomas Dubé, Chee-Keng Yap
    The Geometry in Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    PPCP, 1993, pp:44-50 [Conf]
  49. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
    Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:282-291 [Conf]
  50. Chen Li 0003, Chee-Keng Yap
    A new constructive root bound for algebraic expressions. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:496-505 [Conf]
  51. Richard Cole, Micha Sharir, Chee-Keng Yap
    On k-hulls and Related Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:154-166 [Conf]
  52. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
    Quantitative Steinitz's Theorems with Applications to Multifingered Grasping [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:341-351 [Conf]
  53. Raymond E. Miller, Chee-Keng Yap
    On Formulating Simultaneity for Studying Parallelism and Synchronization [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:105-113 [Conf]
  54. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
    Retraction: A New Approach to Motion-Planning (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:207-220 [Conf]
  55. Chee-Keng Yap
    Space-time Tradeoffs and First Order Problems in a Model of Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:318-325 [Conf]
  56. Chee-Keng Yap
    Applications of a Symbolic Perturbation Scheme (Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:138- [Conf]
  57. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
    k-Link Shortest Paths in Weighted Subdivisions. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:325-337 [Conf]
  58. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
    Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:12-23 [Conf]
  59. Chee-Keng Yap, Helmut Alt
    Motion Planning in the CL-Environment (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:373-380 [Conf]
  60. Diane L. Souvaine, Chee-Keng Yap
    Combinatorial Complexity of Signed Discs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:577-588 [Conf]
  61. Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
    Parallel Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:293-327 [Journal]
  62. Ee-Chien Chang, Chee-Keng Yap
    A Simultaneous Search Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:2, pp:255-262 [Journal]
  63. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
    Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:2, pp:128-141 [Journal]
  64. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:365-389 [Journal]
  65. Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap
    Shortest Paths for Line Segments. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:2-4, pp:182-200 [Journal]
  66. Chee-Keng Yap
    Preface Special Issue on Robotics. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:363-365 [Journal]
  67. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
    Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:27-59 [Journal]
  68. Chee-Keng Yap
    Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:279-288 [Journal]
  69. Chee-Keng Yap
    Editor's Foreword: Special Issue on Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:1, pp:1-2 [Journal]
  70. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
    Smallest Enclosing Cylinders. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:170-186 [Journal]
  71. James Cox, Chee-Keng Yap
    On-line Motion Planning: Case of a Planar Rod. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:3, n:1, pp:1-20 [Journal]
  72. Chee-Keng Yap
    New Upper Bounds for Selection. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1976, v:19, n:9, pp:501-508 [Journal]
  73. Chee-Keng Yap
    Towards Exact Geometric Computation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:3-23 [Journal]
  74. Dan Halperin, Chee-Keng Yap
    Combinatorial complexity of translating a box in polyhedral 3-space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:3, pp:181-196 [Journal]
  75. Diane L. Souvaine, Chee-Keng Yap
    Combinatorial Complexity of Signed Discs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:207-223 [Journal]
  76. Chee-Keng Yap, Sylvain Pion
    Special Issue on Robust Geometric Algorithms and their Implementations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:1-2, pp:1-2 [Journal]
  77. 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, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin
    Emerging Challenges in Computational Topology [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  78. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:139-171 [Journal]
  79. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
    Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:4, pp:433-454 [Journal]
  80. Jyun-Sheng Chang, Chee-Keng Yap
    A Polynomial Solution for the Potato-peeling Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:155-182 [Journal]
  81. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
    Quantitative Steinitz's Theorems Applications to Multifingered Grasping. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:295-318 [Journal]
  82. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
    Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  83. Chee-Keng Yap
    An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:365-393 [Journal]
  84. Derick Wood, Chee-Keng Yap
    The Orthogonal Convex Skull Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:349-365 [Journal]
  85. Colm Ó'Dúnlaing, Chee-Keng Yap
    Counting digraphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:24, n:, pp:85-87 [Journal]
  86. Zilin Du, Maria Eleftheriou, José E. Moreira, Chee Yap
    Hypergeometric Functions in Exact Geometric Computation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  87. Richard Cole, Chee-Keng Yap
    Geometric Retrieval Problems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:63, n:1/2, pp:39-57 [Journal]
  88. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
    Finding Minimal Convex Nested Polygons [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:1, pp:98-110 [Journal]
  89. Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
    Approximate Euclidean Shortest Paths in 3-Space. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:271-295 [Journal]
  90. Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap
    Shortest Path amidst Disc Obstacles Is Computable. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:5-6, pp:567-590 [Journal]
  91. Ee-Chien Chang, Chee-Keng Yap
    A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:3, pp:155-157 [Journal]
  92. Richard Cole, Chee-Keng Yap
    A Parallel Median Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:3, pp:137-139 [Journal]
  93. Paul G. Spirakis, Chee-Keng Yap
    Strong NP-Hardness of Moving Many Discs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:55-59 [Journal]
  94. Chee-Keng Yap
    A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:4, pp:181-182 [Journal]
  95. Richard Cole, Chee-Keng Yap
    Shape from Probing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:19-38 [Journal]
  96. Colm Ó'Dúnlaing, Chee-Keng Yap
    A "Retraction" Method for Planning the Motion of a Disc. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:104-111 [Journal]
  97. Chee-Keng Yap
    Geometric Consistency Theorem for a Symbolic Perturbation Scheme. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:40, n:1, pp:2-18 [Journal]
  98. Chen Li 0003, Sylvain Pion, Chee-Keng Yap
    Recent progress in exact geometric computation. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:64, n:1, pp:85-111 [Journal]
  99. Chung-Jen Ho, Chee-Keng Yap
    The Habicht Approch to Subresultants. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:21, n:1, pp:1-14 [Journal]
  100. Chee-Keng Yap
    Symbolic Treatment of Geometric Degeneration. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:3/4, pp:349-370 [Journal]
  101. Chee-Keng Yap
    A New Lower Bound Construction for the Word Problem for Commutative Thue Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:1, pp:1-28 [Journal]
  102. Jianer Chen, Chee-Keng Yap
    Reversal Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:4, pp:622-638 [Journal]
  103. Richard Cole, Micha Sharir, Chee-Keng Yap
    On k-Hulls and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:61-77 [Journal]
  104. Kurt Mehlhorn, Chee-Keng Yap
    Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:4, pp:603-621 [Journal]
  105. Mark H. Overmars, Chee-Keng Yap
    New Upper Bounds in Klee's Measure Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1034-1045 [Journal]
  106. Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap
    Precision-Sensitive Euclidean Shortest Path in 3-Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1577-1595 [Journal]
  107. Sylvain Pion, Chee-Keng Yap
    Constructive root bound for k-ary rational input numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:361-376 [Journal]
  108. Stephen Cameron, Chee-Keng Yap
    Refinement Methods for Geometric Bounds in Constructive Solid Geometry. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1992, v:11, n:1, pp:12-39 [Journal]
  109. Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap
    Minimum area circumscribing Polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1985, v:1, n:2, pp:112-117 [Journal]
  110. Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap
    Complete numerical isolation of real zeros in zero-dimensional triangular systems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2007, pp:92-99 [Conf]

  111. In Praise of Numerical Computation. [Citation Graph (, )][DBLP]


  112. Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. [Citation Graph (, )][DBLP]


  113. Computing a convex skill of an orthogonal polygon. [Citation Graph (, )][DBLP]


  114. Finding minimal convex nested polygons. [Citation Graph (, )][DBLP]


  115. Theory of Real Computation According to EGC. [Citation Graph (, )][DBLP]


  116. Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. [Citation Graph (, )][DBLP]


  117. Exact numerical computation in algebra and geometry. [Citation Graph (, )][DBLP]


  118. Lower bounds for zero-dimensional projections. [Citation Graph (, )][DBLP]


  119. Foundations of Exact Rounding. [Citation Graph (, )][DBLP]


  120. An Experimental Study of Weighted k-Link Shortest Path Algorithms. [Citation Graph (, )][DBLP]


  121. Classroom examples of robustness problems in geometric computations. [Citation Graph (, )][DBLP]


Search in 0.109secs, Finished in 0.113secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002