No. Title Author Year
1 Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs Har-Peled, Sariel et al. 2022
2 Improved Approximation Algorithms for Tverberg Partitions Har-Peled, Sariel et al. 2021
3 On Undecided LP, Clustering and Active Learning Ashur, Stav et al. 2021
4 Reliable Spanners for Metric Spaces Har-Peled, Sariel et al. 2021
5 Stabbing Convex Bodies with Lines and Flats Har-Peled, Sariel et al. 2021
6 Active Learning a Convex Body in Low Dimensions Har-Peled, Sariel et al. 2020
7 Fast Algorithms for Geometric Consensuses Har-Peled, Sariel et al. 2020
8 Sometimes Reliable Spanners of Almost Linear Size Buchin, Kevin et al. 2020
9 Submodular Clustering in Low Dimensions Backurs, Arturs et al. 2020
10 A Spanner for the Day After Buchin, Kevin et al. 2019
11 Journey to the Center of the Point Set Har-Peled, Sariel et al. 2019
12 Smallest k-Enclosing Rectangle Revisited Chan, Timothy M. et al. 2019
13 Approximate Sparse Linear Regression Har-Peled, Sariel et al. 2018
14 Edge Estimation with Independent Set Oracles Beame, Paul et al. 2018
15 On Locality-Sensitive Orderings and Their Applications Chan, Timothy M. et al. 2018
16 Stabbing Pairwise Intersecting Disks by Five Points Har-Peled, Sariel et al. 2018
17 Separating a Voronoi Diagram via Local Search Bhattiprolu, Vijay V. S. P. et al. 2016
18 From Proximity to Utility: A Voronoi Partition of Pareto Optima Chang, Hsien-Chih et al. 2015
19 Shortest Path in a Polygon using Sublinear Space Har-Peled, Sariel 2015
20 Space Exploration via Proximity Search Har-Peled, Sariel et al. 2015
21 Robust Proximity Search for Balls Using Sublinear Space Har-Peled, Sariel et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 21

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