My main area of research is combinatorial optimization and its applications in chip design. Many of the problems arising in this area are NP-hard. Therefore we are interested in approximation algorithms and exact algorithms that have acceptable runtime for problems arising in practice. Two problems I am especially interested in are the Steiner Tree Problem in graphs and the Traveling Salesman Problem.