BibTeX record: conf/stacs/KaplanN11

download as .bib file

@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 = {28th International Symposium on Theoretical Aspects of Computer Science,
               {STACS} 2011, March 10-12, 2011, Dortmund, Germany},
  pages     = {117--128},
  year      = {2011},
  crossref  = {DBLP:conf/stacs/2011},
  url       = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.117},
  doi       = {10.4230/LIPIcs.STACS.2011.117},
  timestamp = {Mon, 21 Mar 2011 21:41:50 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stacs/KaplanN11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  series    = {LIPIcs},
  volume    = {9},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2011},
  isbn      = {978-3-939897-25-5},
  timestamp = {Mon, 21 Mar 2011 21:41:50 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stacs/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}