BibTeX record journals/dam/BauerBMS02

download as .bib file

@article{DBLP:journals/dam/BauerBMS02,
  author       = {Douglas Bauer and
                  Hajo Broersma and
                  Aurora Morgana and
                  Edward F. Schmeichel},
  title        = {Polynomial algorithms that prove an NP-Hard hypothesis implies an
                  NP-hard conclusion},
  journal      = {Discret. Appl. Math.},
  volume       = {120},
  number       = {1-3},
  pages        = {13--23},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0166-218X(01)00276-1},
  doi          = {10.1016/S0166-218X(01)00276-1},
  timestamp    = {Thu, 11 Feb 2021 23:21:38 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BauerBMS02.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.