We introduce the exact coloured k-enclosing object problem: given a set P of n points in R, each of which has an associated colour in {1, . . . , t}, and a vector c = (c1, . . . , ct), where ci âˆˆ Zâ€¦ (More)

Based on Software Engineering discipline, unit testing play significant rule in testing procedure to determine if the source code fit for use. A unit test is the smallest testable part of anâ€¦ (More)

We answer a question of Atienza et al. [4] by showing that the circular CCG problem is NP-complete. If we cover a set of objects on the plane with discs whose interiors are pairwise disjoint, then weâ€¦ (More)

In various wireless networking settings, node locations determine a networkâ€™s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additionalâ€¦ (More)

eprints@whiterose.ac.uk https://eprints.whiterose.ac.uk/ Reuse This article is distributed under the terms of the Creative Commons Attribution (CC BY) licence. This licence allows you to distribute,â€¦ (More)