Xiuhan Wang

According to our database, Xiuhan Wang authored at least 5 papers between 2022 and 2023.

Collaborative distances:

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

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

Range Avoidance for Low-depth Circuits and Connections to Pseudorandomness.

Venkatesan Guruswami, Xin Lyu, Xiuhan Wang

Electron. Colloquium Comput. Complex., 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