Bingkai Lin

activity

20112026

most citedThe Parameterized Complexity of k-Biclique

37 citations · 43 across the 12 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.CC2021

On Lower Bounds of Approximating Parameterized $k$ -Clique

Bingkai Lin, Xuandi Ren, Yican Sun +1

Given a simple graph $G$ and an integer $k$ , the goal of $k$ -Clique problem is to decide if $G$ contains a complete subgraph of size $k$ . We say an algorithm approximates $k$ -Cliqu…

cs.CC2021

Constant Approximating k-Clique is W[1]-hard

Bingkai Lin

For every graph $G$ , let $ω (G)$ be the largest size of complete subgraph in $G$ . This paper presents a simple algorithm which, on input a graph $G$ , a positive integer $k$ and a sm…

On Lower Bounds of Approximating Parameterized k-Clique

Constant Approximating k-Clique is W[1]-hard

On Lower Bounds of Approximating Parameterized $k$ -Clique