Skip to content

Bingkai Lin

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

17

Venues

8

Active years

2012–2025

Best venue rank

A*

Where they publish

Papers

17 indexed papers, newest first.

YearVenueTitleAuthors
2025ISAACHardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems.Yusuke Kobayashi, Bingkai Lin
2025STOCAlmost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH.Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2025STACSOn Average Baby PIH and Its Applications.Yuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin, Xin Zheng
2024ICALPImproved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH.Shuangle Li, Bingkai Lin, Yuwei Liu
2024STOCParameterized Inapproximability Hypothesis under Exponential Time Hypothesis.Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu
2023FOCSImproved Hardness of Approximating k-Clique under ETH.Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2023ISAACFPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set.Huairui Chu, Bingkai Lin
2023SODAConstant Approximating ParameterizedBingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2022ICALPOn Lower Bounds of Approximating Parameterized k-Clique.Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2021STOCConstant approximating k-clique is w[1]-hard.Bingkai Lin
2020SODAA nearly 5/3-approximation FPT Algorithm for Min-Ken-ichi Kawarabayashi, Bingkai Lin
2019ICALPA Simple Gap-Producing Reduction for the Parameterized Set Cover Problem.Bingkai Lin
2017WGThe Hardness of Embedding Grids and Walls.Yijia Chen, Martin Grohe, Bingkai Lin
2016FOCSThe Constant Inapproximability of the Parameterized Dominating Set Problem.Yijia Chen, Bingkai Lin
2015SODAThe Parameterized Complexity ofBingkai Lin
2013AAIMMulti-Multiway Cut Problem on Graphs of Bounded Branch Width.Xiaojie Deng, Bingkai Lin, Chihao Zhang
2012ICALPThe Parameterized Complexity of k-Edge Induced Subgraphs.Bingkai Lin, Yijia Chen