@article{ journals/jgaa/BoseCGMS15,
  added-at = {2015-03-02T00:00:00.000+0100},
  author = {Bose, Prosenjit and Carufel, Jean-Lou De and Grimm, Carsten and Maheshwari, Anil and Smid, Michiel H. M.},
  biburl = {http://www.bibsonomy.org/bibtex/25f8ce789a2bdbf6b4a07d8c0b602432f/dblp},
  ee = {http://dx.doi.org/10.7155/jgaa.00345},
  interhash = {57ce8cc91b2a0806cf54ff3fdb346227},
  intrahash = {5f8ce789a2bdbf6b4a07d8c0b602432f},
  journal = {J. Graph Algorithms Appl.},
  keywords = {dblp},
  number = {1},
  pages = {11-41},
  title = {Optimal Data Structures for Farthest-Point Queries in Cactus Networks.},
  url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BoseCGMS15},
  volume = {19},
  year = {2015}
}

{"_id":"uM6zRNXhEmMutoFX9","bibbaseid":"bose-carufel-de-grimm-maheshwari-smid-optimaldatastructuresforfarthestpointqueriesincactusnetworks-2015","downloads":0,"creationDate":"2015-05-11T08:08:54.814Z","title":"Optimal Data Structures for Farthest-Point Queries in Cactus Networks.","author_short":["Bose, P.","Carufel","De, J.","Grimm, C.","Maheshwari, A.","Smid, M.<nbsp>H.<nbsp>M."],"year":2015,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Prosenjit Bose?items=1000","bibdata":{"added-at":"2015-03-02T00:00:00.000+0100","author":["Bose, Prosenjit","Carufel","De, Jean-Lou","Grimm, Carsten","Maheshwari, Anil","Smid, Michiel H. M."],"author_short":["Bose, P.","Carufel","De, J.","Grimm, C.","Maheshwari, A.","Smid, M.<nbsp>H.<nbsp>M."],"bibtex":"@article{ journals/jgaa/BoseCGMS15,\n added-at = {2015-03-02T00:00:00.000+0100},\n author = {Bose, Prosenjit and Carufel, Jean-Lou De and Grimm, Carsten and Maheshwari, Anil and Smid, Michiel H. M.},\n biburl = {http://www.bibsonomy.org/bibtex/25f8ce789a2bdbf6b4a07d8c0b602432f/dblp},\n ee = {http://dx.doi.org/10.7155/jgaa.00345},\n interhash = {57ce8cc91b2a0806cf54ff3fdb346227},\n intrahash = {5f8ce789a2bdbf6b4a07d8c0b602432f},\n journal = {J. Graph Algorithms Appl.},\n keywords = {dblp},\n number = {1},\n pages = {11-41},\n title = {Optimal Data Structures for Farthest-Point Queries in Cactus Networks.},\n url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BoseCGMS15},\n volume = {19},\n year = {2015}\n}","bibtype":"article","biburl":"http://www.bibsonomy.org/bibtex/25f8ce789a2bdbf6b4a07d8c0b602432f/dblp","ee":"http://dx.doi.org/10.7155/jgaa.00345","id":"journals/jgaa/BoseCGMS15","interhash":"57ce8cc91b2a0806cf54ff3fdb346227","intrahash":"5f8ce789a2bdbf6b4a07d8c0b602432f","journal":"J. Graph Algorithms Appl.","key":"journals/jgaa/BoseCGMS15","keywords":"dblp","number":"1","pages":"11-41","title":"Optimal Data Structures for Farthest-Point Queries in Cactus Networks.","type":"article","url":"http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BoseCGMS15","volume":"19","year":"2015","bibbaseid":"bose-carufel-de-grimm-maheshwari-smid-optimaldatastructuresforfarthestpointqueriesincactusnetworks-2015","role":"author","urls":{"Link":"http://dx.doi.org/10.7155/jgaa.00345","Paper":"http://dblp.uni-trier.de/db/journals/jgaa/jgaa19.html#BoseCGMS15"},"keyword":["dblp"],"downloads":0},"search_terms":["optimal","data","structures","farthest","point","queries","cactus","networks","bose","carufel","de","grimm","maheshwari","smid"],"keywords":["dblp"],"authorIDs":["54805c31a29145d03f000f97"],"dataSources":["nTyQTvut7Rqwe9n5L"]}