The following pages link to Computing and Combinatorics (Q5716937):
Displaying 13 items.
- The checkpoint problem (Q714790) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- Minimizing interference of a wireless ad-hoc network in a plane (Q936528) (← links)
- A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Solving a minimum-power covering problem with overlap constraint for cellular network design (Q1046080) (← links)
- Parameterized complexity of minimum membership dominating set (Q2154108) (← links)
- Minimum membership covering and hitting (Q5918296) (← links)
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
- Improved algorithms for minimum-membership geometric set cover (Q6547827) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- Approximation algorithms for minimum ply covering of points with unit squares and unit disks (Q6652449) (← links)
