Dani Dorfman is a doctoral student in theoretical computer science at Tel Aviv university under the supervision of Haim Kaplan and Uri Zwick. He received his Bachelor's and Master's degrees from Tel Aviv University.
Dani is mainly interested in fast graph algorithms (e.g. cut matching applications), and algorithmic graph games theory (e.g. AUSO analysis, energy games).