Optimal output-sensitive convex hull algorithms in two and three dimensions TM Chan Discrete & Computational Geometry 16 (4), 361-368, 1996 | 512 | 1996 |

More algorithms for all-pairs shortest paths in weighted graphs TM Chan Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 339 | 2007 |

Approximation algorithms for maximum independent set of pseudo-disks TM Chan, S Har-Peled Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009 | 243 | 2009 |

Orthogonal range searching on the RAM, revisited TM Chan, KG Larsen, M Pătraşcu Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011 | 242 | 2011 |

Polynomial-time approximation schemes for packing and piercing fat objects TM Chan Journal of Algorithms 46 (2), 178-189, 2003 | 215 | 2003 |

Output-sensitive results on convex hulls, extreme points, and related problems TM Chan Proceedings of the eleventh annual symposium on Computational geometry, 10-19, 1995 | 188 | 1995 |

Faster core-set constructions and data stream algorithms in fixed dimensions TM Chan Proceedings of the twentieth annual symposium on Computational geometry, 152-159, 2004 | 172 | 2004 |

Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus TM Chan Proceedings of the sixteenth annual symposium on Computational geometry, 300-309, 2000 | 170 | 2000 |

An optimal randomized algorithm for maximum Tukey depth. TM Chan SODA 4, 430-436, 2004 | 157 | 2004 |

Approximate nearest neighbor queries revisited TM Chan Proceedings of the thirteenth annual symposium on computational geometry …, 1997 | 157 | 1997 |

Clustered integer 3SUM via additive combinatorics TM Chan, M Lewenstein Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 148 | 2015 |

Optimal partition trees TM Chan Proceedings of the twenty-sixth annual symposium on Computational geometry, 1-10, 2010 | 137 | 2010 |

Geometric applications of a randomized optimization technique TM Chan Proceedings of the fourteenth annual symposium on Computational geometry …, 1998 | 136 | 1998 |

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling TM Chan, E Grant, J Könemann, M Sharpe Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 133 | 2012 |

All-pairs shortest paths for unweighted undirected graphs in *o*(*mn*) timeTM Chan ACM Transactions on Algorithms (TALG) 8 (4), 1-17, 2012 | 131 | 2012 |

Deterministic apsp, orthogonal vectors, and more: Quickly derandomizing razborov-smolensky TM Chan, R Williams Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 124 | 2016 |

Counting inversions, offline orthogonal range counting, and related problems TM Chan, M Pătraşcu Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 123 | 2010 |

More planar two-center algorithms TM Chan Computational Geometry 13 (3), 189-198, 1999 | 122 | 1999 |

Random Sampling, Halfspace Range Reporting, and Construction of \lowercase-Levels in Three Dimensions TM Chan SIAM Journal on Computing 30 (2), 561-575, 2000 | 121 | 2000 |

Klee's measure problem made easy TM Chan 2013 IEEE 54th annual symposium on foundations of computer science, 410-419, 2013 | 108 | 2013 |