1 citations · 1 across the 1 of their papers we have counts for
4 papers
Optimal energetic paths for electric cars
Dani Dorfman, Haim Kaplan, Robert E. Tarjan +1
A weighted directed graph , where and , describes a road network in which an electric car can roam. An arc models a road segment co…
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player
Daniel Agassy, Dani Dorfman, Haim Kaplan
A -expander-decomposition of a graph (with vertices and edges) is a partition of into clusters with conductance , such that…
Improved bounds for multipass pairing heaps and path-balanced binary search trees
Dani Dorfman, Haim Kaplan, László Kozma +2
We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algorithms for data structure maintenance. The pairing heap is a simple and efficient…
Pairing heaps: the forward variant
Dani Dorfman, Haim Kaplan, László Kozma +1
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. It is remarkable both for its simplicity and for its excellent pe…