1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2024
FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
Huairui Chu, Bingkai Lin
Treewidth is a useful tool in designing graph algorithms. Although many NP-hard graph problems can be solved in linear time when the input graphs have small treewidth, there are pr…
cs.CC2023★ 1 cited
A Tight Lower Bound for Compact Set Packing
Huairui Chu
This note is devoted to show a simple proof of a tight lower bound of the parameterized compact set packing problem, based on ETH.