Bingkai Lin. Constant approximating k-clique is w[1]-hard. In Samir Khuller, Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. pages 1749-1756, ACM, 2021. [doi]
@inproceedings{Lin21-31,
title = {Constant approximating k-clique is w[1]-hard},
author = {Bingkai Lin},
year = {2021},
doi = {10.1145/3406325.3451016},
url = {https://doi.org/10.1145/3406325.3451016},
researchr = {https://researchr.org/publication/Lin21-31},
cites = {0},
citedby = {0},
pages = {1749-1756},
booktitle = {STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021},
editor = {Samir Khuller and Virginia Vassilevska Williams},
publisher = {ACM},
isbn = {978-1-4503-8053-9},
}