Email: delhersh@gmail.com Office: Hauptgebäude G 22.3

Hi there!

I am a postdoc in the ETH Zürich Math Department where I’m lucky to be hosted by Rico Zenklusen in the Mathematical Optimization Group.

I’m broadly interested in theoretical computer science but I’m especially keen on graph-theoretic questions in approximation algorithms, online algorithms, distributed algorithms and metric embeddings. Lately, I’ve been spending a lot of time thinking about how to compactly represent various properties of graphs.

I’m thrilled to be joining the Brown University Computer Science Department as an assistant professor starting Fall 2023. If you’re a current / prospective undergraduate / graduate Brown student interested in doing research on algorithms, send me an email!

I completed my PhD in computer science in the Carnegie Mellon Computer Science Department where I was very fortunate to be advised by Bernhard Haeupler and R. Ravi.

Recent Publications

Some recent publications that I’m particularly excited about and or actively working on.

Maximum Length-Constrained Flows and Disjoint Paths...STOC 2023
with Bernhard Haeupler, Thatchaphol Saranurak
(Symposium on Theory of Computing)
[pdf]

O(1) Steiner Point Removal in Series-Parallel GraphsESA 2022
with Jason Li
(European Symposium on Algorithms)
[pdf]

Tree Embeddings for Hop-Constrained Network DesignSTOC 2021
with Bernhard Haeupler, Goran Zuzic
(Symposium on Theory of Computing)
[pdf]