28 citations · 244 across the 83 of their papers we have counts for
5 papers · 1 filter
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays
Yossi Azar, Ashish Chiplunkar, Haim Kaplan
We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) recently introduced by Emek et al, (STOC 2016). This problem is defined on an underlying -point me…
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
Haim Kaplan, Wolfgang Mulzer, Liam Roditty +2
We describe a new data structure for dynamic nearest neighbor queries in the plane with respect to a general family of distance functions. These include -norms and additively…
Spanners for Directed Transmission Graphs
Haim Kaplan, Wolfgang Mulzer, Liam Roditty +1
Let be a planar -point set such that each point has an associated radius . The transmission graph for is the directed graph w…
Reachability Oracles for Directed Transmission Graphs
Haim Kaplan, Wolfgang Mulzer, Liam Roditty +1
Let be a set of points in dimensions such that each point has an associated radius . The transmission graph for is the d…
Approximating the -Level in Three-Dimensional Plane Arrangements
Sariel Har-Peled, Haim Kaplan, Micha Sharir
$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\m…