The following pages link to Timothy M. Chan (Q293384):
Displaying 16 items.
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
- On the bichromatic \(k\)-set problem (Q6486951) (← links)
- On the number of incidences when avoiding an induced biclique in geometric settings (Q6538578) (← links)
- Simplex range searching revisited: how to shave logs in multi-level data structures (Q6538582) (← links)
- Finding triangles and other small subgraphs in geometric intersection graphs (Q6538602) (← links)
- Reducing \textsf{3SUM} to \textsf{Convolution-3SUM} (Q6538723) (← links)
- Dynamic generalized closest pair: revisiting Eppstein's technique (Q6538728) (← links)
- On the change-making problem (Q6538729) (← links)
- Simpler reductions from exact triangle (Q6545099) (← links)
- Hopcroft's problem, log-star shaving, 2D fractional cascading, and decision trees (Q6575080) (← links)
- Dynamic geometric set cover, revisited (Q6575220) (← links)
- Constant-hop spanners for more geometric intersection graphs, with even smaller size (Q6620511) (← links)
- Minimum \(L_\infty\) Hausdorff distance of point sets under translation: g eneralizing Klee's measure problem (Q6620512) (← links)
- On the fine-grained complexity of small-size geometric set cover and discrete \(k\)-center for small \(k\) (Q6638031) (← links)
- An optimal algorithm for higher-order Voronoi diagrams in the plane: the usefulness of nondeterminism (Q6645526) (← links)
- On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects (Q6757222) (← links)
