12 citations · 22 across the 2 of their papers we have counts for
2 papers
cs.CG2010★ 10 cited
Approximation Algorithms for Dominating Set in Disk Graphs
Matt Gibson, Imran A. Pirwani
We consider the problem of finding a lowest cost dominating set in a given disk graph containing disks. The problem has been extensively studied on subclasses of disk graphs, y…
cs.CG2009★ 12 cited
A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Imran A. Pirwani, Mohammad R. Salavatipour
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor ap…