TIME 
SPEAKER 
TITLE 
January 18, Wednesday 
Benoit Hudson 
TimeOptimal Incremental Delaunay Refinement 
January 25, Wednesday 
Abie Flaxman 
Averagecase analysis for combinatorial
search and the subset sum problem 
February 1, Wednesday 
Adam Wierman 
Understanding the effects of SMART scheduling 
February 8, Wednesday 
Todd Phillips 
Data Structures for Cellular Decompositions 
February 15, Wednesday 
Mohit Singh 
Delegate and Conquer: An
LPbased approximation algorithm for Minimum Degree MSTs 
February 22, Wednesday 
Abie Flaxman 
Handy distributions for averagecase analysis 
March 1, Wednesday 
Srinath Sridhar 
Parameterized Algorithms for
Steiner Tree Variants 
March 8, Wednesday 
Mohammad Taghi Hajiaghayi 
Plane embeddings of planar graph metrics 
March 15, Wednesday 
No Theory Lunch 
No Theory Lunch 
March 22, Wednesday 
Jure Leskovec 
Realistic models for graphs over time 
March 29, Wednesday 
Mugizi Rwebangira 
A RandomSurfer WebGraph Model 
April 5, Wednesday 
Ryan Williams 
Using Linear Algebra for Faster Solution of NPhard Problems

April 12, Wednesday 
Varun Gupta 
A gentle introduction to fluid and diffusion limits
for queues 
April 19, Wednesday 
DoruChristian Balcan 
Error Correcting by Linear Programming 
April 26, Wednesday 
Jonathan Derryberry 
Lower Bounds for the Binary Search Tree Model 
May 3, Wednesday 
Kirk Pruhs 
Cake Cutting is and is not a Piece of Cake 
May 10, Wednesday 
Katrina Ligett 
Truthful, NearOptimal Mechanism Design 
May 17, Wednesday 
Abie Flaxman 
Expansion and lack thereof in perturbed random graphs 