Program
11:00-11:30am |
Compressed Text Indexing and Range Searching (Abstract) |
LWSN 1142 |
Rahul Shah (Purdue University) |
11:30am-12noon |
On computing the distinguishing numbers of planar graphs and beyond: a counting approach (Abstract) |
LWSN 1142 |
Christine Cheng (University of Wisconsin, Milwaukee) |
| noon-1:00pm |
Lunch |
| LWSN Commons (adjacent to LWSN 1142) | Lunch (provided) will be a buffet prepared by Camille's Cafe. |
1:00-2:00pm |
Distinguished Invited Lecture: Approximation Algorithms via Dependent Randomized Rounding (Abstract) |
LWSIN 1142 |
Aravind Srinivasan (Univ. of Maryland, College Park) |
| 2:00-2:30pm |
Coffee Break |
| LWSN Commons (adjacent to LWSN 1142) | |
2:30-3:00pm |
Maximizing a Submodular Set Function subject to a Matroid Constraint (Abstract) |
LWSN 1142 |
Chandra Chekuri (Univ. of Illinois at Urbana Champaign) |
3:00-3:30pm |
Points on Computable Curves(Abstract) |
LWSN 1142 |
Xiaoyang Gu (Iowa State University) |
3:30-4:00pm |
Optimizing Large Data Transfers in Parity-Declustered Data Layouts (Abstract) |
LWSN 1142 |
Eric Schwabe (DePaul University) |
| 4:00-4:30pm |
Coffee Break |
| LWSN Commons (adjacent to LWSN 1142) | |
4:30-5:00pm |
List-coloring the Square of a Subcubic Graph (Abstract) |
LWSN 1142 |
Dan Cranston(University of Illinois at Urbana Champaign) |
5:00-5:30pm |
Finding Highest-Scoring Forbidden-Pairs Paths With Variable Vertex Weights(Abstract) |
LWSN 1142 |
Matt Goto (DePaul University) |
5:30-6:00pm |
Improved Random graph Isomorphism(Abstract) |
LWSN 1142 |
Tomek Czajka (Purdue University) |