@inproceedings{DBLP:conf/stacs/KaplanN11,
author = {Haim Kaplan and
Yahav Nussbaum},
title = {Minimum s-t cut in undirected planar graphs when the source
and the sink are close},
booktitle = {STACS},
year = {2011},
pages = {117-128},
ee = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.117},
crossref = {DBLP:conf/stacs/2011},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/stacs/2011,
editor = {Thomas Schwentick and
Christoph D{\"u}rr},
title = {28th International Symposium on Theoretical Aspects of Computer
Science, STACS 2011, March 10-12, 2011, Dortmund, Germany},
booktitle = {STACS},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
series = {LIPIcs},
volume = {9},
year = {2011},
isbn = {978-3-939897-25-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}