Office: 319 Business and Science Bldg.
Approximating algorithms for Network
design, and wireless computing.
Approximating of packing and scheduling problems
Approximating Facility location problems.
Approximating cut and flow problems.
Lower bounds for approximating NP-hard problems.
The use of randomization in computer science
and in particular the probabilistic method.
Fix parameter tractability and inapproximability.
Mechanism Design, and
Algorithmic game theory
List of Publications
Member of Committees: Approx 2007, Approx 2010, ESA 2013.
Power Point Talks
My google scholar page: