The lecture on flows in planar graph is below it contains ideas from [1,2,3].
The lecture on mechanism design.
[1] 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.
[2] Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610.
[3] Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Single Source – All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608.
"Open Day of Doctoral Studies in Computer Science" will happen this Saturday. Here is the…
State of Polish AI 2021 starts today at 11 AM! Registration link for Zoom event…
On 03.03.2016 as a part of our Foundation for Polish Science Algorithmic Miniworkshop series we…
On 21.01.2016 as a part of our Foundation for Polish Science Algorithmic Miniworkshop series we…
On 10.12.2015 as a part of our Foundation for Polish Science Algorithmic Miniworkshop series we…
On 12.11.2015 as a part of our Foundation for Polish Science Algorithmic Miniworkshop series we…