Due to scheduling conflicts this semester our informal group seminar will meet on Fridays from 3-4 and not in the 11-12 time slot we've had for the past few years. Hopefully, we'll be able to return to our 11-12 slot (followed by group lunch) in the spring. In the meantime, we will try to organize group lunches on Fridays that there are talks. Announcements will be sent to the cstheory mailing list. If you would like to be on the list or to give a talk, please send me email.
Occasionally, talks will be given out of the normal Friday, 3-4 slot. Such talks will be highlighted in yellow.
For information on how to get to HKUST see this.
| Date | Location | Speaker | Title |
| Sept 15, 2006 3-3:50 |
3584 | Siu-Wing Cheng HKUST |
Anisotropic Surface Meshing |
| Sept 22, 2006 3-3:50 |
3584 | Man-Cho Anthony So Stanford |
Stochastic
Combinatorial Optimization: A Survey of Recent Results Slides (PDF) |
Sept 29, 2006 3-3:50 |
3584 |
Li Jian Fudan University |
Traversing the Machining Graph |
| Oct 6 2006 3-3:50 |
|
No Talk Today | |
Wednesday Oct 11, 2006 2-2:50 Note different date, time and venue!! |
3464 |
Sampath Kannan UPenn |
Graph Problems in the Streaming Model |
| Oct 20, 2006 3-3:50 |
3584 |
Wang Yajun HKUST |
Approximate Shortest Paths in Anisotropic Regions |
Oct 27, 2006 3-3:50 |
No Talk Today | ||
Nov 3, 2006 3-3:50 |
No Talk Today | ||
Nov 10, 2006 10-11:30 Note different time and venue!! |
3501 |
Zhen Zhou HKUST |
PhD Thesis Proposal Design and Analysis of Scheduling and Queue Management Schemes for High Performance Switches and Routers |
Nov 17, 2006 3-3:50 |
3584 |
Antoine Vigneron INRA |
Lower bounds for geometric diameter problems |
Nov 24, 2006 3-3:50 |
3584 |
Xiao SUN Ocean University |
Core Stability of Flow
Games Slides (PDF) |
Dec 1, 2006 3-4:30 Note different time and venue!! |
TBA |
Yiu Cho Leung HKUST |
PhD Thesis Proposal Counting Combinatorial Structures in Circulant Graphs |
Dec 6, 2006 2-3:30 Note different date, time and venue!! |
3315 |
Yan Zhang HKUST |
PhD Thesis Proposal Dynamic Programming Speedups |
Wed, Jan 24, 2007 2-3PM Note different date, time and venue!! |
3464 |
Mira Lee TCLAB, KAIST |
Computing a Minimum-Dilation Spanning Tree is NP-hard |