Jakub Lacki, Piotr Sankowski. Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. In Camil Demetrescu, Magnús M. Halldórsson, editors, Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Volume 6942 of Lecture Notes in Computer Science, pages 155-166, Springer, 2011. [doi]
Abstract is missing.