BibTeX record journals/algorithmica/ChenKX05

download as .bib file

@article{DBLP:journals/algorithmica/ChenKX05,
  author       = {Jianer Chen and
                  Iyad A. Kanj and
                  Ge Xia},
  title        = {Labeled Search Trees and Amortized Analysis: Improved Upper Bounds
                  for NP-Hard Problems},
  journal      = {Algorithmica},
  volume       = {43},
  number       = {4},
  pages        = {245--273},
  year         = {2005},
  url          = {https://doi.org/10.1007/s00453-004-1145-7},
  doi          = {10.1007/S00453-004-1145-7},
  timestamp    = {Wed, 17 May 2017 14:25:13 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChenKX05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.