4 papers
Maximum Independent Sets in Disk Graphs with Disks in Convex Position
Anastasiia Tkachenko, Haitao Wang
For a set of disks in the plane, its disk graph is the graph with vertex set , where two vertices are adjacent if and only if the corres…
Computing Dominating Sets in Disk Graphs with Centers in Convex Position
Anastasiia Tkachenko, Haitao Wang
Given a set of points in the plane and a collection of disks centered at these points, the disk graph has vertex set , with an edge between two vertices if their…
Computing Maximum Cliques in Unit Disk Graphs
Anastasiia Tkachenko, Haitao Wang
Given a set of points in the plane, the unit-disk graph is a graph with as its vertex set such that two points of have an edge if their Euclidean distance is…
Dominating Set, Independent Set, Discrete -Center, Dispersion, and Related Problems for Planar Points in Convex Position
Anastasiia Tkachenko, Haitao Wang
Given a set of points in the plane, its unit-disk graph is a graph with as its vertex set such that two points of are connected by an edge if their (Euclidea…