No. Title Author Year
1 An O(n log n)-Time Algorithm for the k-Center Problem in Trees Wang, Haitao et al. 2018
2 Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane Wang, Haitao 2017
3 k-Regret Minimizing Set: Efficient Algorithms and Hardness Cao, Wei et al. 2017
4 Quickest Visibility Queries in Polygonal Domains Wang, Haitao 2017
5 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain Won Bae, Sang et al. 2016
6 Dispersing Points on Intervals Li, Shimin et al. 2016
7 epsilon-Kernel Coresets for Stochastic Points Huang, Lingxiao et al. 2016
8 On the Geodesic Centers of Polygonal Domains Wang, Haitao 2016
9 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: 9


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