The following pages link to Timothy M. Chan (Q293384):
Displaying 50 items.
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (Q390131) (← links)
- Optimal partition trees (Q420575) (← links)
- On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Linear-space data structures for range minority query in arrays (Q494786) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- Dynamic data structures for approximate Hausdorff distance in the word RAM (Q680153) (← links)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Dynamic coresets (Q834605) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Multi-pass geometric algorithms (Q866973) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Drawing \(K_{2,n}\): A lower bound (Q1007548) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- An improved algorithm for online unit clustering (Q1040649) (← links)
- (Q1380806) (redirect page) (← links)
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams (Q1380808) (← links)
- On levels in arrangements of curves (Q1404507) (← links)
- A fully dynamic algorithm for planar width (Q1404528) (← links)
- Reporting curve segment intersections using restricted predicates (Q1581057) (← links)
- An improved approximation algorithm for the discrete Fréchet distance (Q1653046) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- Euclidean bounded-degree spanning tree ratios (Q1762944) (← links)
- Fun-Sort -- or the chaos of unordered binary search (Q1765229) (← links)
- (Q1775058) (redirect page) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings (Q1862119) (← links)
- More planar two-center algorithms (Q1961384) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- More on change-making and related problems (Q2051861) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- Tree drawings revisited (Q2189731) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Orthogonal range reporting and rectangle stabbing for fat rectangles (Q2285096) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
- Finding median in read-only memory on integer input (Q2342680) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
