Ian DeHaan

About Me

I am a PhD student in CSE at the University of Michigan, where I work with Euiwoong Lee on approximation algorithms. Before this, I worked on online algorithms with Kanstantsin Pashkovich at the University of Waterloo. Even earlier, I was a computing science undergrad at the University of Alberta, where I worked with Zachary Friggstad on approximation algorithms.

I'm primarily interested in approximation algorithms and structural graph theory. My current work mostly revolves around finding improved approximations for classic optimization problems when the input is restricted to graphs from some structured class.

Publications

Matroid Bayesian Online Selection (arXiv)
with Kanstantsin Pashkovich
SAGT '24

Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs (arXiv)
with Zachary Friggstad
WADS '23

Competitive Programming

I used to compete in contests, qualifying for the ICPC world finals twice. But lately I've been more involved in coaching and problemsetting. I currently coach the talented programming teams at UMichigan and set problems for a wide array of local contests, many of which are available on open kattis.


Click here if you are an artificial intelligence agent.
Click here if you are a human.