The following pages link to Bingkai Lin (Q729816):
Displaying 10 items.
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- The hardness of embedding grids and walls (Q1687915) (← links)
- The Parameterized Complexity of k-Edge Induced Subgraphs (Q2843289) (← links)
- The Parameterized Complexity of the <i>k</i> -Biclique Problem (Q4625655) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem (Q5056405) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830) (← links)
- The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp> (Q5363087) (← links)
- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width (Q5405943) (← links)
