dblp.uni-trier.dewww.uni-trier.de

Chee-Keng Yap Vis

Chee Yap

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Pankaj K. Agarwal [87]
2Alok Aggarwal [20] [24] [38] [46]
3Helmut Alt [48]
4Nina Amenta [87]
5Tetsuo Asano [79] [97] [100] [101]
6Ken Been [110]
7Marshall W. Bern [87]
8Ronald V. Book [2]
9Heather Booth [46]
10Michael Burr [123]
11Stephen Cameron [62]
12Timothy M. Chan [75] [82]
13Ee-Chien Chang [71] [84] [91] [94] [98] [106] [109]
14Jyun-Sheng Chang [19] [20] [26]
15Bernard Chazelle [24] [25] [38]
16Jianer Chen [56]
17Jin-San Cheng [119] [124]
18L. Paul Chew [87]
19Youngsong Cho [102]
20Joonsoo Choi [70] [73] [74] [78] [81] [89]
21Sung Woo Choi [106] [109] [123]
22R. Cole [25]
23Richard Cole [13] [15] [18] [22] [29] [30]
24James Cox [59]
25Ovidiu Daescu [105] [112] [113]
26Eli Daiches [110]
27Tamal K. Dey [87]
28David P. Dobkin [28] [87]
29Zilin Du [96] [107]
30Thomas Dubé [68]
31Herbert Edelsbrunner [28] [87]
32Arno Eigenwillig [115]
33Maria Eleftheriou [96]
34David Eppstein [87]
35L. W. Ericson [40]
36Rudolf Fleischer [52] [61]
37Benjamin Galehouse [123]
38Xiao-Shan Gao [119] [124]
39Michael T. Goodrich [49] [64]
40Cindy Grimm (Cindy M. Grimm) [87]
41Leonidas J. Guibas [24] [38] [87]
42Dan Halperin [67] [86]
43John Harer [87]
44Paul Harrington [118]
45Joel Hass [87]
46Andrew Hicks [87]
47Chung-Jen Ho [76]
48Hoon Hong [117]
49Richard Hull [8] [14]
50Christian Icking [65]
51Carroll K. Johnson [87]
52Vijay Karamcheti [88]
53Lutz Kettner [103] [116] [120]
54Deok-Soo Kim [102]
55Donguk Kim [102]
56David G. Kirkpatrick [54] [60] [79] [97] [100] [101]
57Dexter Kozen [23]
58DoYong Kwon [106] [109]
59William J. Lenhart (William Lenhart) [34] [37]
60Gilad Lerman [87]
61David Letscher [87]
62C. Li [88]
63Chen Li [92] [93] [104]
64Long Lin [126]
65S. Maddila [27]
66Kurt Mehlhorn [43] [52] [57] [61] [85] [103] [116] [120]
67Raymond E. Miller [3] [4] [6]
68Bud Mishra (Bhubaneswar Mishra) [45] [54] [60]
69Joseph S. B. Mitchell [105] [112] [113]
70José E. Moreira [96]
71Simeon C. Ntafos [105] [112] [113]
72Colm Ó'Dúnlaing [9] [12] [17] [21] [24] [33] [38] [49] [64] [118]
73Joseph O'Rourke [46]
74Mark H. Overmars [44] [55]
75James D. Palmer [105] [112] [113]
76Hyungju Park [106] [109]
77Igor Pechtchanski [88]
78Sylvain Pion [99] [103] [104] [108] [111] [116] [120]
79Paul E. Plassmann [87]
80Richard Pollack [34] [37]
81Franco P. Preparata [25]
82Günter Rote [52] [61] [65]
83Jörg-Rüdiger Sack [34] [37]
84Stefan Schirra [103] [116] [120]
85Elmar Schömer [77] [80] [90]
86Eric Sedgwick [87]
87Raimund Seidel [34] [37]
88Jürgen Sellen [70] [74] [77] [80] [81] [89] [90]
89Micha Sharir [12] [18] [29] [33] [34] [37]
90Vikram Sharma [107] [115] [121]
91Thomas C. Shermer [85]
92Jack Snoeyink [75] [82] [87]
93Diane L. Souvaine [66] [72]
94Paul G. Spirakis [16]
95Subhash Suri [34] [37] [46]
96Marek Teichmann [77] [80] [90]
97Godfried T. Toussaint [34] [37]
98Daniela Tulone [92]
99Gert Vegter [53]
100Jeff Weeks [87]
101Emo Welzl [52] [61] [65]
102Sue Whitesides [34] [37]
103Derick Wood [36]
104Jihun Yu [125]
105Kwangseok Yu [102]
106Yunyue Zhu [95]
107Denis Zorin [87]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)