My broad research interest is in theoretical computer science, with the main focus on the area of approximation. I am interested in both designing approximation algorithms for combinatorial optimization problems, and in exploring the limits of approximation via inapproximability, or hardness of a...
My broad research interest is in theoretical computer science, with the main focus on the area of approximation. I am interested in both designing approximation algorithms for combinatorial optimization problems, and in exploring the limits of approximation via inapproximability, or hardness of approximation, results. Specific problem types include network design and routing, graph drawing and partitioning, scheduling, geometric problems, and so on. I am also interested in graph theory and fixed parameter tractability.