Follow
Lin BingKai
Title
Cited by
Cited by
Year
The Parameterized Complexity of the k-Biclique Problem
B Lin
Journal of the ACM (JACM) 65 (5), 1-23, 2018
73*2018
The constant inapproximability of the parameterized dominating set problem
Y Chen, B Lin
SIAM Journal on Computing 48 (2), 513-533, 2019
542019
A Simple Gap-producing Reduction for the Parameterized Set Cover Problem
B Lin
International Colloquium on Automata, Languages and Programming (ICALP 2019), 2019
172019
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
142021
Fixed-parameter approximability of Boolean MinCSPs
É Bonnet, L Egri, B Lin, D Marx
arXiv preprint arXiv:1601.04935, 2018
112018
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
92020
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
72017
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
72013
The parameterized complexity of k-edge induced subgraphs
B Lin, Y Chen
Information and Computation 252, 138-160, 2017
6*2017
Constant Approximating k-Clique is W[1]-hard
B Lin
https://arxiv.org/abs/2102.04769, 0
4*
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
Constant Approximating Parameterized -SetCover is W[2]-hard
B Lin, X Ren, Y Sun, X Wang
arXiv preprint arXiv:2202.04377, 2022
2022
On Lower Bounds of Approximating Parameterized -Clique
B Lin, X Ren, Y Sun, X Wang
arXiv preprint arXiv:2111.14033, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–13