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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI