Xuandi Ren

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH	2024	Venkatesan Guruswami Bingkai Lin Xuandi Ren Yican Sun Kewen Wu
+ PDF Chat	Improved Hardness of Approximating k-Clique under ETH	2023	Bingkai Lin Xuandi Ren Yican Sun Xiuhan Wang
+ PDF Chat	Constant Approximating Parameterized <i>k</i>-SETCOVER is W[2]-hard	2023	Bingkai Lin Xuandi Ren Yican Sun Xiuhan Wang
+	Improved Hardness of Approximating k-Clique under ETH	2023	Bingkai Lin Xuandi Ren Yican Sun Xiuhan Wang
+	Baby PIH: Parameterized Inapproximability of Min CSP	2023	Venkatesan Guruswami Xuandi Ren Sai Sandeep
+	Parameterized Inapproximability Hypothesis under ETH	2023	Venkatesan Guruswami Bingkai Lin Xuandi Ren Yican Sun Kewen Wu
+	Constant Approximating Parameterized $k$-SetCover is W[2]-hard	2022	Bingkai Lin Xuandi Ren Yican Sun Xiuhan Wang
+ PDF Chat	A Survey on Parameterized Inapproximability: $k$-Clique, $k$-SetCover, and More	2021	Xuandi Ren
+ PDF Chat	Generalized Sorting with Predictions	2021	Pinyan Lu Xuandi Ren Enze Sun Yubo Zhang
+	On Lower Bounds of Approximating Parameterized $k$-Clique	2021	Bingkai Lin Xuandi Ren Yican Sun Xiuhan Wang
+	A Survey on Parameterized Inapproximability: $k$-Clique, $k$-SetCover, and More	2021	Xuandi Ren
+	Generalized Sorting with Predictions	2020	Pinyan Lu Xuandi Ren Enze Sun Yubo Zhang

Common Coauthors

Coauthor	Papers Together
Yican Sun	7
Bingkai Lin	7
Xiuhan Wang	5
Venkatesan Guruswami	3
Pinyan Lu	2
Kewen Wu	2
Yubo Zhang	2
Enze Sun	2
Sai Sandeep	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More	2017	Parinya Chalermsook Marek Cygan Guy Kortsarz Bundit Laekhanukit Pasin Manurangsi Danupon Nanongkai Luca Trevisan	2
+ PDF Chat	Constant approximating k-clique is w[1]-hard	2021	Bingkai Lin	2
+ PDF Chat	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal	2019	Daniel Lokshtanov M. S. Ramanujan Saket Saurab Meirav Zehavi	2
+	On Unapproximable Versions of $NP$-Complete Problems	1996	David Zuckerman	2
+	Matching nuts and bolts	1994	Noga Alon Manuel Blum Amos Fiat Sampath Kannan Moni Naor Rafail Ostrovsky	1
+ PDF Chat	Some improvements to total degree tests	2002	Karl E. Friedl Madhu Sudan	1
+ PDF Chat	Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors	2002	Omer Reingold Salil Vadhan Avi Wigderson	1
+ PDF Chat	Sorting and selection with structured costs	2001	Ankit Gupta Ashish Kumar	1
+ PDF Chat	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms	2020	Andreas Emil Feldmann C. S. Karthik Euiwoong Lee Pasin Manurangsi	1
+	Sorting under Forbidden Comparisons	2016	Indranil Banerjee Dana Richards	1
+	On Lower Bounds of Approximating Parameterized $k$-Clique	2021	Bingkai Lin Xuandi Ren Yican Sun Xiuhan Wang	1
+ PDF Chat	Losing Weight by Gaining Edges	2014	Amir Abboud Kevin Lewi Ryan Williams	1
+	Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique	2023	Yijia Chen Yi Feng Bundit Laekhanukit Y. Liu	1
+ PDF Chat	Some canonical sequences of integers	1995	Mira Bernstein N. J. A. Sloane	1
+ PDF Chat	Derandomized graph products	1995	Noga Alon Uriel Feige Avi Wigderson David Zuckerman	1
+ PDF Chat	Algorithms for the Generalized Sorting Problem	2011	Zhiyi Huang Sampath Kannan Sanjeev Khanna	1