Chalermsook, Parinya Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Nanongkai, Danupon Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Chalermsook, P., Laekhanukit, B., & Nanongkai, D. (2014). Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. In A., Pardo, & A., Viola (Eds.), LATIN 2014: Theoretical Informatics (pp. 409-420). Berlin: Springer. doi:10.1007/978-3-642-54423-1_36.
