Chalermsook, Parinya, Cygan, Marek, Kortsarz, Guy, Laekhanukit, Bundit, Manurangsi, Pasin, Nanongkai, Danupon, and Trevisan, Luca. From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. Retrieved from https://par.nsf.gov/biblio/10210275. SIAM Journal on Computing 49.4 Web. doi:10.1137/18M1166869.

Chalermsook, Parinya, Cygan, Marek, Kortsarz, Guy, Laekhanukit, Bundit, Manurangsi, Pasin, Nanongkai, Danupon, & Trevisan, Luca. From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM Journal on Computing, 49 (4). Retrieved from https://par.nsf.gov/biblio/10210275. https://doi.org/10.1137/18M1166869

Chalermsook, Parinya, Cygan, Marek, Kortsarz, Guy, Laekhanukit, Bundit, Manurangsi, Pasin, Nanongkai, Danupon, and Trevisan, Luca. "From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More". SIAM Journal on Computing 49 (4). Country unknown/Code not available. https://doi.org/10.1137/18M1166869. https://par.nsf.gov/biblio/10210275.

@article{osti_10210275,
place = {Country unknown/Code not available}, title = {From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More}, url = {https://par.nsf.gov/biblio/10210275}, DOI = {10.1137/18M1166869}, abstractNote = {}, journal = {SIAM Journal on Computing}, volume = {49}, number = {4}, author = {Chalermsook, Parinya and Cygan, Marek and Kortsarz, Guy and Laekhanukit, Bundit and Manurangsi, Pasin and Nanongkai, Danupon and Trevisan, Luca}, editor = {null} }