@article{ dblp1781071,
  title = {Min <i>st</i>-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time},
  author = {Glencora Borradaile and Piotr Sankowski and Christian Wulff-Nilsen},
  author_short = {Borradaile, G. and Sankowski, P. and Wulff-Nilsen, C.},
  bibtype = {article},
  type = {article},
  year = {2015},
  key = {dblp1781071},
  id = {dblp1781071},
  biburl = {http://www.dblp.org/rec/bibtex/journals/talg/BorradaileSW15},
  url = {http://doi.acm.org/10.1145/2684068},
  journal = {ACM Trans. Algorithms (TALG)},
  pages = {16:1-16:29},
  number = {3},
  volume = {11},
  text = {ACM Trans. Algorithms (TALG) 11(3):16:1-16:29 (2015)}
}

{"_id":"kz2yu2dkexBezjef2","authorIDs":["54573fb22abc8e9f3700020a"],"author_short":["Borradaile, G.","Sankowski, P.","Wulff-Nilsen, C."],"bibbaseid":"borradaile-sankowski-wulffnilsen-ministicutoracleforplanargraphswithnearlinearpreprocessingtime-2015","bibdata":{"title":"Min <i>st</i>-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","author":["Glencora Borradaile","Piotr Sankowski","Christian Wulff-Nilsen"],"author_short":["Borradaile, G.","Sankowski, P.","Wulff-Nilsen, C."],"bibtype":"article","type":"article","year":"2015","key":"dblp1781071","id":"dblp1781071","biburl":"http://www.dblp.org/rec/bibtex/journals/talg/BorradaileSW15","url":"http://doi.acm.org/10.1145/2684068","journal":"ACM Trans. Algorithms (TALG)","pages":"16:1-16:29","number":"3","volume":"11","text":"ACM Trans. Algorithms (TALG) 11(3):16:1-16:29 (2015)","bibtex":"@article{ dblp1781071,\n title = {Min <i>st</i>-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time},\n author = {Glencora Borradaile and Piotr Sankowski and Christian Wulff-Nilsen},\n author_short = {Borradaile, G. and Sankowski, P. and Wulff-Nilsen, C.},\n bibtype = {article},\n type = {article},\n year = {2015},\n key = {dblp1781071},\n id = {dblp1781071},\n biburl = {http://www.dblp.org/rec/bibtex/journals/talg/BorradaileSW15},\n url = {http://doi.acm.org/10.1145/2684068},\n journal = {ACM Trans. Algorithms (TALG)},\n pages = {16:1-16:29},\n number = {3},\n volume = {11},\n text = {ACM Trans. Algorithms (TALG) 11(3):16:1-16:29 (2015)}\n}","bibbaseid":"borradaile-sankowski-wulffnilsen-ministicutoracleforplanargraphswithnearlinearpreprocessingtime-2015","role":"author","urls":{"Paper":"http://doi.acm.org/10.1145/2684068"},"downloads":0},"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/talg/BorradaileSW15","creationDate":"2015-03-16T14:30:24.927Z","downloads":0,"keywords":[],"search_terms":["min","cut","oracle","planar","graphs","near","linear","preprocessing","time","borradaile","sankowski","wulff-nilsen"],"title":"Min <i>st</i>-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","year":2015,"dataSources":["HoThcRc32EqrRJZhp"]}