Spring 2010 CSE642 Algorithm Seminar

Locations and Hours:

Friday 11:00 -12:30 @ Computer Science Lounge (CS Building 1211).

Course Description:

This reading group provides a meeting place for Stony Brook faculty, postdocs, and students interested in the analysis of algorithms. We meet once a week, with one of three different missions:

You can get one credit for participating by simply registering for CSE 642. You are also welcome to come without registering. 

We have a mailing list. Further announcement will be distributed through the list. Please subscribe here.  


Reading lists:
  1. A Stackelberg Strategy for Routing Flow over Time, U. Bhaskar, L.Fleischer, E. Anshelevic, SODA'11.
  2. Shortest Non‐Crossing Walks in the Plane, J.Erickson, A. Nayyer, SODA'11.
  3. On the Complexity of Time‐Dependent Shortest Paths, L. Foschini, J. Hershberger, S. Suri, SODA'11.
  4. Dimensionality Reduction: Beyond the Johnson‐Lindenstrauss Bound, Y. Bartal, B. Recht, L. Schulman, SODA'11.
  5. Computing Replacement Paths in Surface Embedded Graphs, J. Erickson, A. Nayyeri, SODA'11.
  6. On Succinct Convex Greedy Drawing of 3-Connected Plane Graphs, Xin He, Huaming Zhang, SODA'11.
  7. Triangulating the Square and Squaring the Triangle, Quadtrees and Delaunay Triangulations are Equivalent, Maarten Loffler, Wolfgang Mulzer, SODA'11.
Past offerings: