The following pages link to On a circle placement problem (Q1062430):
Displayed 18 items.
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- Uniform fourth order difference scheme for a singular perturbation problem (Q1118364) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Computing large planar regions in terrains, with an application to fracture surfaces (Q1827827) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING (Q3575389) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056) (← links)