Presentation Schedule (First set)
| Date | Topic | Presenter | |
|---|---|---|---|
| 1 | 3/30 | Sum queries and updates on a tree (instead of an array) | Jared Kim |
| 2 | 3/30 | Maximum unit circle cover | Angus Lim |
| 3 | 3/30 | Semi-circle polygon intersection | Mark Leyfman |
| 4 | 3/30 | Largest quadrilateral in a convex polygon | Kuba Karpierz |
| 5 | 4/1 | Large bipartite subgraphs in linear time | Farzad Fallahi |
| 6 | 4/1 | BITs and Seg. Trees in 2D | Carolyn Shen |
| 7 | 4/1 | Heavy-light decomposition | Nathan Chow |
| 8 | 4/1 | Segment stabbing queries on a set of intervals | Jeremy Goh |
| 9 | 4/8 | Edmond’s blossom algorithm | Kristina Nelson |
| 10 | 4/8 | Largest sum paths in an array | Akshat Divekar |
| 11 | 4/8 | Hopcroft-Karp matching algorithm | Kyle Malong |
| 12 | 4/8 | 3D convex hulls | Michael Moritsugu |
| 13 | 4/10 | Range updates in segment trees | Jason Chiu |
| 14 | 4/10 | Slope statistics of a point set | John He |
| 15 | 4/10 | Efficient 2-SAT | Bo Gong |
Presentation Schedule (First set)
| Date | Topic | Presenter | |
|---|---|---|---|
| 1 | 2/4 | Facebook Hacker cup round 1 Q3 | Mark Leyfman |
| 2 | 2/4 | Johnson’s Algorithm | Nathan Chow |
| 3 | 2/4 | LIS and Patience Sorting | Akshat Divekar |
| 4 | 2/4 | Creating SSCs with minimum edge additions | Farzad Fallahi |
| 5 | 2/6 | Second shortest paths | Kristina Nelson |
| 6 | 2/6 | Disjoint path pairs of odd degree | Carolyn Shen |
| 7 | 2/6 | Efficient Euler Tours | Angus Lim |
| 8 | 2/6 | Tarjan’s bridge and cut vertex detection | Kyle Malong |
| 9 | 2/11 | Bounded output LCS | Kuba Karpierz |
| 10 | 2/11 | Centroid tree splitting | Jason Chiu |
| 11 | 2/11 | Suurballe’s Algorithm | Michael Moritsugu |
| 12 | 2/11 | The KMP Algorithm | Jared Kim |
| 13 | 2/13 | The CYK Algorithm and Context Free Grammars | John He |
| 14 | 2/13 | Efficient LCA queries | Bo Gong |
| 15 | 2/13 | Hashing and Rabin-Karp | Jeremy Goh |