On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs.
Graph partitioning using single commodity flows.
Empirical hardness models: Methodology and a case study on combinatorial auctions.
Quantifying inefficiency in cost-sharing mechanisms.
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes.
The complexity of obstruction-free implementations.