@InProceedings{kaplan_et_al:LIPIcs.STACS.2011.117,
author = {Kaplan, Haim and Nussbaum, Yahav},
title = {{Minimum s-t cut in undirected planar graphs when the source and the sink are close}},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
pages = {117--128},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-25-5},
ISSN = {1868-8969},
year = {2011},
volume = {9},
editor = {Schwentick, Thomas and D\"{u}rr, Christoph},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.117},
URN = {urn:nbn:de:0030-drops-30049},
doi = {10.4230/LIPIcs.STACS.2011.117},
annote = {Keywords: planar graph, minimum cut, shortest path, cut cycle}
}