Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel. Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics, 120(1-3):13-23, 2002.
@article{BauerBMS02,
title = {Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion},
author = {Douglas Bauer and Hajo Broersma and Aurora Morgana and Edward F. Schmeichel},
year = {2002},
researchr = {https://researchr.org/publication/BauerBMS02},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {120},
number = {1-3},
pages = {13-23},
}