Dani Dorfman

15 papers A* 3A 2B 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Expander Decomposition for Non-Uniform Vertex Measures.
CoRR
Daniel Agassy, Dani Dorfman, Haim Kaplan
2025 A* conf
Faster All-Pairs Optimal Electric Car Routing.
ICALP
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025 J jnl
Faster All-Pairs Optimal Electric Car Routing.
CoRR
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025 J jnl
Improved Tree Sparsifiers in Near-Linear Time.
CoRR
Daniel Agassy, Dani Dorfman, Haim Kaplan
2024 — conf
Minimum-cost paths for electric cars.
SOSA
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2024 J jnl
Minimum-cost paths for electric cars.
CoRR
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2023 A* conf
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player.
ICALP
Daniel Agassy, Dani Dorfman, Haim Kaplan
2023 A conf
Optimal Energetic Paths for Electric Cars.
ESA
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2023 J jnl
Optimal energetic paths for electric cars.
CoRR
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2022 J jnl
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player.
CoRR
Daniel Agassy, Dani Dorfman, Haim Kaplan
2019 A* conf
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games.
ICALP
Dani Dorfman, Haim Kaplan, Uri Zwick
2018 A conf
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees.
ESA
Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018 J jnl
Improved bounds for multipass pairing heaps and path-balanced binary search trees.
CoRR
Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018 B conf
Pairing heaps: the forward variant.
MFCS
Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2017 J jnl
Pairing heaps: the forward variant.
CoRR
Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick