Scheduling resource allocation with timeslot penalty for changeover

Proof of Cook Levin Theorem (Presentation by Xiechuan, Song and Shuo)

Graph Traversal Algorithms - Breadth First Search

Bron Kerbosch Algorithm - Presentation by Jun Zhai, Tianhang Qiang and Yizhen Jia

Convex Hull - Chan's Algorithm O(n log h) - Presentation by Yitian Huang and Zhe Yang

Stopping Rule for Secretory Problem - Presentation by Haoyang Tian, Wesam Alshami and Dong Wang

Online algorithms in Machine Learning

Proof of O(log *n) time complexity of Union find (Presentation by Wei Li, Zehao Cai, Ishan Sharma)