Skip to Main Content
Sangram Jena
Visiting Assistant Professor
Computer Science and Software Engineering

Sangram K. Jena, Ph.D.

Contact Info

513-529-0335
McVey Data Science Building 379
Personal Website

Education

  • Ph.D., Computer Science, Indian Institute of Technology Guwahati, India, 2021.
  • Master of Technology, Computer Science, Utkal University, India, 2015.

Research Bio

Dr. Jena is a Visiting Assistant Professor in the Department of Computer Science and Software Engineering at Miami University. Prior to joining Miami University, Dr. Jena held a postdoctoral fellowship in the Lane Department of Computer Science and Electrical Engineering at West Virginia University, where he contributed to both research and teaching at the forefront of computer science.

Dr. Jena's research spans two significant fields of computer science, Theoretical Computer Science and Machine Learning, with a focus on solving complex combinatorial optimization problems and exploring their real-world applications. His work emphasizes the development of efficient approximation, exact, and Fixed-Parameter Tractable algorithms to address computationally challenging problems in areas such as cloud computing, neural networks, resource optimization, and network security. In addition, he has designed Dataless Neural Networks to tackle a range of combinatorial optimization problems.

Dr. Jena is strongly committed to advancing scientific research and securing prestigious research funding from leading organizations. In 2022, he served as a summer faculty at the Air Force Research Laboratory in Rome, NY, where he successfully led research projects. More recently, in 2023, he served as a Co-PI on a research grant awarded by the Defense Advanced Research Projects Agency (DARPA), contributing to groundbreaking research initiatives in the field of Machine Learning.

Dr. Jena's teaching experience spans key courses such as Analysis of Algorithms, Fundamentals of Programming and Problem Solving, Data/Computer Communications, and Discrete Mathematics, reflecting his dedication to cultivating critical thinking and problem-solving skills in students. His research has been widely published in leading international journals and conferences, further solidifying his reputation as a thought leader in the field.

In addition to his academic and research contributions, Dr. Jena actively serves the global computer science community. He has held roles on program committees for international conferences and provides peer-review services for several high-impact journals and conferences.

Research Interests

  1. Algorithmic Graph Theory
  2. Computational and Fine-grained Complexities
  3. Dataless Neural Network
  4. Computational Geometry

Research Experience

  1. Miami University, OH, USA, Visiting Assistant Professor, August 19, 2024 - Present.
  2. West Virginia University, WV, USA, Post-Doctoral Fellow, August 12, 2022 - August 15, 2024.
  3. Air Force Research Laboratory, Rome, NY, USA, Summer Faculty, May 16, 2022 - August 11, 2022.
  4. West Virginia University, WV, USA, Post-Doctoral Fellow, September 21, 2021 - May 12, 2022.
  5. Indian Institute of Technology Guwahati, Assam, India, Research Scholar, January 01, 2016 - April 21, 2021.
  6. Indian Institute of Technology Delhi, New Delhi, India, Graduate Research Assistant, February 2015 - July 2015.
  7. Utkal University, Odisha, India, Graduate Research Assistant, August 2013 - January 2015.

Awards and Achievements

  • Awarded MHRD scholarship for pursuing Ph.D. at IIT Guwahati.
  • Best Student Poster Award (2nd Place), Coverage Problems and its complexity, Research Conclave, March 18-20, 2016, IIT Guwahati.
  • Best Thesis Award, Masters of Technology in Computer Science, School of Mathematics, Statistics, and Computer Science, Utkal University, 2015.

External Research Grant

Title: Maximum Cardinality Distance Matching Problem
Position: PI
Agency: Air Force Research Laboratory (AFRL), Rome, NY, USA
Award: FA8750-19-3-1000 & FA8750-20-3-1003
Duration: 05/2022 - 08/2022
Amount: $29,708.73

Title: Differential Complexity in Neural Networks - Theoretical and Empirical Analyses
Position: Co-PI
Agency: Defense Advanced Research Projects Agency (DARPA)
Award: HR001123S0001-FP-004
Duration: 03/23 - 12/23
Amount: $151,629
Contact: Dr. Alvaro Velasquez

Technical Skills

  • Programming Languages: C, C++, Java, Python
  • Software and Platforms: MATLAB, LaTeX, Overleaf
  • Operating Systems: Windows, Linux, Mac

Publication History

Journal Publications

  1. Sangram K. Jena, K. Subramani, and Alvaro Velasquez, Designing Dataless Neural Networks for Kidney Exchange Variants, Neural Computing and Applications (NCAA), Volume 36, 2024.
  2. Sangram K. Jena, and Gautam K. Das, Vertex-Edge Domination in Unit Disk Graphs, Discrete Applied Mathematics (DAM), 319: 351-361, 2022.
  3. Sangram K. Jena, Ramesh K. Jallu, and Gautam K. Das, On d-distance m-tuple (l,r)-domination in graphs, Information Processing Letters (IPL), 174: 106178, 2022.
  4. Pawan K. Mishra, Sangram K. Jena, Gautam. K. Das, and S.V. Rao, Capaci- tated discrete unit disk cover, Discrete Applied Mathematics (DAM), 285: 242-251, 2020.
  5. 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.

Conference Publications

  1. Sangram K. Jena and K. Subramani, Optimizing Resource-Constrained Distance Matching for Cloud-Based Systems, The International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2024.
  2. 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.
  3. 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), 2024.
  4. 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.
  5. Sangram K. Jena, and K. Subramani, Analyzing the 3-path vertex cover problem in planar bipartite graphs, 17th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS - 13571, pp. 103–115, 2022.
  6. Sangram K. Jena, and Gautam K. Das, Total Domination in Unit Disk Graphs, 33rd Canadian Conference on Computational Geometry (CCCG), pp. 219–227, 2021.
  7. Sangram K. Jena, and Gautam K. Das, Vertex-Edge Domination in Unit Disk Graphs, Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS - 12016, pp. 67–78, 2020.
  8. Pawan K. Mishra, Sangram K. Jena, Gautam. K. Das, and S.V. Rao, Capacitated discrete unit disk cover, Workshops on Algorithms and Computation (WALCOM), LNCS - 11355, pp. 407–418, 2019.
  9. Ramesh K. Jallu, Sangram K. Jena, and Gautam K. Das, Liar’s Dominating Set in Unit Disk Graphs, Computing and Combinatorics Conference (COCOON), LNCS - 10976, pp. 516–528, 2018.
  10. Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, and Subhas C. Nandy, The Maximum Distance-d Independent Set Problem on Unit Disk Graphs , Frontiers of Algorithmics Workshop (FAW), LNCS - 10823, pp. 68–80, 2018.
  11. B. K. Bhatta, and S. K. Jena, Global t-Sweep Coverage Problem with Minimum Interference , International Conference on Information Technology (ICIT), IEEE, pp. 20–25, 2015.

Seminars / Talks

  1. Differentiable Discrete Optimization using Dataless Neural Networks, December 15-18, 2023, The 16th Annual International Conference on Combinatorial Optimization and Applications (COCOA), Hawaii, USA.
  2. Analyzing the 3-path vertex cover problem in planar bipartite graphs, September 16-18, 2022, The 17th Annual Conference on Theory and Applications of Models of Computation (TAMC), Tianjin, China.
  3. Total Domination in Unit Disk Graphs, August 10-12, 2021, 33rd Canadian Con- ference on Computational Geometry (CCCG), Halifax, Nova Scotia, Canada.
  4. Vertex-Edge Domination in Unit Disk Graphs, February 13-15, 2020, Conference on Algorithms and Discrete Applied Mathematics (CALDAM), IIT Hyderabad.
  5. The Computational Complexity of NP-hard Problems, Weierstrass Day, November 25-26, 2018, IIT Guwahati.
  6. Coverage Problems and its complexity, Research Conclave, March 18-20, 2016, IIT Guwahati.
  7. Global t-Sweep Coverage Problem with Minimum Interference, December 21-23, 2015, International Conference on Information Technology (ICIT), Xavier University.

Professional Services

Program Committee Member: Technical Program Committee Member, International Conference on Machine Learning, Image Processing, Network Security and Data Sciences (MIND)

Peer-Reviewing Service

  • Reviewer, RAIRO - Operations Research.
  • Reviewer, AIMS Mathematics.
  • Reviewer, Discussiones Mathematicae Graph Theory (DMGT).
  • Reviewer, Journal of Applied Mathematics and Computing (JAMC).
  • Reviewer, 9th and 10th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM).
  • Reviewer, 5th International Conference on Machine Learning, Image Pro- cessing, Network Security and Data Sciences (MIND).
  • Reviewer, 2nd International Conference on Mechanics, Electronics, Automation and Automatic Control (MEAAC).

University Service

  • Judge: Graduate Student Poster Symposium in Statler Research Week, Benjamin M. Statler College of Engineering and Mineral Resources, West Virginia University, March 24, 2023.
  • Organizing Committee Member: The 13th International Conference and Workshops on Algorithms and Computation (WALCOM, 2019), Indian Institute of Technology Guwahati, February 27- March 02, 2019.
  • Organizing Committee Member: 4th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM, 2018), Indian Institute of Technology Guwahati, February 12-17, 2018.
  • Committee Member: Global Initiative of Academic Networks (GIAN) Course on Distributed Network Algorithms, Indian Institute of Technology Guwahati, June 27- July 01, 2016.