Unit Disk Cover Problem - Rashmisnata Acharyya; Manjanna Basappa; Gautam K. Das (CoRR, 2012)

Unit disk cover problem in 2D. - Manjanna Basappa; Rashmisnata Acharyya; Gautam K. Das (J. Discrete Algorithms, 2015)

The Euclidean k-Supplier Problem in. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (ALGOSENSORS, 2016)

Discrete unit square cover problem. - Manjanna Basappa; Gautam K. Das (Discret. Math. Algorithms Appl., 2018)

Constrained k-Center Problem on a Convex Polygon. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das (Int. J. Found. Comput. Sci., 2020)

Constrained Obnoxious Facility Location on a Line Segment. - Vishwanath R. Singireddy; Manjanna Basappa (CCCG, 2021)

The k-Colorable Unit Disk Cover Problem. - Monith S. Reyunuru; Kriti Jethlia; Manjanna Basappa (ICCSA (1), 2021)

Interference Reduction in Directional Wireless Networks. - Manjanna Basappa; Sudeepta Mishra (ICDCIT, 2021)

Edge-Vertex Dominating Set in Unit Disk Graphs. - Vishwanath R. Singireddy; Manjanna Basappa (CoRR, 2021)

Line segment disk cover. - Manjanna Basappa (Discret. Appl. Math., 2021)

The Euclidean k-supplier problem in IR2. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (Oper. Res. Lett., 2021)

Max-Min k-Dispersion on a Convex Polygon. - Vishwanath R. Singireddy; Manjanna Basappa (CoRR, 2022)

Algorithms for k-Dispersion for Points in Convex Position in the Plane. - Vishwanath R. Singireddy; Manjanna Basappa; Joseph S. B. Mitchell (CALDAM, 2023)

Line-Constrained k-Semi-Obnoxious Facility Location. - Vishwanath R. Singireddy; Manjanna Basappa; N. R. Aravind (CoRR, 2023)

Dispersing facilities on planar segment and circle amidst repulsion. - Vishwanath R. Singireddy; Manjanna Basappa (J. Glob. Optim., 2024)

Approximability of Edge-Vertex Domination in Unit Disk Graphs. - Vishwanath R. Singireddy; Manjanna Basappa (ICAA, 2025)