Publications Links : [ DBLP ] [ Google Scholar ] [ Researchgate ]

Publications:

• [C16] Sangram K. Jena, Computational Hardness and Approximation Limits of the Co-Path Set Problem in Bipartite Graphs, The 9th International Symposium on Combinatorial Optimization (ISCO), 2026. PDF

• [C15] Azib Farooq and Sangram K. Jena, A Machine Learning Framework for Dominating Set Variants in Combinatorial Optimization, The 9th International Symposium on Combinatorial Optimization (ISCO), 2026. PDF

• [J10 ] Sangram K. Jena, K. Subramani, Andrew Gautier, Piotr Wojciechowski, and Alvaro Velasquez, Differential techniques for addressing SAT variants and related problems, Annals of Mathematics and Artificial Intelligence (AMAI), 2026 (accepted). PDF

• [C14] Andrew Gautier, Piotr Wojciechowski, Sangram K. Jena, K. Subramani, and Alvaro Velasquez, Lightweight satisfiability solving using dataless neural networks, The International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2026. PDF

• [J9 ] Sangram K. Jena and K. Subramani, Computational and approximation complexities of MINNAESAT variants, Discrete Mathematics, Algorithms and Applications (DMAA), 2550154, 2025. PDF

• [J8 ] Sangram K. Jena, K. Subramani, and Alvaro Velasquez, Advancing Discrete Optimization: Novel Approaches with Dataless Neural Networks, Journal of Combinatorial Optimization (JOCO), 50 (39): 1--20, 2025. PDF

• [J7 ] Sangram K. Jena, K. Subramani, and Alvaro Velasquez, Exploring Cycle Cover Variants: A Dataless Neural Networks Approach, Neurocomputing, 656: 131361, 2025. PDF

• [C13] Sangram K. Jena and K. Subramani, From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances, International Joint Conference on Theoretical Computer Science - Frontier of Algorithmic Wisdom (IJTCS-FAW), pp. 103-117, 2025. PDF

• [J6 ] Sangram K. Jena and K. Subramani, Analyzing the 3-path vertex cover problem in selected graph classes, Journal of Combinatorial Optimization (JOCO), 49(4): 58 (2025). PDF

• [C12 ] A. Subramani, K. Subramani, Piotr Wojciechowski, and Sangram K. Jena, The MASEMPR problem and its applications in logistics, The 11th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), pp. 331-342, 2025. PDF

• [C11 ] Sangram K. Jena and K. Subramani, Optimizing Cloud-Based Systems through Resource-Constrained Distance Matching, The International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), pp. 62-74, 2024. PDF

• [J5 ] Sangram K. Jena, K. Subramani, and Alvaro Velasquez, Designing Dataless Neural Networks for Kidney Exchange Variants, Neural Computing and Applications (NCAA), 2024. PDF

• [C10 ] Sangram K. Jena and Piotr Wojciechowski, Representation of Dominating Set Variants using Dataless Neural Networks,  The 18th International Conference on Algorithmic Aspects in Information and Management (AAIM), 2024. PDF

• [C9 ] Sangram K. Jena, K. Subramani, and Alvaro Velasquez, A differential approach for several NP-hard optimization problems,  The International Symposium on Artificial Intelligence and Mathematics (ISAIM), pp. 68--80, 2024. PDF

• [C8 ] Sangram K. Jena, K. Subramani, and Alvaro Velasquez, Differentiable Discrete Optimization using Dataless Neural Networks,  The 16th Annual International Conference on Combinatorial Optimization and Applications (COCOA), LNCS - 14462, pp. 3--15, 2023. PDF

• [J4 ] Sangram K. Jena and Gautam K. Das, Vertex-Edge Domination in Unit Disk Graphs, Discrete Applied Mathematics (DAM), 319: 351-361, 2022. PDF

• [J3 ] Sangram K. Jena, Ramesh K. Jallu, and Gautam K. Das,  On d-distance m-tuple (ℓ, r)-domination in graphs, Information Processing Letters (IPL), 174: 106178, 2022. PDF

• [C7 ] Sangram K. Jena and K. Subramani, Analyzing the 3-path vertex cover problem in planar bipartite graphs, The 17th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS - 13571, pp. 103-115, 2022. PDF

• [C6 ] Sangram K. Jena and Gautam K. Das, Total Domination in Unit Disk Graphs, The 33rd Canadian Conference on Computational Geometry (CCCG), pp. 219-227, 2021. PDF

• [J2 ] Pawan K. Mishra, Sangram K. Jena, Gautam. K. Das, and  S.V. Rao, Capacitated discrete unit disk cover, Discrete Applied Mathematics (DAM), 285: 242-251, 2020. PDF

• [J1 ] Ramesh K. Jallu, Sangram K. Jena, and Gautam K. Das, Liar's domination in unit disk graphs, Theoretical Computer Science (TCS), 845: 38-49, 2020. PDF

• [C5 ] Sangram K. Jena, and Gautam K. Das, Vertex-Edge Domination in Unit Disk Graphs, The 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS - 12016, pp. 67-78, 2020. PDF

• [C4 ] Pawan K. Mishra, Sangram K. Jena, Gautam. K. Das, and  S.V. Rao, Capacitated discrete unit disk cover, The 13th International Conference and Workshops on Algorithms and Computation (WALCOM), LNCS - 11355, pp. 407-418, 2019. PDF

• [C3 ] Ramesh K. Jallu, Sangram K. Jena, and Gautam K. Das, Liar's Dominating Set in Unit Disk Graphs, The 24th International Computing and Combinatorics Conference (COCOON), LNCS - 10976, pp. 516-528, 2018. PDF

• [C2 ] Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, and  Subhas C. Nandy, The Maximum Distance-d Independent Set Problem on Unit Disk Graphs, The 12th International Frontiers of Algorithmics Workshop (FAW), LNCS - 10823, pp. 68-80, 2018. PDF

• [C1 ] B. K. Bhatta and S. K. Jena, Global t-Sweep Coverage Problem with Minimum Interference, The International Conference on Information Technology (ICIT), IEEE, pp. 20-25, 2015. PDF