The following pages link to Timothy M. Chan (Q293384):
Displaying 50 items.
- (Q5171169) (← links)
- Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions (Q5199242) (← links)
- Closest Pair and the Post Office Problem for Stochastic Points (Q5199272) (← links)
- Subquadratic encodings for point configurations (Q5207874) (← links)
- (Q5240419) (← links)
- Low-Dimensional Linear Programming with Violations (Q5317180) (← links)
- Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus (Q5361541) (← links)
- A fully dynamic algorithm for planar (Q5361574) (← links)
- Euclidean bounded-degree spanning tree ratios (Q5361599) (← links)
- Faster core-set constructions and data stream algorithms in fixed dimensions (Q5361667) (← links)
- Towards in-place geometric algorithms and data structures (Q5361676) (← links)
- Speeding up the Four Russians Algorithm by About One More Logarithmic Factor (Q5363082) (← links)
- (Q5365104) (← links)
- Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings (Q5368723) (← links)
- (Q5368724) (← links)
- A Clustering-Based Approach to Kinetic Closest Pair (Q5369530) (← links)
- Multi-pass geometric algorithms (Q5370611) (← links)
- Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection (Q5370702) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q5370733) (← links)
- Selection and Sorting in the “Restore” Model (Q5384036) (← links)
- Algorithms and Data Structures (Q5394260) (← links)
- Orthogonal range searching on the RAM, revisited (Q5404401) (← links)
- Three problems about dynamic convex hulls (Q5404404) (← links)
- Stochastic minimum spanning trees in euclidean spaces (Q5404409) (← links)
- Optimal partition trees (Q5405856) (← links)
- (Q5417615) (← links)
- A Randomized Algorithm for Online Unit Clustering (Q5443514) (← links)
- Dynamic Connectivity for Axis-Parallel Rectangles (Q5449513) (← links)
- Necklaces, Convolutions, and X + Y (Q5449525) (← links)
- GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS (Q5470168) (← links)
- (Q5501289) (← links)
- (Q5501824) (← links)
- Algorithms and Computation (Q5712115) (← links)
- How to Morph Planar Graph Drawings (Q5737811) (← links)
- Adaptive and Approximate Orthogonal Range Counting (Q5741726) (← links)
- Morphing Planar Graph Drawings with a Polynomial Number of Steps (Q5741828) (← links)
- (Q5743501) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- (Q5874497) (← links)
- Drawing Partially Embedded and Simultaneously Planar Graphs (Q5892028) (← links)
- Range closest-pair search in higher dimensions (Q5896868) (← links)
- Drawing Partially Embedded and Simultaneously Planar Graphs (Q5899628) (← links)
- On approximate range counting and depth (Q5901406) (← links)
- LATIN 2004: Theoretical Informatics (Q5901636) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- (Q6059975) (← links)
- (Q6059976) (← links)
- (Q6075915) (← links)
- Dynamic Colored Orthogonal Range Searching. (Q6075916) (← links)
- (Q6104077) (← links)
