Sangram K. Jena

According to our database, Sangram K. Jena authored at least 23 papers between 2015 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

An Algorithmic Analysis of MAXNAESAT Variants.

Sangram K. Jena, K. Subramani

Theory Comput. Syst., June, 2026

2025

Advancing discrete optimization: novel approaches with dataless neural networks.

Sangram K. Jena, K. Subramani, Alvaro Velasquez

J. Comb. Optim., November, 2025

Analyzing the 3-path vertex cover problem in selected graph classes.

Sangram K. Jena, K. Subramani

J. Comb. Optim., May, 2025

Exploring cycle cover variants: A dataless neural networks approach.

Sangram K. Jena, K. Subramani, Alvaro Velasquez

Neurocomputing, 2025

From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances.

Sangram K. Jena, K. Subramani

Proceedings of the Frontiers of Algorithmics - 19th International Joint Conference, 2025

The MASEMPR Problem and Its Applications in Logistics.

A. Subramani, K. Subramani, Piotr Wojciechowski, Sangram K. Jena

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

Designing dataless neural networks for kidney exchange variants.

Sangram K. Jena, K. Subramani, Alvaro Velasquez

Neural Comput. Appl., December, 2024

A Differential Approach for Several NP-hard Optimization Problems.

Sangram Kishor Jena, K. Subramani, Alvaro Velasquez

Proceedings of the Artificial Intelligence and Image Analysis, 2024

Optimizing Cloud-Based Systems Through Resource-Constrained Distance Matching.

Sangram K. Jena, K. Subramani

Proceedings of the Algorithmic Aspects of Cloud Computing - 9th International Symposium, 2024

Representation of Dominating Set Variants Using Dataless Neural Networks.

Sangram K. Jena, Piotr Wojciechowski

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Differentiable Discrete Optimization Using Dataless Neural Networks.

Sangram Kishor Jena, K. Subramani, Alvaro Velasquez

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

On <i>d</i>-distance <i>m</i>-tuple (<i>ℓ</i>, <i>r</i>)-domination in graphs.

Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das

Inf. Process. Lett., 2022

Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs.

Sangram Kishor Jena, K. Subramani

Proceedings of the Theory and Applications of Models of Computation, 2022

2021

Total Domination in Geometric Unit Disk Graphs.

Sangram Kishor Jena, Gautam K. Das

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Liar's domination in unit disk graphs.

Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das

Theor. Comput. Sci., 2020

Total Domination in Unit Disk Graphs.

Sangram Kishor Jena, Gautam K. Das

CoRR, 2020

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

Vertex-Edge Domination in Unit Disk Graphs.

Sangram Kishor Jena, Gautam K. Das

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Generalized Liar's Dominating Set in Graphs.

Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das

CoRR, 2019

Capacitated Discrete Unit Disk Cover.

Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.

Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Liar's Dominating Set in Unit Disk Graphs.

Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2015

Global t-Sweep Coverage Problem with Minimum Interference.

Bijaya K. Bhatta, Sangram Kishor Jena

Proceedings of the 2015 International Conference on Information Technology, 2015