Dani Dorfman

Dani Dorfman

CS PhD student

Tel Aviv University University

Biography

I’m a CS PhD student at Tel Aviv University. My research interests lie in optimization and the design and analysis of algorithms.

Interests
  • Graph theory
  • Optimization
  • Mean payoff games, Energy games
Education

  • PhD in CS, 2019-now

    Tel Aviv University

  • Msc in CS, 2018

    Tel Aviv University

  • BSc in CS and Math, 2017

    Tel Aviv University

Publications

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

PDF Cite

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

PDF Cite

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

PDF Cite

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

PDF Cite

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.

PDF Cite

See all publications

Contact

Feel free to email/text me or just reach to my office :)