A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (Track B: Automata, Logic, Semantics, and Theory of Programming) D Dorfman, H Kaplan, U Zwick 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 17 | 2019 |
Expander decomposition with fewer inter-cluster edges using a spectral cut player D Agassy, D Dorfman, H Kaplan arXiv preprint arXiv:2205.10301, 2022 | 6 | 2022 |
Improved bounds for multipass pairing heaps and path-balanced binary search trees D Dorfman, H Kaplan, L Kozma, S Pettie, U Zwick arXiv preprint arXiv:1806.08692, 2018 | 5 | 2018 |
Optimal energetic paths for electric cars D Dorfman, H Kaplan, RE Tarjan, U Zwick arXiv preprint arXiv:2305.19015, 2023 | 2 | 2023 |
Pairing heaps: the forward variant D Dorfman, H Kaplan, L Kozma, U Zwick arXiv preprint arXiv:1709.01152, 2017 | 1 | 2017 |
Minimum-cost paths for electric cars D Dorfman, H Kaplan, RE Tarjan, M Thorup, U Zwick 2024 Symposium on Simplicity in Algorithms (SOSA), 374-382, 2024 | | 2024 |