BibTeX record conf/cocoon/DomGN05

download as .bib file

@inproceedings{DBLP:conf/cocoon/DomGN05,
  author       = {Michael Dom and
                  Jiong Guo and
                  Rolf Niedermeier},
  editor       = {Lusheng Wang},
  title        = {Bounded Degree Closest \emph{k}-Tree Power Is NP-Complete},
  booktitle    = {Computing and Combinatorics, 11th Annual International Conference,
                  {COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3595},
  pages        = {757--766},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11533719\_77},
  doi          = {10.1007/11533719\_77},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/DomGN05.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.