Office: 319 Business and Science Bldg.
Approximating algorithms for Network
design, and wireless computing.
Approximating of selecting subsets, packing problems
and partitioning of graphs.
Approximating scheduling problems.
Approximating Facility location.
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 approximability.
List of Publications
Google Scholar Citations
Talks and talks about teaching
Dead Problems Society
|SUMMARY 30 YEARS OF RESEARCH|