#project-tcs is a studygroup dedicated to study recent theoretical advances in computer science.
| Display name | Name | Period |
|---|---|---|
| koosaga | Jaehyun Koo | S1 |
| 300iq | Ildar Gainullin | S1 |
| Aeren | Yonghyun An | S1 |
| gritukan | Grigory Reznikov | S1 |
| Kim Taeyeon | Harris Leung | S1 |
| TAMREF | Changki Yun | S1 |
Tentative lectures are denoted in italic.
- Week 1 (7/23) - Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms (Host: koosaga) (V)
- Week 2 (7/30) - A Naive Algorithm for Feedback Vertex Set (Host: 300iq) (V)
- Week 3 (8/13) - The Directed Grid Theorem (Host: Aeren) (V1) (V2)
- Week 4 (8/20) - Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation (Host: gritukan) (V)
- Week 5 (8/27) - Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds (Host: Kim Taeyeon) (V)
- Week 6 (9/3) - Ramanujan Covering of Graphs (Host: Aeren) (V)
- Week 7 (9/10) - Interval vertex deletion admits a polynomial kernel (Host: TAMREF) (V)
- Week 8 (10/8) - New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut (Host: gritukan) (V)
- Week 9 (10/15) - On a Decentralized
$(\Delta +1)$ -Graph Coloring Algorithm (Host: Kim Taeyeon) (V) - Week 10 (1/9) - Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid (Host: 300iq) (V)
- Week 11 (1/9) - Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph (Host: TAMREF) (V)
- Week 12 (1/9) - Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time (Host: koosaga) (V)