Sidestepping barriers for dominating set in parameterized complexity
From MaRDI portal
Cites work
- A linear algorithm for the domination number of a series-parallel graph
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- A threshold of ln n for approximating set cover
- Analytical approach to parallel repetition
- Dominating set is fixed parameter tractable in claw-free graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Domination when the stars are out
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Exact algorithms for dominating set
- Exact algorithms for maximum independent set
- Exponential-time approximation of weighted set cover
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 7788352 (Why is no real title available?)
- Known algorithms on graphs of bounded treewidth are probably optimal
- Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
- On the complexity of fixed parameter clique and dominating set
- On the Parameterized Complexity of Approximating Dominating Set
- On the possibility of faster \textsc{SAT} algorithms
- Parameterized algorithms
- Parameterized Complexity of Independence and Domination on Geometric Graphs
This page was built for publication: Sidestepping barriers for dominating set in parameterized complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926176)
