Pages that link to "Item:Q2920123"
From MaRDI portal
The following pages link to Domination problems in nowhere-dense classes of graphs (Q2920123):
Displaying 44 items.
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes (Q4629992) (← links)
- Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs (Q4636649) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- (Q5090476) (← links)
- (Q5090497) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- (Q5094135) (← links)
- (Q5109514) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- (Q5743379) (← links)
- (Q5743498) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- (Q6089671) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
