No. Title Author Year
1 Improved Algorithms for Distance Selection and Related Problems Wang, Haitao et al. 2023
2 Computing the Minimum Bottleneck Moving Spanning Tree Wang, Haitao et al. 2022
3 Unit-Disk Range Searching and Applications Wang, Haitao 2022
4 An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons Wang, Haitao 2021
5 Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments Wang, Haitao 2020
6 On the Planar Two-Center Problem and Circular Hulls Wang, Haitao 2020
7 A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains Wang, Haitao 2019
8 Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs Wang, Haitao et al. 2019
9 An O(n log n)-Time Algorithm for the k-Center Problem in Trees Wang, Haitao et al. 2018
10 Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane Wang, Haitao 2017
11 k-Regret Minimizing Set: Efficient Algorithms and Hardness Cao, Wei et al. 2017
12 Quickest Visibility Queries in Polygonal Domains Wang, Haitao 2017
13 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain Won Bae, Sang et al. 2016
14 Dispersing Points on Intervals Li, Shimin et al. 2016
15 epsilon-Kernel Coresets for Stochastic Points Huang, Lingxiao et al. 2016
16 On the Geodesic Centers of Polygonal Domains Wang, Haitao 2016
17 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: 17

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