Dani Dorfman
Dani Dorfman
Home
Publications
Contact
Light
Dark
Automatic
paper-conference
Minimum-cost paths for electric cars
An electric car equipped with a battery of a finite capacity travels on a road network with an infrastructure of charging stations. …
Dani Dorfman
,
Haim Kaplan
,
Robert E. Tarjan
,
Mikkel Thorup
,
Uri Zwick
PDF
Cite
Optimal energetic paths for electric cars
A weighted directed graph G = (V, A, c), naturally describes a road network in which an electric car, or vehicle (EV), can roam. An arc …
Dani Dorfman
,
Haim Kaplan
,
Robert E. Tarjan
,
Uri Zwick
PDF
Cite
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player
A (φ, ε)-expander decomposition of a graph G (with n vertices and m edges) is a partition of V into clusters V1, . . . , Vk with …
Daniel Agassy
,
Dani Dorfman
,
Haim Kaplan
PDF
Cite
A faster deterministic exponential time algorithm for Energy Games and Mean Payoff Games
We present an improved exponential time algorithm for Energy Games, and hence also for Mean Payoff Games. The running time of the new …
Dani Dorfman
,
Haim Kaplan
,
Uri Zwick
PDF
Cite
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees
We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algorithms for data structure …
Dani Dorfman
,
Haim Kaplan
,
Laszlo Kozma
,
Seth Pettie
,
Uri Zwick
PDF
Cite
Pairing heaps: the forward variant
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. It is remarkable …
Dani Dorfman
,
Haim Kaplan
,
Laszlo Kozma
,
Uri Zwick
PDF
Cite
Cite
×