No. Title Author Year
1 Approximation Schemes for 0-1 Knapsack Chan, Timothy M. 2018
2 Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry Chan, Timothy M. 2017
3 Dynamic Orthogonal Range Searching on the RAM, Revisited Chan, Timothy M. et al. 2017
4 Faster Approximate Diameter and Distance Oracles in Planar Graphs Chan, Timothy M. et al. 2017
5 Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back Chan, Timothy M. 2017
6 A Clustering-Based Approach to Kinetic Closest Pair Chan, Timothy M. et al. 2016
7 All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time Chan, Timothy M. et al. 2016
8 Dynamic Streaming Algorithms for Epsilon-Kernels Chan, Timothy M. 2016
9 Two Approaches to Building Time-Windowed Geometric Data Structures Chan, Timothy M. et al. 2016
10 A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions Chan, Timothy M. 2015
Current Page :
Number of result pages: 2
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint Published by LZI