Upcoming deadlines

SN.	Activity	Deadline
1.	List of Papers up.	Sept 4.
2.	Select group (of two) and a paper.	Sept 12.
3.	Final groups and assignment of paper.	Sept 15.

Evaluation

Presentation	10 marks
Report	8 marks
Participation in other presentations	2 marks
Meeting and discussion with Instructor	5 marks

List of Papers

Maximum Flow in Planar Graphs (SiCOMP 1979)
Presented by: Keshav Ranjan
An efficient Algorithm for the Stable Roommates problem (J.Algorithms 1985)
Presented by: Nitin and Kshitij Slides (awaited)
Popular Matchings (SiCOMP 2007)
Presented by: Mounik Slides
Replacement paths and k simple shortest paths in unweighted directed graphs (TALG 2012)
Presented by: Mithun and Jaisurya
Flow Games (FSTTCS 2017)
Presented by: Anant and Smruti Slides
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal (SiCOMP 2018)
Presented by: Sampriti and Santhini
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (ESA 2019)
Presented by: Mohit and Merwin
Perfect Matchings in O(n log n) time in Regular Bipartite Graphs
Presented by: Shivam and Utkarsh Slides
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Presented by: Venkat