Bingkai Lin

Available identifiers

zbMath Open lin.bingkaiMaRDI QIDQ729816

List of research outcomes

Publication	Date of Publication	Type
On lower bounds of approximating parameterized \(k\)-clique	2024-06-24	Paper
Constant approximating Parameterized \(k\)-\textsc{SetCover} is W[2]-hard	2024-05-14	Paper
Constant approximating k-clique is w[1]-hard	2023-11-14	Paper
Parameterized Intractability of Even Set and Shortest Vector Problem	2022-12-08	Paper
A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem	2022-07-21	Paper
A nearly 5/3-approximation FPT Algorithm for Min-k-Cut	2021-02-02	Paper
The Constant Inapproximability of the Parameterized Dominating Set Problem	2019-05-07	Paper
The parameterized complexity of the \(k\)-biclique problem	2019-02-25	Paper
The hardness of embedding grids and walls	2018-01-04	Paper
The parameterized complexity of \(k\)-biclique	2017-10-05	Paper
The parameterized complexity of \(k\)-edge induced subgraphs	2016-12-22	Paper
Multi-multiway cut problem on graphs of bounded branch width	2014-04-03	Paper
The Parameterized Complexity of k-Edge Induced Subgraphs	2013-08-12	Paper

Research outcomes over time

This page was built for person: Bingkai Lin