| No. |
Title |
Author |
Year |
| 1 |
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths |
Chan, Timothy M. et al. |
2021 |
| 2 |
All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error |
Chan, Timothy M. |
2021 |
| 3 |
Dynamic Colored Orthogonal Range Searching |
Chan, Timothy M. et al. |
2021 |
| 4 |
Faster Algorithms for Largest Empty Rectangles and Boxes |
Chan, Timothy M. |
2021 |
| 5 |
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time |
Chan, Timothy M. et al. |
2021 |
| 6 |
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points |
Chan, Timothy M. et al. |
2021 |
| 7 |
Faster Approximation Algorithms for Geometric Set Cover |
Chan, Timothy M. et al. |
2020 |
| 8 |
Further Results on Colored Range Searching |
Chan, Timothy M. et al. |
2020 |
| 9 |
More on Change-Making and Related Problems |
Chan, Timothy M. et al. |
2020 |
| 10 |
Computing Shapley Values in the Plane |
Cabello, Sergio et al. |
2019 |
| 11 |
Dynamic Geometric Data Structures via Shallow Cuttings |
Chan, Timothy M. |
2019 |
| 12 |
Smallest k-Enclosing Rectangle Revisited |
Chan, Timothy M. et al. |
2019 |
| 13 |
Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs |
Chan, Timothy M. et al. |
2018 |
| 14 |
Approximation Schemes for 0-1 Knapsack |
Chan, Timothy M. |
2018 |
| 15 |
Dynamic Planar Orthogonal Point Location in Sublogarithmic Time |
Chan, Timothy M. et al. |
2018 |
| 16 |
On Locality-Sensitive Orderings and Their Applications |
Chan, Timothy M. et al. |
2018 |
| 17 |
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d |
Chan, Timothy M. et al. |
2018 |
| 18 |
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity |
Chan, Timothy M. et al. |
2018 |
| 19 |
Subquadratic Encodings for Point Configurations |
Cardinal, Jean et al. |
2018 |
| 20 |
Tree Drawings Revisited |
Chan, Timothy M. |
2018 |
| 21 |
Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry |
Chan, Timothy M. |
2017 |
| 22 |
Dynamic Orthogonal Range Searching on the RAM, Revisited |
Chan, Timothy M. et al. |
2017 |
| 23 |
Faster Approximate Diameter and Distance Oracles in Planar Graphs |
Chan, Timothy M. et al. |
2017 |
| 24 |
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back |
Chan, Timothy M. |
2017 |
| 25 |
A Clustering-Based Approach to Kinetic Closest Pair |
Chan, Timothy M. et al. |
2016 |
| 26 |
All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time |
Chan, Timothy M. et al. |
2016 |
| 27 |
Dynamic Streaming Algorithms for Epsilon-Kernels |
Chan, Timothy M. |
2016 |
| 28 |
Two Approaches to Building Time-Windowed Geometric Data Structures |
Chan, Timothy M. et al. |
2016 |
| 29 |
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions |
Chan, Timothy M. |
2015 |
| 30 |
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings |
Chan, Timothy M. et al. |
2015 |
