@article{DBLP:journals/talg/BorradaileSW15,
  author       = {Glencora Borradaile and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  title        = {Min \emph{st}-Cut Oracle for Planar Graphs with Near-Linear Preprocessing
                  Time},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {11},
  number       = {3},
  pages        = {16:1--16:29},
  year         = {2015},
  url          = {https://doi.org/10.1145/2684068},
  doi          = {10.1145/2684068},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BorradaileSW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"rrNb82BEinf2DLD7o","bibbaseid":"borradaile-sankowski-wulffnilsen-minemphstcutoracleforplanargraphswithnearlinearpreprocessingtime-2015","authorIDs":["CjFap2PDtauEPd2Hu"],"author_short":["Borradaile, G.","Sankowski, P.","Wulff-Nilsen, C."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Glencora"],"propositions":[],"lastnames":["Borradaile"],"suffixes":[]},{"firstnames":["Piotr"],"propositions":[],"lastnames":["Sankowski"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Wulff-Nilsen"],"suffixes":[]}],"title":"Min \\emphst-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","journal":"ACM Trans. Algorithms","volume":"11","number":"3","pages":"16:1–16:29","year":"2015","url":"https://doi.org/10.1145/2684068","doi":"10.1145/2684068","timestamp":"Tue, 06 Nov 2018 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/talg/BorradaileSW15.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/talg/BorradaileSW15,\n author = {Glencora Borradaile and\n Piotr Sankowski and\n Christian Wulff{-}Nilsen},\n title = {Min \\emph{st}-Cut Oracle for Planar Graphs with Near-Linear Preprocessing\n Time},\n journal = {{ACM} Trans. Algorithms},\n volume = {11},\n number = {3},\n pages = {16:1--16:29},\n year = {2015},\n url = {https://doi.org/10.1145/2684068},\n doi = {10.1145/2684068},\n timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/talg/BorradaileSW15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Borradaile, G.","Sankowski, P.","Wulff-Nilsen, C."],"key":"DBLP:journals/talg/BorradaileSW15","id":"DBLP:journals/talg/BorradaileSW15","bibbaseid":"borradaile-sankowski-wulffnilsen-minemphstcutoracleforplanargraphswithnearlinearpreprocessingtime-2015","role":"author","urls":{"Paper":"https://doi.org/10.1145/2684068"},"metadata":{"authorlinks":{"sankowski, p":"https://duch.mimuw.edu.pl/~sank/wordpress/"}},"downloads":0},"bibtype":"article","biburl":"http://dblp.org/pers/tb2/s/Sankowski:Piotr","creationDate":"2020-12-08T10:32:32.563Z","downloads":0,"keywords":[],"search_terms":["min","emphst","cut","oracle","planar","graphs","near","linear","preprocessing","time","borradaile","sankowski","wulff-nilsen"],"title":"Min \\emphst-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","year":2015,"dataSources":["YTqCu4ZwBgzPtoQwj","cZqX5Q2YyDsGWz96c"]}