Pages that link to "Item:Q3583575"
From MaRDI portal
The following pages link to Polynomial-time data reduction for dominating set (Q3583575):
Displayed 29 items.
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- Fixed-parameter tractability results for full-degree spanning tree and its dual (Q3057174) (← links)
- On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- The fullerene graphs with a perfect star packing (Q5056834) (← links)
- (Q5090497) (← links)
- (Q5092402) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← 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)
- (Q5743379) (← links)
- (Q5743381) (← links)
- (Q6089655) (← links)