Mr. Hemraj | Algorithms | Best Researcher Award
Research Scholar at IIT Guwahati, India.
Dr. Hemraj Raikwar is a Ph.D. research scholar in the Department of Computer Science & Engineering at IIT Guwahati, specializing in theoretical computer science and dynamic graph algorithms. His research focuses on designing incremental, decremental, and fully dynamic algorithms for maintaining approximate Steiner trees in dynamic graphs. With a strong foundation in algorithm analysis, object-oriented programming, and machine learning, he has contributed to top-tier international conferences and journals. His work has been recognized with the Outstanding Paper Award at CANDAR 2023, and he actively reviews for leading computer science journals.
Professional Profile:
Education Background
Dr. Raikwar is currently pursuing a Ph.D. in Computer Science & Engineering at IIT Guwahati, where he is working under the supervision of Prof. Sushanta Karmakar on developing efficient dynamic algorithms for the Steiner tree problem. He earned his B.Tech in Computer Science & Engineering from Guru Ghasidas Central University, Bilaspur, graduating with an 8.81 CGPA in 2018. His early education was at Jawahar Navodaya Vidyalaya, Khurai, where he excelled in mathematics and computer science, scoring 88.6% in higher secondary.
Professional Development
Dr. Raikwar has been an active reviewer for the American Journal of Computer Science and Technology since April 2024. He has also served as a Computing Lab Teaching Assistant at IIT Guwahati in multiple academic terms, including 2019, 2020, and 2022, where he mentored students in data structures and programming. His experience spans algorithm analysis, machine learning, Linux-based programming, and dynamic algorithm techniques, making him proficient in teaching and research.
Research Focus
Dr. Raikwar’s research primarily focuses on dynamic graph algorithms, with an emphasis on the Steiner tree problem. He works on designing incremental, decremental, and fully dynamic algorithms that maintain efficient approximations of Steiner trees in evolving graphs. His broader interests include algorithm optimization, combinatorial optimization, approximation algorithms, and artificial intelligence, particularly in applications requiring fast and scalable algorithmic solutions.
Author Metrics:
Dr. Raikwar has published extensively in leading IEEE, ACM, and computational science journals. His notable works include:
- “Fully Dynamic Algorithm for Steiner Tree Using Dynamic Distance Oracle”, ICDCN 2022
- “Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs”, CANDARW 2022
- “An Incremental Algorithm for (2−𝜖)-Approximate Steiner Tree”, CANDAR 2023 (Outstanding Paper Award)
- “Dynamic Algorithms for Approximate Steiner Trees”, Concurrency & Computation, 2025
His research contributions have been recognized in international conferences, earning best paper awards and citations in algorithmic research.
Honors & Awards
Dr. Raikwar has received several prestigious accolades, including the Outstanding Paper Award at CANDAR 2023 for his contributions to dynamic Steiner tree algorithms. He secured a GATE score of 671/1000 with an AIR of 840 and was selected for the Indo-German School for Algorithms in Big Data at IIT Bombay (2019). His academic achievements also include 1st position in the International Science Talent Search Exam (2007) and a 100% score in Logical Reasoning in the Science Olympiad Foundation (2010).
Publication Top Notes
1. Calorie Estimation from Fast Food Images Using Support Vector Machine
Authors: H. Raikwar, H. Jain, A. Baghel
Journal: International Journal on Future Revolution in Computer Science
Year: 2018
Citations: 9
2. Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs
Authors: H. Raikwar, S. Karmakar
Conference: 2022 Tenth International Symposium on Computing and Networking Workshops (CANDARW)
Year: 2022
Citations: 1
3. An Incremental Algorithm for (2-ε)-Approximate Steiner Tree Requiring O(n) Update Time
Authors: H. Raikwar, S. Karmakar
Conference: 2023 Eleventh International Symposium on Computing and Networking (CANDAR)
Year: 2023
4. Fully Dynamic Algorithm for Steiner Tree using Dynamic Distance Oracle
Authors: H. Raikwar, S. Karmakar
Conference: Proceedings of the 23rd International Conference on Distributed Computing (DISC)
Year: 2022