33 citations · 45 across the 30 of their papers we have counts for
5 papers · 1 filter
Halving by a Thousand Cuts or Punctures
Sariel Har-Peled, Da Wei Zheng
For point sets $P_1, \ldots, P_\…
Revisiting Random Points: Combinatorial Complexity and Algorithms
Sariel Har-Peled, Elfarouk Harb
Consider a set of points picked uniformly and independently from for a constant dimension -- such a point set is extremely well behaved in many aspects. For e…
Sparsifying Disk Intersection Graphs for Reliable Connectivity
Sariel Har-Peled, Eliot Wong Robson
The intersection graph induced by a set $\Disks$ of disks can be dense. It is thus natural to try and sparsify it, while preserving connectivity. Unfortunately, sparse graphs c…
Local Spanners Revisited
Stav Ashur, Sariel Har-Peled
For a set of points …
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
Sariel Har-Peled, Everett Yang
We present a -approximation algorithms for maximum cardinality matchings in disk intersection graphs -- all with near linear running time. We also present estimat…