Dani Dorfman

Dani Dorfman

Postdoctoral researcher

Max Plank Institute for Informatics

Biography

I’m a Postdoc researcher at Max Plank Institure for Informatics, Saarbrüken. 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-2024

    Tel Aviv University

  • Msc in CS, 2018

    Tel Aviv University

  • BSc in CS and Math, 2017

    Tel Aviv University

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.

PDF Cite

See all publications

Contact

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