
Fractional Set Cover in the Streaming Model.
APPROX 2017. Slides

Towards Tight Bounds for the Streaming Set Cover Problem.
PODS 2016. Slides

On Streaming and Communication Complexity of The Set Cover Problem.
DISC 2014. Slides

Improved Approximation Algorithms for Degreebounded Network Design Problems with Node Connectivity Requirements.
STOC 2014. Slides

Approximation Algorithm for Degreebounded Network Design Problems.
Sharif UT, December 2013. Slides

Improved Approximation Algorithm for MinCost kconnected Spanning Subgraph Problem.
UIUC theory seminar, February 2013.

Prizecollecting Survivable Network Design in Nodeweighted Graphs.
APPROX/RANDOM 2012. Slides
UIUC theory seminar, September 2012. Slides

Nodeweighted Network Design in Planar and Minorclosed Families of Graphs.
UIUC theory seminar, February 2012.
