2024 Summer School on Combinatorics and Algorithms
- Date: 22-26 July 2024.
- Place: Bldg. E11 (Creative Learning Bldg), Lecture Room 412, KAIST, Daejeon, Korea.
The 2024 Summer School on Combinatorics and Algorithms is a venue for students and early-career researchers to learn selected topics in theoretical computer science and discrete mathematics. It will be a great opportunity for young and aspiring researchers to study topics which are important but not covered during the lectures in the university classes. This summer, two lecture series, combinatorial optimization and grid minor theorem, will be given by two leading experts on the subjects. There will be exercise sessions where you form a team and solve challenging questions related to the lecture subjects.
Lecturers and Topics
- Chien-Chung Huang (ENS Paris, France): Combinatorial Optimization
This lecture (12.5h) will cover essential topics in combinatorial optimization including: Berge’s theorem, Konig’s theorem, Egervary’s theorem, Karger’s min-cut algorithm and Gomory-Hu trees, Edmonds’ blossom algorithm for maximum matching, matroid 101, multi-commodity flow and k-coverage problems.
- Sebastian Wiederrecht (DIMAG-IBS, Korea): From treewidth to grid minor theorem
This lecture (6h) will present the notion of tree decomposition, treewidth and graph minor, and introduce the grid minor theorem by Robertson and Seymour. Grid minor theory is deemed as one of the most important theory in modern graph theory and has many applications in algorithms design, data structure, logic, etc.
Schedule
July 22 Monday
| 11:00-12:00 | Combinatorial Optimization |
| 12:00-14:00 | Lunch & Dormitory check-in |
| 14:00-15:30 | Combinatorial Optimization |
| 15:30-17:00 | Homework and Team study |
| 17:00-18:00 | Recitation |
July 23-25 Tuesday/Wednesday/Thursday
| 9:30-12:00 | Combinatorial Optimization |
| 12:00-13:30 | Lunch |
| 13:30-15:00 | From treewidth to grid minor theorem |
| 15:00-17:00 | Homework and Team study |
| 17:00-18:00 | Recitation |
July 26 Friday
| 9:30-12:00 | Combinatorial Optimization |
| 12:00-13:30 | Lunch |
| 13:30-15:00 | From treewidth to grid minor theorem |
Registration
- Register: Registration deadline: June 26.
- Accommodation support: We can provide KAIST dormitory accommodations on a first-come, first-served basis for those who need lodging support, either for 2 persons per room or 3 persons per room. If you need, you can apply for accommodation support by selecting the corresponding options during the registration.
- Undergraduate and graduate students need to get approval from their advisors before registering.
Organizers
- Eunjung Kim (KAIST School of Computing)
- Jungho Ahn (KIAS School of Computational Sciences)
- Sang-il Oum (IBS Discrete Mathematics Group / KAIST Department of Mathematical Sciences)
- Eunjin Oh (POSTECH CSE)
