Hemraj | Algorithms | Best Researcher Award

Posted on by usudeeparya

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:

Scopus

Orcid

Google Scholar 

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

Conclusion

Dr. Hemraj Raikwar has demonstrated outstanding research capabilities, strong academic excellence, and impactful contributions to theoretical computer science. His expertise in dynamic graph algorithms, algorithmic optimization, and AI-driven techniques makes him a deserving candidate for the Best Researcher Award.

With further expansion into global collaborations, industry applications, and high-impact journal publications, he can solidify his position as a leading researcher in algorithmic science.

Zhang Zhang | Algorithms | Best Researcher Award

Posted on by usudeeparya

Mr. Zhang Zhang | Algorithms | Best Researcher Award

Phd Student at Beijing Normal University, China📖

Zhang Zhang is a Ph.D. candidate in Complex Systems Analysis at Beijing Normal University, with visiting research experience at the University of California, San Diego, and the University of Padua. His research focuses on AI by Complexity, Machine Learning for Complex Systems, and Complex Networks. He has authored multiple high-impact papers and has received several prestigious awards for his academic excellence and contributions to network science.

Profile

Google Scholar Profile

Education Background🎓

  • Ph.D. in Complex Systems Analysis, Beijing Normal University (2019–Present)
  • Visiting Ph.D. Student, University of California, San Diego (2023–2024)
  • Visiting Ph.D. Student, University of Padua (2022–2023)
  • B.A. in Information Security, Hangzhou Dianzi University (2013–2017)

Professional Experience🌱

  • Research Assistant, Beijing Normal University (2018–2019)
  • Teaching Experience: Taught Python Programming, Machine Learning, and Deep Learning Principles; developed online courses on deep learning with significant engagement.
  • Reviewer for Information Science and Neural Computing and Applications.
Research Interests🔬
  • AI by Complexity
  • Machine Learning for Complex Systems
  • Complex Networks

Author Metrics

  • Total Citations: 252
  • h-index: 7
  • Publications: Featured in Nature Communications, Applied Network Science, Physical Review E, and top AI/complex networks conferences.

Awards & Honors

  • First-Class Scholarship (2020, 2022, 2023) – Beijing Normal University
  • China Scholarship Council (CSC) Scholarship – National High-Level Joint Doctoral Training Program (2022)
  • Best Team Award – Mediterranean School of Complex Networks (2022)
Publications Top Notes 📄

1. The Cinderella Complex: Word embeddings reveal gender stereotypes in movies and books

  • Authors: H. Xu, Z. Zhang, L. Wu, C.J. Wang
  • Journal: PLOS One
  • Volume/Issue: 14(11)
  • DOI: 10.1371/journal.pone.0225385
  • Year: 2019
  • Citations: 89
  • Abstract: This study investigates how word embeddings reveal gender stereotypes in movies and literature, highlighting biases in linguistic representations over time.

2. A General Deep Learning Framework for Network Reconstruction and Dynamics Learning

  • Authors: Z. Zhang, Y. Zhao, J. Liu, S. Wang, R. Tao, R. Xin, J. Zhang
  • Journal: Applied Network Science
  • Volume/Issue: 4, 1-17
  • DOI: 10.1007/s41109-019-0184-x
  • Year: 2019
  • Citations: 64
  • Abstract: This paper presents a deep learning-based framework for reconstructing networks and learning their dynamics from time-series data, with applications in neuroscience and finance.

3. An Interpretable Deep-Learning Architecture of Capsule Networks for Identifying Cell-Type Gene Expression Programs from Single-Cell RNA-Sequencing Data

  • Authors: L. Wang, R. Nie, Z. Yu, R. Xin, C. Zheng, Z. Zhang, J. Zhang, J. Cai
  • Journal: Nature Machine Intelligence
  • Volume/Issue: 2(11), 693-703
  • DOI: 10.1038/s42256-020-00233-8
  • Year: 2020
  • Citations: 53
  • Abstract: This study introduces an interpretable deep-learning model using capsule networks to analyze gene expression patterns, improving accuracy in single-cell sequencing studies.

4. Universal Framework for Reconstructing Complex Networks and Node Dynamics from Discrete or Continuous Dynamics Data

  • Authors: Y. Zhang, Y. Guo, Z. Zhang, M. Chen, S. Wang, J. Zhang
  • Journal: Physical Review E
  • Volume/Issue: 106(3), 034315
  • DOI: 10.1103/PhysRevE.106.034315
  • Year: 2022
  • Citations: 20
  • Abstract: A theoretical framework to reconstruct network structures and node dynamics from both discrete and continuous data, providing insights into complex system behavior.

5. Inferring Network Structure with Unobservable Nodes from Time Series Data

  • Authors: M. Chen, Y. Zhang, Z. Zhang, L. Du, S. Wang, J. Zhang
  • Journal: Chaos: An Interdisciplinary Journal of Nonlinear Science
  • Volume/Issue: 32(1)
  • DOI: 10.1063/5.0071531
  • Year: 2022
  • Citations: 14
  • Abstract: A novel approach to infer hidden structures in dynamic networks where some nodes remain unobservable, with applications in neuroscience and social networks.

Conclusion

Zhang Zhang is an excellent candidate for the Best Researcher Award based on his strong academic contributions, international exposure, and impactful research in Complex Networks and AI by Complexity. His publication record, citations, and involvement in high-quality research collaborations position him as a highly deserving researcher. Strengthening his industry impact, increasing citations, and taking on more leadership roles in research projects would further solidify his case for this prestigious award.