Konstantin Makarychev has been awarded an IBM Fellowship for the 2006-07 academic year. He is working in the area of approximation algorithms and metric embeddings, and is particularly interested in algorithms for constraint satisfaction problems.

His advisor is Moses Charikar.