H-free Subdivision is polynomial-time solvable when every component of H is a subdivided star or a subdivided bistar with at most one bistar, and NP-complete with no 2^{o(k)} n^{O(1)} algorithm under ETH for H satisfying any of seven listed structural conditions.
Parameterized algorithms , volume 5
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
FPT algorithm for VRP by treewidth; paraNP- and W-hardness for CVRP by treewidth and other parameters; XP algorithm for CVRP by treewidth plus capacity.
citing papers explorer
-
On the complexity of edge subdivision to $H$-free graphs
H-free Subdivision is polynomial-time solvable when every component of H is a subdivided star or a subdivided bistar with at most one bistar, and NP-complete with no 2^{o(k)} n^{O(1)} algorithm under ETH for H satisfying any of seven listed structural conditions.
-
Parameterized Complexity of Vehicle Routing
FPT algorithm for VRP by treewidth; paraNP- and W-hardness for CVRP by treewidth and other parameters; XP algorithm for CVRP by treewidth plus capacity.