Dani Dorfman

According to our database, Dani Dorfman authored at least 6 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Minimum-cost paths for electric cars.

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player.

Daniel Agassy, Dani Dorfman, Haim Kaplan

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Optimal Energetic Paths for Electric Cars.

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2019

A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games.

Dani Dorfman, Haim Kaplan, Uri Zwick

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Pairing heaps: the forward variant.

Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees.

Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick

Proceedings of the 26th Annual European Symposium on Algorithms, 2018