关注
Lin BingKai
标题
引用次数
引用次数
年份
The Parameterized Complexity of the k-Biclique Problem
B Lin
Journal of the ACM (JACM) 65 (5), 1-23, 2018
92*2018
The constant inapproximability of the parameterized dominating set problem
Y Chen, B Lin
SIAM Journal on Computing 48 (2), 513-533, 2019
662019
Parameterized Intractability of Even Set and Shortest Vector Problem
A Bhattacharyya, É Bonnet, L Egri, S Ghoshal, K C. S., B Lin, ...
Journal of the ACM (JACM) 68 (3), 1-40, 2021
37*2021
A Simple Gap-producing Reduction for the Parameterized Set Cover Problem
B Lin
International Colloquium on Automata, Languages and Programming (ICALP 2019), 2019
312019
Constant approximating k-clique is W[1]-hard
B Lin
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
212021
A nearly 5/3-approximation FPT Algorithm for Min-k-Cut
K Kawarabayashi, B Lin
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
162020
On Lower Bounds of Approximating Parameterized -Clique
B Lin, X Ren, Y Sun, X Wang
49th International Colloquium on Automata, Languages, and Programming, ICALP …, 2021
102021
Multi-multiway cut problem on graphs of bounded branch width
X Deng, B Lin, C Zhang
Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2013
92013
The hardness of embedding grids and walls
Y Chen, M Grohe, B Lin
International Workshop on Graph-Theoretic Concepts in Computer Science, 180-192, 2017
82017
Constant Approximating Parameterized k-SETCOVER is W[2]-hard
B Lin, X Ren, Y Sun, X Wang
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
72023
The parameterized complexity of k-edge induced subgraphs
B Lin, Y Chen
Information and Computation 252, 138-160, 2017
6*2017
Improved hardness of approximating k-clique under ETH
B Lin, X Ren, Y Sun, X Wang
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
32023
Parameterized Inapproximability Hypothesis under ETH
V Guruswami, B Lin, X Ren, Y Sun, K Wu
arXiv preprint arXiv:2311.16587, 2023
12023
Parameterized algorithms to compute Ising partition function
H Hiraishi, H Imai, Y Iwata, B Lin
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2018
12018
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
V Guruswami, B Lin, X Ren, Y Sun, K Wu
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 24-35, 2024
2024
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
V Guruswami, B Lin, X Ren, Y Sun, K Wu
arXiv preprint arXiv:2404.08870, 2024
2024
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH
S Li, B Lin, Y Liu
arXiv preprint arXiv:2402.09825, 2024
2024
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
H Chu, B Lin
arXiv preprint arXiv:2312.11944, 2023
2023
系统目前无法执行此操作,请稍后再试。
文章 1–18