The following pages link to Timothy M. Chan (Q293384):
Displaying 50 items.
- All-pairs shortest paths in geometric intersection graphs (Q2405288) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time (Q2480908) (← links)
- A note on 3D orthogonal graph drawing (Q2486752) (← links)
- On levels in arrangements of curves. II: A simple inequality and its consequences (Q2486864) (← links)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- Fly cheaply: On the minimum fuel consumption problem (Q2775893) (← links)
- Smart-Grid Electricity Allocation via Strip Packing with Slicing (Q2842139) (← links)
- Quake Heaps: A Simple Alternative to Fibonacci Heaps (Q2848964) (← links)
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations (Q2867674) (← links)
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers (Q2872104) (← links)
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set (Q2874591) (← links)
- Linear-Space Data Structures for Range Minority Query in Arrays (Q2904565) (← links)
- Linear-space data structures for range mode query in arrays (Q2904770) (← links)
- Succinct Indices for Path Minimum, with Applications to Path Reporting (Q2921409) (← links)
- On levels in arrangements of surfaces in three dimensions (Q2921675) (← links)
- Finding the shortest bottleneck edge in a parametric minimum spanning tree (Q2921758) (← links)
- Comparison-based time-space lower bounds for selection (Q2930302) (← links)
- On the bichromatic <i>k</i> -set problem (Q2930344) (← links)
- Persistent Predecessor Search and Orthogonal Point Location on the Word RAM (Q2933652) (← links)
- Clustered Integer 3SUM via Additive Combinatorics (Q2941486) (← links)
- Fast String Dictionary Lookup with One Error (Q2942250) (← links)
- Dynamic planar convex hull operations in near-logarithmic amortized time (Q2947001) (← links)
- On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
- Dynamic Connectivity: Connecting to Networks and Geometry (Q3020009) (← links)
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs (Q3053160) (← links)
- Dynamic streaming algorithms for \(\varepsilon\)-kernels (Q3132861) (← links)
- Two approaches to building time-windowed geometric data structures (Q3132862) (← links)
- Instance-Optimal Geometric Algorithms (Q3177884) (← links)
- All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time (Q3189076) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- Dynamic Subgraph Connectivity with Geometric Applications (Q3446813) (← links)
- Multidimensional Range Selection (Q3459852) (← links)
- (Q3549594) (← links)
- More algorithms for all-pairs shortest paths in weighted graphs (Q3549660) (← links)
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time (Q3558019) (← links)
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries (Q3578196) (← links)
- Dynamic subgraph connectivity with geometric applications (Q3579222) (← links)
- (Q3579406) (← links)
- (Q3579415) (← links)
- All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time (Q3581545) (← links)
- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries (Q3581567) (← links)
- (Q3602896) (← links)
- On levels in arrangements of curves, iii (Q3602905) (← links)
- A (slightly) faster algorithm for klee's measure problem (Q3602906) (← links)
- An Improved Algorithm for Online Unit Clustering (Q3608863) (← links)
