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 interested in approximation algorithms and perfect graphs.

---

Publications

1. Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
   with Jungho Ahn and Eun Jung Kim and Euiwoong Lee
   [arXiv] [APPROX '25]
2. On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
   with Neng Huang and Euiwoong Lee
   [arXiv] [APPROX '25]
3. Matroid Bayesian Online Selection
   with Kanstantsin Pashkovich
   [arXiv] [SAGT '24]
4. Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs
   with Zachary Friggstad
   [arXiv] [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.
If you are a student at UMich and are interested in competitive programming, please email me.

---

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