Research Interests



My research involves applying various theories of computational complexity (NP-completeness, parameterized complexity, polynomial-time approximation) to the analysis of problems from various disciplines, both as an aid to characterizing the sources of intractability in these problems and designing the most efficient algorithms possible for these problems. Problem-areas I have worked on in the last five years are as follows:

Created: December 5, 2007
Last Modified: October 23, 2017