Bingkai Lin - RankMe

41 papers A* 11A 1B 3Journal 24Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Parameterized inapproximability: From Clique to PIH. Comput. Sci. Rev. Yijia Chen, Bingkai Lin
2025	A*	`conf`	Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. STOC Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2025	B	`conf`	Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems. ISAAC Yusuke Kobayashi, Bingkai Lin
2025	A	`conf`	On Average Baby PIH and Its Applications. STACS Yuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin, Xin Zheng
2025	J	`jnl`	Parameterized Inapproximability Hypothesis under ETH. J. ACM Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2024	J	`jnl`	Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. CoRR Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2024	J	`jnl`	Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2024	A*	`conf`	Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH. ICALP Shuangle Li, Bingkai Lin, Yuwei Liu
2024	J	`jnl`	Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH. CoRR Shuangle Li, Bingkai Lin, Yuwei Liu
2024	A*	`conf`	Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis. STOC Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2023	A*	`conf`	Constant Approximating Parameterized SODA Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2023	B	`conf`	FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. ISAAC Huairui Chu, Bingkai Lin
2023	J	`jnl`	FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. CoRR Bingkai Lin, Huairui Chu
2023	A*	`conf`	Improved Hardness of Approximating k-Clique under ETH. FOCS Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2023	J	`jnl`	Improved Hardness of Approximating k-Clique under ETH. CoRR Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2023	J	`jnl`	Parameterized Inapproximability Hypothesis under ETH. CoRR Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2023	J	`jnl`	Parameterized Inapproximability Hypothesis under ETH. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2022	J	`jnl`	Constant Approximating Parameterized k-SetCover is W[2]-hard. CoRR Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2022	A*	`conf`	On Lower Bounds of Approximating Parameterized k-Clique. ICALP Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2021	J	`jnl`	Constant Approximating k-Clique is W[1]-hard. CoRR Bingkai Lin
2021	A*	`conf`	Constant approximating k-clique is w[1]-hard. STOC Bingkai Lin
2021	J	`jnl`	On Lower Bounds of Approximating Parameterized k-Clique. CoRR Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2021	J	`jnl`	Parameterized Intractability of Even Set and Shortest Vector Problem. J. ACM Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2020	A*	`conf`	A nearly 5/3-approximation FPT Algorithm for Min- SODA Ken-ichi Kawarabayashi, Bingkai Lin
2019	A*	`conf`	A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem. ICALP Bingkai Lin
2019	J	`jnl`	A Simple Gap-producing Reduction for the Parameterized Set Cover Problem. CoRR Bingkai Lin
2019	J	`jnl`	Parameterized Intractability of Even Set and Shortest Vector Problem. CoRR Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2019	J	`jnl`	Parameterized Intractability of Even Set and Shortest Vector Problem. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2019	J	`jnl`	The Constant Inapproximability of the Parameterized Dominating Set Problem. SIAM J. Comput. Yijia Chen, Bingkai Lin
2018	J	`jnl`	Parameterized Algorithms to Compute Ising Partition Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin
2018	J	`jnl`	The Parameterized Complexity of the J. ACM Bingkai Lin
2017	B	`conf`	The Hardness of Embedding Grids and Walls. WG Yijia Chen, Martin Grohe, Bingkai Lin
2017	J	`jnl`	The Hardness of Embedding Grids and Walls. CoRR Yijia Chen, Martin Grohe, Bingkai Lin
2017	J	`jnl`	The parameterized complexity of k-edge induced subgraphs. Inf. Comput. Bingkai Lin, Yijia Chen
2016	A*	`conf`	The Constant Inapproximability of the Parameterized Dominating Set Problem. FOCS Yijia Chen, Bingkai Lin
2015	J	`jnl`	The Constant Inapproximability of the Parameterized Dominating Set Problem. CoRR Yijia Chen, Bingkai Lin
2015	A*	`conf`	The Parameterized Complexity of SODA Bingkai Lin
2014	J	`jnl`	The Parameterized Complexity of k-Biclique. CoRR Bingkai Lin
2013	—	`conf`	Multi-Multiway Cut Problem on Graphs of Bounded Branch Width. FAW-AAIM Xiaojie Deng, Bingkai Lin, Chihao Zhang
2012	—	`conf`	The Parameterized Complexity of k-Edge Induced Subgraphs. ICALP (1) Bingkai Lin, Yijia Chen
2011	J	`jnl`	The parameterized complexity of k-edge induced subgraphs CoRR Bingkai Lin, Yijia Chen