Multi-Multiway Cut Problem on Graphs of Bounded Branch Width. - Xiaojie Deng; Bingkai Lin; Chihao Zhang 001 (FAW-AAIM, 2013)

The Parameterized Complexity of k-Biclique. - Bingkai Lin (CoRR, 2014)

The Parameterized Complexity of k-Biclique. - Bingkai Lin (SODA, 2015)

The Hardness of Embedding Grids and Walls. - Yijia Chen 001; Martin Grohe; Bingkai Lin (WG, 2017)

The parameterized complexity of k-edge induced subgraphs. - Bingkai Lin; Yijia Chen 001 (Inf. Comput., 2017)

Parameterized Algorithms to Compute Ising Partition Function. - Hidefumi Hiraishi; Hiroshi Imai; Yoichi Iwata; Bingkai Lin (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

The Parameterized Complexity of the k-Biclique Problem. - Bingkai Lin (J. ACM, 2018)

A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem. - Bingkai Lin (ICALP, 2019)

Parameterized Intractability of Even Set and Shortest Vector Problem. - Arnab Bhattacharyya 001; Édouard Bonnet; László Egri; Suprovat Ghoshal; Karthik C. S. 001; Bingkai Lin; Pasin Manurangsi; Dániel Marx (Electron. Colloquium Comput. Complex., 2019)

The Constant Inapproximability of the Parameterized Dominating Set Problem. - Yijia Chen 001; Bingkai Lin (SIAM J. Comput., 2019)

A nearly 5/3-approximation FPT Algorithm for Min-k-Cut. - Ken-ichi Kawarabayashi; Bingkai Lin (SODA, 2020)

Constant approximating k-clique is w[1]-hard. - Bingkai Lin (STOC, 2021)

On Lower Bounds of Approximating Parameterized k-Clique. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (ICALP, 2022)

Constant Approximating Parameterized k-SetCover is W[2]-hard. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (CoRR, 2022)

Improved Hardness of Approximating k-Clique under ETH. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (FOCS, 2023)

FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. - Huairui Chu; Bingkai Lin (ISAAC, 2023)

Constant Approximating Parameterized k-SETCOVER is W[2]-hard. - Bingkai Lin; Xuandi Ren; Yican Sun; Xiuhan Wang (SODA, 2023)

Parameterized Inapproximability Hypothesis under ETH. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2023)

Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH. - Shuangle Li; Bingkai Lin; Yuwei Liu (ICALP, 2024)

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (STOC, 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 001 (Electron. Colloquium Comput. Complex., 2024)

On Average Baby PIH and Its Applications. - Yuwei Liu; Yijia Chen 001; Shuangle Li; Bingkai Lin; Xin Zheng (STACS, 2025)