Speakers |
 Ryerson Hall |
To date (October, 2007) the following have accepted.
- Sourav Chakraborty,
University of Chicago
Property
Testing of ST-Connectivity in the Orientation Model
- Erin Wolf
Chambers, University of Illinois at Urbana-Champaign
Walking Your
Dog in the Woods in Polynomial Time
- Christine Calynn Tan
Cheng, University of Wisconsin-Milwaukee
The Generalized Median
Stable Matchings: Finding Them Is Not That Easy
- Bhaskar DasGupta,
University of Illinois at Chicago
On Approximating
Transitive Reduction Problems for Biological and Social
Networks: What Can We Get from a Primal-Dual Formulation of Edmond
and Karp?
- Scott Diehl,
University of Wisconsin-Madison
A New Time-Space
Lower Bound for Nondeterministic Algorithms Solving
Tautologies
- Matt Gibson,
University of Iowa
On Clustering to Minimize
the Sum of Radii
- Judy Goldsmith,
University of Kentucky
Competition Adds
Complexity
- Nitish Korula,
University of Illinois, Urbana-Champaign
Better Approximations for
Orienteering With Time Windows
- Raghav
Kulkarni,University of Chicago
Deterministically
Isolating a Perfect Matching in Bipartite Planar Graphs
- Marina Langlois,
University of Illinois at Chicago
Combinatorial
Problems for Horn Clauses
- Imran A. Pirwani,
University of Iowa
Good Quality
Realization of Unit Disk Graphs
- Michael
Skalak, Northwestern University
An Improved
Algorithm for a Haplotype Inference Problem
- Haitao Wang, University of Notre Dame
Online Rectangle
Filling