Global t-Sweep Coverage Problem with Minimum Interference. - Bijaya K. Bhatta; Sangram Kishor Jena (ICIT, 2015)

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)

Total Domination in Unit Disk Graphs. - Sangram Kishor Jena; Gautam K. Das (CoRR, 2020)

Capacitated discrete unit disk cover. - Pawan K. Mishra; Sangram Kishor Jena; Gautam K. Das; S. V. Rao 001 (Discret. Appl. Math., 2020)

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

Total Domination in Geometric Unit Disk Graphs. - Sangram Kishor Jena; Gautam K. Das (CCCG, 2021)

Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs. - Sangram Kishor Jena; K. Subramani 001 (TAMC, 2022)

Vertex-edge domination in unit disk graphs. - Sangram Kishor Jena; Gautam K. Das (Discret. Appl. Math., 2022)

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

Differentiable Discrete Optimization Using Dataless Neural Networks. - Sangram Kishor Jena; K. Subramani 001; Alvaro Velasquez (COCOA (2), 2023)

Representation of Dominating Set Variants Using Dataless Neural Networks. - Sangram K. Jena 001; Piotr Wojciechowski 002 (AAIM (2), 2024)

Optimizing Cloud-Based Systems Through Resource-Constrained Distance Matching. - Sangram K. Jena 001; K. Subramani 001 (ALGOCLOUD, 2024)

A Differential Approach for Several NP-hard Optimization Problems. - Sangram Kishor Jena; K. Subramani 001; Alvaro Velasquez (ISAIM, 2024)

Designing dataless neural networks for kidney exchange variants. - Sangram K. Jena 001; K. Subramani 001; Alvaro Velasquez (Neural Comput. Appl., 2024)

The MASEMPR Problem and Its Applications in Logistics. - A. Subramani; K. Subramani 001; Piotr Wojciechowski 002; Sangram K. Jena 001 (CALDAM, 2025)

From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances. - Sangram K. Jena 001; K. Subramani 001 (IJTCS-FAW, 2025)

Analyzing the 3-path vertex cover problem in selected graph classes. - Sangram K. Jena 001; K. Subramani 001 (J. Comb. Optim., 2025)