Xuandi Ren

According to our database, Xuandi Ren authored at least 16 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Scaling Reasoning Tokens via RL and Parallel Thinking: Evidence From Competitive Programming.

Qianfan Zhang, Tianyu Guo, Xuandi Ren, Jiale Chen, Ming Ding, Ran Xin, Xia Xiao

CoRR, April, 2026

2025

Scheduling Problems with Constrained Rejections.

Sami Davies, Venkatesan Guruswami, Xuandi Ren

CoRR, November, 2025

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs.

Venkatesan Guruswami, Xuandi Ren, Kewen Wu

CoRR, July, 2025

PCP-free APX-Hardness of Nearest Codeword and Minimum Distance.

Vijay Bhattiprolu, Venkatesan Guruswami, Xuandi Ren

Electron. Colloquium Comput. Complex., 2025

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH.

Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Exploring proof autoformalization with Mistral on Herald.

Lucy Horowitz, Michail Karatarakis, Xuandi Ren, Alejandro Sanchez Ocegueda

Proceedings of the Intelligent Computer Mathematics - 18th International Conference, 2025

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices.

Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee, Xuandi Ren

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis.

Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Baby PIH: Parameterized Inapproximability of Min CSP.

Venkatesan Guruswami, Xuandi Ren, Sai Sandeep

Proceedings of the 39th Computational Complexity Conference, 2024

2023

Parameterized Inapproximability Hypothesis under ETH.

Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu

Electron. Colloquium Comput. Complex., 2023

Constant Approximating Parameterized <i>k</i>-SETCOVER is W[2]-hard.

Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Hardness of Approximating k-Clique under ETH.

Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Constant Approximating Parameterized k-SetCover is W[2]-hard.

Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang

CoRR, 2022

On Lower Bounds of Approximating Parameterized k-Clique.

Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More.

Xuandi Ren

CoRR, 2021

Generalized Sorting with Predictions.

Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021