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


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