No. Title Author Year
1 Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs Chan, Timothy M. et al. 2018
2 Approximation Schemes for 0-1 Knapsack Chan, Timothy M. 2018
3 Dynamic Planar Orthogonal Point Location in Sublogarithmic Time Chan, Timothy M. et al. 2018
4 Subquadratic Encodings for Point Configurations Cardinal, Jean et al. 2018
5 Tree Drawings Revisited Chan, Timothy M. 2018
6 Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry Chan, Timothy M. 2017
7 Dynamic Orthogonal Range Searching on the RAM, Revisited Chan, Timothy M. et al. 2017
8 Faster Approximate Diameter and Distance Oracles in Planar Graphs Chan, Timothy M. et al. 2017
9 Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back Chan, Timothy M. 2017
10 A Clustering-Based Approach to Kinetic Closest Pair Chan, Timothy M. et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 16

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