Short Talks

1) Polylogarithmic Inapproximability of Radio Broadcast

2) Shallow-light k-trees and k-trees for buy at bulk

3) Complete partitions of graphs

4) Finding graphs with maximum number of edges with girth at least g

5) Robust network design with exponential number of scenarios

6) Approximating some network-design problems with node costs

7) Tight approximation Algorithms for connectivity Augmentation problems.

8)Fault tolerant Group Steiner problems.

9) Approximating some network design problems with degree bounds

10) On Set Expansion problems

11) Power optimization for connectivity problems

12) Approximating Source Location and Star SNDP

12) Low Risk Kidney Exchange

13) Integrality gaps for the tree augmentation problem

Long Talks

1) Approximation algorithm for non-uniform multicommodity buy at bulk

2) Multicoloring bounded tree width graphs and planar graphs

3) Approximating the directed version of the Steiner forest problem

4) Increasing the connectivity of a graph from 1 to 2

5) On the Achromatic number problem.

6) The Matroid Secretary problem

7) What did I learn on cut expansion and density problems?

8) On the advantage of overlap for clustering

9) Comparing min cost and min power connectivity problems

10) Approximating Steiner k-Forest and Non preemptive Dial a Ride with almost uniform weights

11) The interesting behavior of the Source location problem

12) Tight running times for exact solutions and approximation algorithms

13) When do weights matter in approximation algorithms?

14)Using fixed parameter tractable or sub exponential time to get better ratios

15) Improved power covering problems via IRR

Survey Talks

1) Multicoloring: problems and techniques

2) Rare Approximation Ratios

3) Survey On Connectivity via Survey of techniques

4) A survey on the Group Steiner Problem In graphs

5) A survey on approximating graph spanners

6) A survey on approximating graph spanners by Mike Dinitz

Talks related to teaching

1) Randomization in algorithms.

2) A talk on random walk with some sample of Markov chains properties

3) Introduction to Combinatorial Auctions

4) The optimal FRT randomized tree. Courtesy of Surrender Baswana I wish to thank him for his nice slides.

5) The generalized Euclid algorithm and modular arithmetic

6) The Chinese Remainder Theorem

7) A half joking talk on algorithms for the layman. Some of the slides are due to Samir Khuller

We are the faculty of art and sciences. So how about some art?

1) Cinema: 60 films that changed cinema

2) Music: My memories of the Beatles

3) Litrature: A homage to Jerome David Salinger