2025-Spring Advanced Algorithms (AIGS536-01) The course syllabus

1.Course Information

Course No. AIGS536 Section 01 Credit 3.00
Category Major elective Course Type prerequisites
Postechian Core Competence
Hours MON, WED / 14:00 ~ 15:15 / Science BldgⅡ[109]Lecture Room Grading Scale G

2. Instructor Information

Oh Eunjin Name Oh Eunjin Department Dept. of Computer Science & Eng.
Email address jin9082@postech.ac.kr Homepage https://sites.google.com/view/eunjinoh/
Office 알고리즘 연구실 Office Phone 054-279-2389
Office Hours

3. Course Objectives

This course covers advanced topics of algorithms including graph algorithms, geometric algorithms, approximation algorithms, and randomized algorithms. We study how to design efficient algorithms using essential design and analysis methods.

4. Prerequisites & require

CSED331 (Algorithms)

5. Grading

Midterm exam. 40%
Final exam. 40%
Homework 20%

6. Course Materials

Title Author Publisher Publication
Year/Edition
ISBN
Approximation Algorithms Vazirani, Vijay V Springer 2003
Parameterized Algorithms Cygan, M., Fomin, F.V., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S. Springer 2015

7. Course References

8. Course Plan

Graph Theory and Algorithms
(1) Introduction: Paths, Cycles, Shortest paths
(2) Graph Traversal and Tour
(3) Planar graphs
(4) Coloring
(5) Vertex Cover
(6) Clique
(7) Independent Set
(8) Dominating Set
(9) Tree Decomposition
(10) NP-hard problems on planar graphs
(11) Hardness within Class P

9. Course Operation

- 대면강의

10. How to Teach & Remark

11. Supports for Students with a Disability

- Taking Course: interpreting services (for hearing impairment), Mobility and preferential seating assistances (for developmental disability), Note taking(for all kinds of disabilities) and etc.

- Taking Exam: Extended exam period (for all kinds of disabilities, if needed), Magnified exam papers (for sight disability), and etc.

- Please contact Center for Students with Disabilities (279-2434) for additional assistance