Pages that link to "Item:Q4601883"
From MaRDI portal
The following pages link to Kernelization and Sparseness: the case of Dominating Set (Q4601883):
Displaying 35 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Improved bounds for weak coloring numbers (Q2121806) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- Harmless sets in sparse classes (Q2169963) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← 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)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- (Q5090476) (← links)
- (Q5090497) (← links)
- (Q5092402) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- (Q5111296) (← 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)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- (Q6089655) (← links)
- (Q6089671) (← links)
- Hardness of the generalized coloring numbers (Q6614401) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
