Bingkai Lin

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 30

Top Topics

Greedy Heuristics

Parameterized Complexity

Robust Image Watermarking

Top Venues

Electron. Colloquium Comput. Complex.

Publications

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