Midwest Theory Day 2010
8:30-9:30 Breakfast
Session 1
9:30-10:15 Konstantin Makarychev (IBM Research), "Vertex Sparsifiers and Lipschitz Extendability"
10:15-11:00 Chandra Chekuri (UIUC), "Dependent Randomized Rounding for Matroids and Applications"
11:00-11:20 Gruia Calinescu (IIT), "Minimum Power Strong Connectivity"
11:20-11:40 Alina Ene (UIUC), "Prize-Collecting Steiner Tree and Forest in Planar Graphs"
11:40-12:00 Kyle Fox (UIUC), "Online Scheduling on Indentical Machines using SRPT"
12:00-1:00 Lunch
Session 2
1:00-1:20 Matthew Anderson (University of Wisconsin, Madison), "Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae"
1:20-1:40 Balasubramanian Sivan (University of Wisconsin, Madison), "Single-Call Mechanisms"
1:40-2:00 Eric McDermid (University of Wisconsin, Milwaukee), "Sex-Equal Stable Matchings: Parametrized Complexity and Exact Algorithms"
2:00-2:45 Shuchi Chawla (University of Wisconsin, Madison), "Bayesian Mechanism Design for Budget-Constrained Agents"
2:45-3:30 Anastasios Sidiropoulos (TTIC), "Discrete differentiation and local rigidity of smooth sets in the plane"
3:30-4:00 Coffee Break
Session 3
4:00-4:45 Jason Hartline (Northwestern University), "Truth, Envy, and Profit"
4:45-5:05 Paolo Codenotti (University of Chicago), "Lower bounds for the matrix transposition problem"
5:05-5:25 Despina Stasi (UIC), "Random Horn formulas and propagation connectivity for directed hypergraphs"
5:25-5:45 Junghwan Shin (IIT), "Adversary Games in Secure/Reliable Network Routing"
5:45-6:05 Manolis Pountourakis (Northwestern University), "Group-strategy proof Cost-sharing mechanisms"
7:15 Dinner