Minimum s-t cut in undirected planar graphs when the source and the sink are close.

Haim Kaplan, Yahav Nussbaum

Browse the full STACS paper archive.