Bingkai Lin

According to our database, Bingkai Lin authored at least 21 papers between 2013 and 2024.

Collaborative distances:

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

2024

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

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

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

Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH.

Shuangle Li, Bingkai Lin, Yuwei Liu

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 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

FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set.

Huairui Chu, Bingkai Lin

Proceedings of the 34th International Symposium on Algorithms and Computation, 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

Constant approximating k-clique is w[1]-hard.

Bingkai Lin

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut.

Ken-ichi Kawarabayashi, Bingkai Lin

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

2019

The Constant Inapproximability of the Parameterized Dominating Set Problem.

Yijia Chen, Bingkai Lin

SIAM J. Comput., 2019

Parameterized Intractability of Even Set and Shortest Vector Problem.

Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx

Electron. Colloquium Comput. Complex., 2019

A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem.

Bingkai Lin

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

The Parameterized Complexity of the <i>k</i>-Biclique Problem.

Bingkai Lin

J. ACM, 2018

Parameterized Algorithms to Compute Ising Partition Function.

Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2017

The parameterized complexity of k-edge induced subgraphs.

Bingkai Lin, Yijia Chen

Inf. Comput., 2017

The Hardness of Embedding Grids and Walls.

Yijia Chen, Martin Grohe, Bingkai Lin

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2015

The Parameterized Complexity of <i>k</i>-Biclique.

Bingkai Lin

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

The Parameterized Complexity of k-Biclique.

Bingkai Lin

CoRR, 2014

2013

Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.

Xiaojie Deng, Bingkai Lin, Chihao Zhang

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013