BibTeX record journals/ipl/BhattacharyyaD08

download as .bib file

@article{DBLP:journals/ipl/BhattacharyyaD08,
  author       = {Bishnu Bhattacharyya and
                  Frank K. H. A. Dehne},
  title        = {Using spine decompositions to efficiently solve the length-constrained
                  heaviest path problem for trees},
  journal      = {Inf. Process. Lett.},
  volume       = {108},
  number       = {5},
  pages        = {293--297},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.ipl.2008.05.023},
  doi          = {10.1016/J.IPL.2008.05.023},
  timestamp    = {Fri, 26 May 2017 22:54:42 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BhattacharyyaD08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.