No. Title Author Year
1 A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains Wang, Haitao 2019
2 Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs Wang, Haitao et al. 2019
3 An O(n log n)-Time Algorithm for the k-Center Problem in Trees Wang, Haitao et al. 2018
4 Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane Wang, Haitao 2017
5 k-Regret Minimizing Set: Efficient Algorithms and Hardness Cao, Wei et al. 2017
6 Quickest Visibility Queries in Polygonal Domains Wang, Haitao 2017
7 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain Won Bae, Sang et al. 2016
8 Dispersing Points on Intervals Li, Shimin et al. 2016
9 epsilon-Kernel Coresets for Stochastic Points Huang, Lingxiao et al. 2016
10 On the Geodesic Centers of Polygonal Domains Wang, Haitao 2016
Current Page :
Number of result pages: 2
Number of documents: 11


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