1 citations · 1 across the 5 of their papers we have counts for
5 papers
Parameterized Approximation of Rectangle Stabbing
Huairui Chu, Ajaykrishnan E S, Daniel Lokshtanov +4
In the Rectangle Stabbing problem, input is a set of axis-parallel rectangles and a set of axis parallel lines in the plane. The task is to find a minimum siz…
Faster Parameterized Vertex Multicut
Huairui Chu, Yuxi Liu, Daniel Lokshtanov +3
In the {\sc Vertex Multicut} problem the input consists of a graph , integer , and a set of pairs of vertices of . The ta…
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…
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.
An Improved Upper Bound for SAT
Huairui Chu, Mingyu Xiao, Zhe Zhang
We show that the CNF satisfiability problem can be solved time, where is the number of clauses in the formula, improving the known upper bounds g…