עקוב אחר
Lin BingKai
כותרת
צוטט על ידי
צוטט על ידי
שנה
The Parameterized Complexity of the k-Biclique Problem‏
B Lin‏
Journal of the ACM (JACM) 65 (5), 1-23, 2018‏
102*2018
The constant inapproximability of the parameterized dominating set problem‏
Y Chen, B Lin‏
SIAM Journal on Computing 48 (2), 513-533, 2019‏
682019
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‏
46*2021
A Simple Gap-producing Reduction for the Parameterized Set Cover Problem‏
B Lin‏
International Colloquium on Automata, Languages and Programming (ICALP 2019), 2019‏
362019
Constant approximating k-clique is W[1]-hard‏
B Lin‏
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021‏
292021
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‏
182020
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‏
132024
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‏
132023
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‏
132021
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‏
102013
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‏
92023
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
The parameterized complexity of k-edge induced subgraphs‏
B Lin, Y Chen‏
Information and Computation 252, 138-160, 2017‏
6*2017
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‏
32024
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‏
22024
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set‏
H Chu, B Lin‏
arXiv preprint arXiv:2312.11944, 2023‏
22023
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
On Average Baby PIH and Its Applications‏
Y Liu, Y Chen, S Li, B Lin, X Zheng‏
42nd International Symposium on Theoretical Aspects of Computer Science …, 2025‏
2025
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–18