Laekhanukit, Bundit Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Karthik, C. S., Laekhanukit, B., & Manurangsi, P. (2018). On the Parameterized Complexity of Approximating Dominating Set. In STOC'18 (pp. 1283-1296). New York, NY: ACM. doi:10.1145/3188745.3188896.