## Discrete Mathematics and Optimization - A Group Meeting

### 2012 Talks

Thursday, December 6, 2012.

Market Clustering and the Fundamental Theorems of Welfare Economics

*Adrian Vetta*

Thursday, November 15, 2012.

A proof of a conjecture of Ohba

*Jonathan Noel*

Thursday, November 1, 2012.

Communication Complexity

*Anil Ada*

Thursday, October 25, 2012.

The mixing time of the Newman-Watts small world

*Tao Lei*

Thursday, October 18, 2012.

A Rounding by Sampling Approach to the Minimum Size k-Arc
Connected Subgraph Problem

*Bundit Laekhanukit*

Thursday, October 11, 2012.

Nearly Tight Linear Programming Bounds for Demand Matching in Bipartite Graphs

*Hehui Wu*

Wednesday, March 21 and Friday, March 24, 2012.

Composition of low-error 2-query PCPs using decodable PCPs

*Bundit Laekhanukit*

Friday, March 9, 2012

The Communication Complexity of Gap Hamming Distance

*Omar Fawzi*

Friday, February 17 and Wednesday, February 22, 2012

A quasi-polynomial Freiman-Ruzsa theorem

*Hamed Hatami*

Friday, January 13, 2012

Hardness of Approximating Rooted k-Connectivity Problems

*Bundit Laekhanukit*