Univ. of Waterloo, School of Computer Science

http://www.cs.uwaterloo.ca/~tmchan/

tmchan@math.uwaterloo.ca

Author, editor, or reviewer of:

- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
- A fully dynamic algorithm for planar width
- A note on maximum independent sets in rectangle intersection graphs
- All-pairs shortest paths with real weights in $O(n^3/\log n)$ time
- An optimal randomized algorithm for maximum Tukey depth
- Approximation algorithms for maximum cliques in 3D unit-disk graphs
- Balanced vertex-orderings of graphs
- Closest-point problems simplified on the RAM
- Deterministic algorithms for 2-d convex programming and 3-d online linear programming
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Dynamic subgraph connectivity with geometric applications
- Euclidean bounded-degree spanning tree ratios
- Finding the shortest bottleneck edge in a parametric minimum spanning tree
- Fly cheaply: on the minimum fuel consumption problem
- Geometric applications of a randomized optimization technique
- Low-dimensional linear programming with violations
- More planar two-center algorithms
- Multi-pass geometric algorithms
- On enumerating and selecting distances
- On levels in arrangements of curves
- On levels in arrangements of curves, II: a simple inequality and its consequences
- On levels in arrangements of lines, segments, planes, and triangles
- On levels in arrangements of surfaces in three dimensions
- Output-Sensitive Construction of Convex Hulls
- Output-sensitive results on convex hulls, extreme points, and related problems
- Semi-online maintenance of geometric optima and measures
- Space-efficient algorithms for Klee's measure problem
- Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles