FPT algorithms for domination in sparse graphs and beyond
From MaRDI portal
Recommendations
Cites work
- A family of regular graphs of girth 5
- Approximation algorithms for combinatorial problems
- Domination problems in nowhere-dense classes of graphs
- First order properties on nowhere dense structures
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- FPT algorithms for connected feedback vertex set
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2123255 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Incompressibility through Colors and IDs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- On nowhere dense graphs
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- Parametrized complexity theory.
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
- Structural Properties of Sparse Graphs
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- The dominating set problem is fixed parameter tractable for graphs of bounded genus
- The parameterized complexity of k-biclique
Cited in
(29)- Constant-factor approximation of the domination number in sparse graphs
- Twin-width and polynomial kernels
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Spy game: FPT-algorithm, hardness and graph products
- FPT algorithms for domination in biclique-free graphs
- Domination problems in nowhere-dense classes of graphs
- Sparse dominance queries for many points in optimal time and space
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- Harary polynomials
- Operator-free sparse domination
- Progressive algorithms for domination and independence
- On the Parameterized Complexity of [1,j]-Domination Problems
- Domination above \(r\)-independence: does sparseness help?
- scientific article; zbMATH DE number 7310159 (Why is no real title available?)
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- An FPT Algorithm for Minimum Additive Spanner Problem.
- Dominating set is fixed parameter tractable in claw-free graphs
- Max-SAT with cardinality constraint parameterized by the number of clauses
- On solution discovery via reconfiguration
- Max-SAT with cardinality constraint parameterized by the number of clauses
- Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
- Galactic token sliding
- Comparing width parameters on graph classes
- Structural parameterizations of the biclique-free vertex deletion problem
- Complexity framework for forbidden subgraphs. I: The framework
- A survey on the parameterized complexity of reconfiguration problems
- Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
- Breaking a graph into connected components with small dominating sets
- The PACE 2025 parameterized algorithms and computational experiments challenge: dominating set and hitting set
This page was built for publication: FPT algorithms for domination in sparse graphs and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740694)
