Some of my presentations:
- 11th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2008
A constant factor approximation
for minimum λ-edge-connected κ-subgraph with metric costs (pdf file)
- Workshop on Approximation Algorithms, Montreal, June 12-14,
2006:
Approximation and Hardness Results for
Packing Cycles (powerpoint file)
- University of Southern California (USC) and University of
California at Los Angeles (UCLA), May 2006:
Approximation
Algorithms for Non-uniform Buy-at-Bulk Network Design Problems (powerpoint file)
- One-day workshop at School of
Computer Science, Inst. for Theoretical Physics and Math (IPM), Tehran,
Jan 2006:
Approximaion
Algorithms and Hardness of Approximation (pdf
file)
- 8th. International
Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX 2005):
Packing Element-Disjoint
Steiner Trees (powerpoint file)
- Microsoft Research, Redmond, Aug 2005:
Approximability of
Unique-Coverage Problem (pdf file)
- 12th Annual European Symposium on Algorithms (ESA
2004):
Hardness and Approximation
Results for Packing Steiner Trees (pdf file)
- Department
of Combinatorics and Optimization, Waterloo, Aug 2004:
Packing Steiner Trees (pdf file)
- 14th
ACM-SIAM Symposium on Discrete Algorithms (SODA 2003):
A
(1+ε)-Approximation Algorithm for Partitioning Hypergraphs Using A New
Algorithmic Version of the Lovasz Local Lemma (pdf
file)
- 10th European Symposium on Algorithms (ESA 2002):
Frequency Channel Assignment on
Planar Networks (ps file)