Research

Research Interests Approximating algorithms for Network design, and wireless computing. Approximating packing and scheduling problems Polyhedra Theory. 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. On-line algorithms. Matroid theory. Mechanism Design, and Algorithmic game theory

List of Publications

Member of Committees: Approx 2007, Approx 2010, ESA 2013.

Grants

Power Point Talks

My CV

My google scholar page:

Here

Teaching

Courses

Talks On Art

Talks on art

Electronic book.

Electronic book