O(n^3 log n) algorithm computes maximum (weighted) independent sets for disk graphs with all disks on the convex hull, plus O(n^3 log^2 n) for k-dispersion on the same inputs.
Approximation Algorithms for Maxi mum Independent Set of Pseudo-Disks
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Existence of bounded-genus supports for cross-free intersection hypergraphs from connected subgraphs of bounded-genus host graphs, generalizing prior planar results.
Proves NP-hardness of selecting a maximum centre-disjoint subset of disks with merging of the rest and gives ILP plus linear-time algorithm for collinear centers.
citing papers explorer
-
Maximum Independent Sets in Disk Graphs with Disks in Convex Position
O(n^3 log n) algorithm computes maximum (weighted) independent sets for disk graphs with all disks on the convex hull, plus O(n^3 log^2 n) for k-dispersion on the same inputs.
-
On Supports for graphs of bounded genus
Existence of bounded-genus supports for cross-free intersection hypergraphs from connected subgraphs of bounded-genus host graphs, generalizing prior planar results.
-
Maximum Centre-Disjoint Mergeable Disks
Proves NP-hardness of selecting a maximum centre-disjoint subset of disks with merging of the rest and gives ILP plus linear-time algorithm for collinear centers.