Minimum Dominating Set for a Point Set in $ IR^2$. - Ramesh K. Jallu; Prajwal R. Prasad; Gautam K. Das (CoRR, 2013)

Minimum Dominating Set Problem for Unit Disks Revisited. - Paz Carmi; Gautam K. Das; Ramesh K. Jallu; Subhas C. Nandy; Prajwal R. Prasad; Yael Stein (Int. J. Comput. Geom. Appl., 2015)

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

Improved Algorithm for Maximum Independent Set on Unit Disk Graph. - Ramesh K. Jallu; Gautam K. Das (CALDAM, 2016)

Hardness of Liar's Domination on Unit Disk Graphs. - Ramesh K. Jallu; Gautam K. Das (CoRR, 2016)

Liar's Domination in 2D. - Ramesh K. Jallu; Gautam K. Das (CALDAM, 2017)

Distributed construction of connected dominating set in unit disk graphs. - Ramesh K. Jallu; Prajwal R. Prasad; Gautam K. Das (J. Parallel Distributed Comput., 2017)

Minimum Spanning Tree of Line Segments. - Sanjana Dey; Ramesh K. Jallu; Subhas C. Nandy (COCOON, 2018)

Liar's Dominating Set in Unit Disk Graphs. - Ramesh K. Jallu; Sangram Kishor Jena; Gautam K. Das (COCOON, 2018)

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (FAW, 2018)

Generalized Liar's Dominating Set in Graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das (CoRR, 2019)

The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (CoRR, 2020)

Efficient independent set approximation in unit disk graphs. - Gautam K. Das; Guilherme Dias da Fonseca; Ramesh K. Jallu (Discret. Appl. Math., 2020)

Liar's dominating set problem on unit disk graphs. - Ramesh K. Jallu; Gautam K. Das (Discret. Appl. Math., 2020)

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

Liar's domination in unit disk graphs. - Ramesh K. Jallu; Sangram Kishor Jena; Gautam K. Das (Theor. Comput. Sci., 2020)

Minimum Color Spanning Circle in Imprecise Setup. - Ankush Acharyya; Ramesh K. Jallu; Vahideh Keikha; Maarten Löffler; Maria Saumell (COCOON, 2021)

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. - Ankush Acharyya; Ramesh K. Jallu; Maarten Löffler; Gert G. T. Meijer; Maria Saumell; Rodrigo I. Silveira; Frank Staals (GIScience (II), 2021)

Terrain prickliness: theoretical grounds for low complexity viewsheds. - Ankush Acharyya; Ramesh K. Jallu; Maarten Löffler; Gert G. T. Meijer; Maria Saumell; Rodrigo I. Silveira; Frank Staals; Hans Raj Tiwary (CoRR, 2021)

On the minimum spanning tree problem in imprecise set-up. - Sanjana Dey; Ramesh K. Jallu; Subhas C. Nandy (CoRR, 2021)

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

Half-Guarding Weakly-Visible Polygons and Terrains. - Nandhana Duraisamy; Hannah Miller Hillberg; Ramesh K. Jallu; Erik Krohn; Anil Maheshwari; Subhas C. Nandy; Alex Pahlow (FSTTCS, 2022)

On d-distance m-tuple (ℓ, r)-domination in graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das (Inf. Process. Lett., 2022)

Minimum color spanning circle of imprecise points. - Ankush Acharyya; Ramesh K. Jallu; Vahideh Keikha; Maarten Löffler; Maria Saumell (Theor. Comput. Sci., 2022)