On Lower Bounds of Approximating Parameterized k-Clique. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (ICALP, 2022)

Constant Approximating Parameterized k-SetCover is W[2]-hard. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (CoRR, 2022)

Range Avoidance for Low-depth Circuits and Connections to Pseudorandomness. - Venkatesan Guruswami; Xin Lyu 003; Xiuhan Wang (Electron. Colloquium Comput. Complex., 2022)

Improved Hardness of Approximating k-Clique under ETH. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (FOCS, 2023)

Constant Approximating Parameterized k-SETCOVER is W[2]-hard. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (SODA, 2023)