pdfformat: 

@InProceedings{kaplan_et_al:LIPIcs:2011:3004, author = {Haim Kaplan and Yahav Nussbaum}, title = {{Minimum st 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 = {117128}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897255}, ISSN = {18688969}, year = {2011}, volume = {9}, editor = {Thomas Schwentick and Christoph D{\"u}rr}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3004}, URN = {urn:nbn:de:0030drops30049}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.117}, annote = {Keywords: planar graph, minimum cut, shortest path, cut cycle} }
Keywords:  planar graph, minimum cut, shortest path, cut cycle  
Seminar:  28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)  
Issue date:  2011  
Date of publication:  11.03.2011 