Pages that link to "Item:Q2891348"
From MaRDI portal
The following pages link to Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348):
Displaying 6 items.
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
