The last lecture on lower bounds was based on Mihai Patrascu notes.
The 6th homework is due on 18th of June.
The lecture on flows in planar graph is below it contains ideas from [1,2,3].
 Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322.
 Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610.
 Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Single Source – All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608.
The third homework is due on the 23rd of April.
The second homework is due on 09/04/2014.