Approximating algorithms for Network
design, and wireless computing.
Approximating of selecting subsets, packing problems
and partitioning of graphs.
Approximating scheduling problems.
Polyhedra Theory.
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.
On-line algorithms.
Matroid theory.
Grants
List of Publications
CV
Google Scholar Citations
Talks and talks about teaching
| Open problems |
Dead Problems Society