Publications

Dani Dorfman, Simon Döring, Martin Herold, Danupon Nanongkai, Daniel Neuen, Joachim Spoerhase, Zihang Wu (2026). Can We Break Fine-Grained and NP-Hardness Barriers if We’ve Seen the Graph Before? The Isomorphic-Priors Model. In FOCS 2026.

Dani Dorfman, Haim Kaplan, Uri Zwick (2026). Improved Bounds for Strategy Improvement Algorithms for Energy Games. In ESA 2026.

PDF Cite Slides

Daniel Agassy, Dani Dorfman, Haim Kaplan (2026). Improved Tree Sparsifiers in Near-Linear Time. In ICALP 2026.

PDF Cite Slides

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick (2025). Faster All-Pairs Optimal Electric Car Routing. In ICALP 2025.

PDF Cite Slides

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick (2024). Minimum-cost paths for electric cars. In SOSA 2024.

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick (2023). Optimal energetic paths for electric cars. In ESA 2023.

Daniel Agassy, Dani Dorfman, Haim Kaplan (2023). Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. In ICALP 2023.

Dani Dorfman, Haim Kaplan, Uri Zwick (2019). A faster deterministic exponential time algorithm for Energy Games and Mean Payoff Games. In ICALP 2019.

Dani Dorfman, Haim Kaplan, Laszlo Kozma, Seth Pettie, Uri Zwick (2018). Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. In ESA 2018.

Dani Dorfman, Haim Kaplan, Laszlo Kozma, Uri Zwick (2018). Pairing heaps: the forward variant. In MFCS 2018.