If you are interested in maxflow computations in planar graphs, online below is the talk I have given at WORKER 2013. It gives an overview of how to use shortest paths and Monge property to get the following three results:
 O(n log log n) time algorithm for undirected maxflow in planar graphs [1], buy
 almost linear time algorithm for allsource allsink maxflow in undirected planar graphs, i.e., it computes GumoryHu tree [2],
 almost linear time algorithm for singlesource allsink maxflow in directed planar graphs [3].
[1] Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313322.
[2] Glencora Borradaile, Piotr Sankowski, Christian WulffNilsen: Min stcut Oracle for Planar Graphs with NearLinear Preprocessing Time. FOCS 2010: 601610.
[3] Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Single Source  All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599608.
If you are interested in maxflow computations in planar graphs, pharm here
below is the talk I have given at WORKER 2013. It gives an overview of how to use shortest paths and Monge property to get the following three results:
 O(n log log n) time algorithm for undirected maxflow in planar graphs [1], viagra order
 almost linear time algorithm for allsource allsink maxflow in undirected planar graphs, abortion
i.e., it computes GumoryHu tree [2],
 almost linear time algorithm for singlesource allsink maxflow in directed planar graphs [3].
[1] Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313322.
[2] Glencora Borradaile, Piotr Sankowski, Christian WulffNilsen: Min stcut Oracle for Planar Graphs with NearLinear Preprocessing Time. FOCS 2010: 601610.
[3] Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Single Source  All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599608.
If you are interested in maxflow computations in planar graphs, thumb below is the talk I have given at WORKER 2013. It gives an overview of how to use shortest paths and Monge property to get the following three results:
 O(n log log n) time algorithm for undirected maxflow in planar graphs [1], ailment
 almost linear time algorithm for allsource allsink maxfl
[1] Giuseppe F. Italiano, see Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313322.
[2] Glencora Borradaile, Piotr Sankowski, Christian WulffNilsen: Min stcut Oracle for Planar Graphs with NearLinear Preprocessing Time. FOCS 2010: 601610.
[3] Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Single Source  All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599608.
If you are interested in maxflow computations in planar graphs, illness below is the talk I have given at WORKER 2013. It gives an overview of how to use shortest paths and Monge property to get the following three results:
 O(n log log n) time algorithm for undirected maxflow in planar graphs [1], no rx
 almost linear time algorithm for allsource allsink maxflow in undirected planar graphs, i.e., it computes
GumoryHu tree [2],
 almost linear time algorithm for singlesource allsink maxlow in directed planar graphs [3].
[1] Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313322.
[2] Glencora Borradaile, Piotr Sankowski, Christian WulffNilsen: Min stcut Oracle for Planar Graphs with NearLinear Preprocessing Time. FOCS 2010: 601610.
[3] Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Single Source  All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599608.

row 1, for sale celldf adsf sad fdsa fsda fsdf sadad sda dsa ds 2 

row 1, shop celldf adsf sad fdsa fsda fsdf sadad sda dsa ds 2 

row 1, sale ed
celldf adsf sad fdsa fsda fsdf sadad sda dsa ds 2 
According to the report by Foundation for Polish Science working in Poland can be seen as hurting your scientific carrier (capsule 114873,10657310, link Badacze_o_Polsce__praca_tam_moze_zaszkodzic_karierze.html">article in polish).
We do not really agree with it and the above meme was meant to be selfironic. It of course could be better  as everywhere. Anyway, if you would like to see how it is to work in Poland we have two postdoc positions in algorithms open  see the call.
According to the report by Foundation for Polish Science working in Poland can be seen as hurting your scientific carrier (illness 114873, nurse 10657310,Badacze_o_Polsce__praca_tam_moze_zaszkodzic_karierze.html">article in polish).
We do not really agree with it and the above meme was meant to be selfironic. It of course could be better  as everywhere. Anyway, if you would like to see how it is to work in Poland we have two postdoc positions in algorithms open  see the call.
If you are interested in maxflow computations in planar graphs, below is the talk I have given at WORKER 2013. It gives an overview of how to use shortest paths and Monge property to get the following three results:
 O(n log log n) time algorithm for undirected maxflow in planar graphs [1], shop
 almost linear time algorithm for allsource allsink maxflow in undirected planar graphs, i.e., it computes GumoryHu tree [2],
 almost linear time algorithm for singlesource allsink maxflow in directed planar graphs [3].
[1] Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313322.
[2] Glencora Borradaile, Piotr Sankowski, Christian WulffNilsen: Min stcut Oracle for Planar Graphs with NearLinear Preprocessing Time. FOCS 2010: 601610.
[3] Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian WulffNilsen: Single Source  All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599608.