Topics Wanted

Centroid Path Decomposition,
Min Cost Max Flow,
Blossom’s Algo,
Line Sweep,
Gaussian Elimination,
Suffix Auto,
Link Cut trees,


Min Cost Max Flow and Line Sweep are very important and will definitely be covered. Link-Cut trees will probably be covered in the last day. If we have time then some of the other topics also may be covered.


I would also suggest the others to vote on what topics they feel are needed because within 3 days every topic cannot be covered. Even if it is some other topic not mentioned above please mention it here or in another thread.