Domination problems in nowhere-dense classes of graphs
From MaRDI portal
Publication:2920123
Recommendations
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Directed nowhere dense classes of graphs
- FPT algorithms for domination in sparse graphs and beyond
Cited in
(45)- Twin-width and polynomial kernels
- Confronting intractability via parameters
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Directed nowhere dense classes of graphs
- Irrelevant vertices for the planar disjoint paths problem
- Computing vertex-surjective homomorphisms to partially reflexive trees
- Lossy kernels for connected dominating set on sparse graphs
- Reconfiguration on nowhere dense graph classes
- Enumeration for FO Queries over Nowhere Dense Graphs
- Tight bounds for linkages in planar graphs
- On directed covering and domination problems
- Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs
- scientific article; zbMATH DE number 7764115 (Why is no real title available?)
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
- Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
- Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
- On low tree-depth decompositions
- Domination above \(r\)-independence: does sparseness help?
- Lossy kernels for connected dominating set on sparse graphs
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Smaller kernels for several FPT problems based on simple observations
- Graph minors and parameterized algorithm design
- k-Efficient domination: Algorithmic perspective
- On the parameterized complexity of \([1,j]\)-domination problems
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- On the Parameterized Complexity of [1,j]-Domination Problems
- Bounds on half graph orders in powers of sparse graphs
- Kernelization of edge perfect code and its variants
- Colouring and covering nowhere dense graphs
- FPT algorithms for domination in sparse graphs and beyond
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Recovering sparse graphs
- Modeling limits in hereditary classes: reduction and application to trees
- Coloring and covering nowhere dense graphs
- On directed covering and domination problems
- Improved kernel results for some FPT problems based on simple observations
- On the parameterized complexity of reconfiguration of connected dominating sets
- Progressive algorithms for domination and independence
- The kernelization complexity of connected domination in graphs with (no) small cycles
- Enumerating answers to first-order queries over databases of low degree
- Algorithmic properties of sparse digraphs
- First-order queries on classes of structures with bounded expansion
- Perfect domination and small cycles
- Dominating set is fixed parameter tractable in claw-free graphs
This page was built for publication: Domination problems in nowhere-dense classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920123)
