Schedule of Events

Ryerson Hall

Saturday, November 17, 2007

10:00-10:20 Coffee will be served in Ryerson 255.
10:20-10:40: Christine Cheng, The Generalized Median Stable Matchings: Finding Them Is Not That Easy
10:40-11:00: Sourav Chakraborty, Property Testing of ST-Connectivity in the Orientation Model
11:00: Break
11:20-11:40: Michael Skalak, An Improved Algorithm for a Haplotype Inference Problem
11:40-12:00: Erin Wolf Chambers, Walking Your Dog in the Woods in Polynomial Time
12:00-12:20: Matt Gibson, On Clustering to Minimize the Sum of Radii
12:20-2:00: Lunch will be in Ryerson 255.
2:00-2:20: Scott Diehl, A New Time-Space Lower Bound for Nondeterministic Algorithms Solving Tautologies
2:20-2:40: Marina Langlois, Combinatorial Problems for Horn Clauses
2:40-3:00: Judy Goldsmith, Competition Adds Complexity
3:00-3:20: Break
3:20-3:40: Imran Pirwani, Good Quality Realization of Unit Disk Graphs
3:40-4:00: Raghav Kulkarni, Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
4:00-4:20: Haitao Wang, Online Rectangle Filling
4:20-4:40: Break
4:40-5:00: Bhaskar DasGupta, On Approximating Transitive Reduction Problems for Biological Networks: What Can We Get From a Primal-Dual Formulation of Edmond and Karp
5:00-5:20: Nitish Korula, Better Approximations for Orienteering With Time Window
6:00: Dinner Site to be determined