Generalized Sorting with Predictions. - Pinyan Lu; Xuandi Ren; Enze Sun 001; Yubo Zhang (SOSA, 2021)

A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More. - Xuandi Ren (CoRR, 2021)

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)

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)

Parameterized Inapproximability Hypothesis under ETH. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2023)

Baby PIH: Parameterized Inapproximability of Min CSP. - Venkatesan Guruswami; Xuandi Ren; Sai Sandeep (Electron. Colloquium Comput. Complex., 2023)

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (STOC, 2024)

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2024)

PCP-free APX-Hardness of Nearest Codeword and Minimum Distance. - Vijay Bhattiprolu; Venkatesan Guruswami; Xuandi Ren (Electron. Colloquium Comput. Complex., 2025)

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs. - Venkatesan Guruswami; Xuandi Ren; Kewen Wu 001 (CoRR, 2025)