Last update: Sun Mar 31 02:13:37 MDT 2019
@Article{Chen:2008:PIH, author = "Jianer Chen and Jie Meng", title = "On Parameterized Intractability: Hardness and Completeness", journal = j-COMP-J, volume = "51", number = "1", pages = "39--59", month = jan, year = "2008", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxm036", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Apr 28 14:33:33 MDT 2010", bibsource = "http://comjnl.oxfordjournals.org/content/vol51/issue1/index.dtl; http://www.math.utah.edu/pub/tex/bib/compj2000.bib", URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/51/1/39; http://comjnl.oxfordjournals.org/cgi/content/full/51/1/39; http://comjnl.oxfordjournals.org/cgi/reprint/51/1/39", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", }