Roman Nedela | Data Science | Innovative Research Award

Published on by Engineering Scientist

Innovative Research Award

Roman Nedela
Zapadoceska univerzita v Plzni, Czech Republic

Roman Nedela
Affiliation Zapadoceska univerzita v Plzni
Country Czech Republic
Scopus ID 6602818470
Documents 105
Citations 1,544
h-index 24
Subject Area Data Science
Event Engineering Scientist Awards
ORCID 0000-0002-9826-704X

Roman Nedela is a researcher affiliated with Zapadoceska univerzita v Plzni in the Czech Republic whose scholarly record includes work associated with mathematical structures, algorithms, combinatorial methods, and computationally relevant research. His Scopus profile records 105 documents, 1,544 citations, and an h-index of 24, providing quantitative evidence of sustained scholarly activity and research visibility.[1]

Abstract

Roman Nedela’s research profile reflects an established academic record spanning algorithmic and mathematical research. His documented publication activity includes studies of automorphisms and isomorphisms of maps and investigations of quadrangle group inclusions. These works demonstrate engagement with rigorous computational and structural problems, including the development and analysis of efficient algorithmic approaches.[2][3]

Keywords

  • Data Science
  • Algorithms
  • Automorphisms
  • Isomorphisms
  • Combinatorics

Introduction

The Innovative Research Award profile considers scholarly activity through publication output, research impact, methodological contribution, and relevance to contemporary scientific inquiry. Nedela’s recorded work provides evidence of sustained engagement with algorithmic and mathematical problems, while his Scopus indicators provide an additional quantitative perspective on the reach of his research.[1]

Research Profile

The available bibliometric record lists 105 documents, 1,544 citations, and an h-index of 24. These indicators suggest a substantial body of indexed scholarly output accompanied by measurable citation activity. His institutional affiliation with Zapadoceska univerzita v Plzni places the research profile within the Czech academic environment.[1]

Research Contributions

The publication record includes research on the algorithmic recognition of automorphisms and isomorphisms of maps. The 2025 article, published in ACM Transactions on Algorithms, addresses these structures in linear time, indicating a focus on computational efficiency and algorithmic complexity.[2] Earlier work on quadrangle group inclusions addresses structural relationships within algebraic and geometric settings.[3]

Publications

  • Automorphisms and Isomorphisms of Maps in Linear Time. ACM Transactions on Algorithms.[2]
  • Quadrangle groups inclusions. Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry.[3]

Research Impact

The recorded citation count of 1,544 and h-index of 24 indicate that Nedela’s publications have received sustained attention within the indexed scholarly literature. These metrics should be interpreted as indicators of bibliometric visibility rather than as independent measures of research quality.[1]

Award Suitability

Based on the supplied bibliometric record and documented publications, Nedela presents a profile that is relevant for consideration for an Innovative Research Award. The combination of 105 indexed documents, 1,544 citations, an h-index of 24, and publications addressing computationally demanding mathematical problems provides objective evidence of sustained research activity and scholarly contribution.[1][2]

Conclusion

Roman Nedela’s academic profile combines substantial indexed publication activity with measurable citation impact and research contributions in algorithmic and mathematical domains. The available evidence supports his consideration within the Engineering Scientist Awards framework, particularly where innovation, methodological rigor, and sustained scholarly contribution are evaluated together.

References

  1. Elsevier. (n.d.). Scopus author details: Roman Nedela, Author ID 6602818470. Scopus.
    https://www.scopus.com/authid/detail.uri?authorId=6602818470
  2. ACM. (2025). Automorphisms and Isomorphisms of Maps in Linear Time. ACM Transactions on Algorithms.
    https://doi.org/10.1145/3686798
  3. Springer. (2017). Quadrangle groups inclusions. Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry.
    https://doi.org/10.1007/s13366-016-0309-3
  4. ORCID. (n.d.). Roman Nedela ORCID record.
    https://orcid.org/0000-0002-9826-704X
  5. Engineering Scientist Awards. (n.d.). Engineering Scientist Awards official website.
    https://engineeringscientist.com/

Tomohiro Hayashida | Machine Learning | Best Researcher Award

Published on by Engineering Scientist

Prof. Tomohiro Hayashida | Machine Learning
| Best Researcher Award

Professor at Hiroshima University , Japan.

Professor Tomohiro Hayashida is a distinguished scholar in decision-making, machine learning, and optimization, currently serving at Hiroshima University. After earning his Master’s and Ph.D. in Engineering from the same institution, he joined the university as a Research Associate in 2006 and steadily rose to Full Professor by 2024. With over 80 academic publications, Prof. Hayashida has led competitive national research grants and worked on practical innovations in transportation and scheduling algorithms. His interdisciplinary collaborations span across academia and industry, reflecting his commitment to both theoretical advancements and real-world applications. His citation record, leadership in JSPS-funded projects, and role in applied AI solutions exemplify his deep impact in computational engineering and operations research.

🌍 Professional Profile:

Scopus

🏆 Suitability for the Best Researcher Award :

Prof. Tomohiro Hayashida exemplifies the qualities deserving of the Best Researcher Award. He has produced over 50 peer-reviewed journal papers, many in top-tier SCI/Scopus-indexed journals. As Principal Investigator of multiple JSPS KAKEN-funded projects, including those in evolutionary computing and dynamic systems, he has shown consistent research leadership. His collaborative work with industry, such as optimizing dispatch algorithms with SmartRyde Inc., demonstrates strong translational research. With an h-index around 11–12 and 442+ citations, he balances scholarly excellence and societal impact. His active role in multi-disciplinary collaborations—both domestic and international—further reinforces his stature as an innovative and impactful researcher, making him highly suitable for the Best Researcher Award.

🎓 Education :

Prof. Hayashida received his entire higher education from Hiroshima University. He completed his Master’s degree in Engineering in 2006 and subsequently pursued and earned his Ph.D. in Engineering. His academic training focused on optimization theory, intelligent systems, and operations research, equipping him with a robust foundation in both theoretical and applied research. The university’s focus on computational intelligence and engineering sciences helped shape his research vision early in his career. His seamless transition from student to researcher within the same academic institution showcases his consistent excellence and growth as a scholar. This strong academic grounding laid the basis for his long-term contributions to machine learning, decision sciences, and interdisciplinary engineering research.

🏢 Work Experience :

Prof. Tomohiro Hayashida began his academic career in 2006 as a Research Associate at Hiroshima University, immediately after earning his Master’s degree. He was promoted to Assistant Professor in 2007, Associate Professor in 2015, and Full Professor in 2024. He has over 18 years of academic experience in teaching, research, and supervision. Beyond academic duties, he is active in government-funded research and industry collaborations, such as the ride-hailing optimization project with SmartRyde Inc. He also contributes to the Digital Manufacturing Education and Research Center at Hiroshima University. His extensive experience in both research project leadership and educational innovation showcases a balanced, impactful academic career with national and international influence.

🏅Awards and Honors

While specific award titles are not publicly listed, Prof. Hayashida’s selection as Principal Investigator for multiple highly competitive JSPS KAKEN Grants—including Young Researcher awards and Scientific Research (C) projects—reflects significant national recognition of his research excellence. His promotion to Full Professor at Hiroshima University, a top-tier Japanese institution, itself is a mark of academic distinction. He has been entrusted with strategic roles in collaborative projects, some of which have gained media coverage, such as the SmartRyde dispatch algorithm. These achievements, combined with a strong citation record and presence in high-impact journals, serve as implicit acknowledgment of his contributions to AI, optimization, and applied decision-making sciences within both academic and practical domains.

🔬 Research Focus :

Prof. Hayashida’s research centers on decision-making, machine learning, optimization, and evolutionary computation. His work addresses complex real-world problems like multi-objective scheduling, group decision analysis, and dynamic system optimization. Through JSPS-funded projects, he has developed algorithms for adaptive agents, cooperative enterprises, and evolutionary scheduling. His recent collaborations include intelligent systems for ride-hailing and dynamic dispatching. He integrates mathematical modeling with practical applications, focusing on AI-driven solutions for industries such as energy systems and transportation. His interdisciplinary approach merges operations research, computer science, and systems engineering. With over 80 publications and national/international partnerships, his research advances both academic knowledge and technological innovation, particularly in adaptive, data-driven decision systems.

📊 Publication Top Notes:

📘 Integrated Optimization Method for Task Allocation and Hierarchical Reinforcement Learning in Cargo Transport Robots
🗓️ Year: 2025 | 📚 Journal: IEEJ Transactions on Electronics Information and Systems |

📄 Constrained-multiobjective Evolutionary Algorithm for Distribution System Reconfiguration under Severe Constraints
🗓️ Year: 2025 | 📚 Conference Paper |

🚚 Integrating Task Allocation and Hierarchical Reinforcement Learning for Optimized Cargo Transport Routing
🗓️ Year: 2025 | 📚 Conference Paper |

⚡ Distribution System Reconfiguration by an Evolutionary Algorithm using Constraint-Guided Dominance and Archive-Based Individual Preservation Strategy
🗓️ Year: 2024 | 📚 IEEJ Transactions on Power and Energy |

📊 Expectation and Fractile Models for Decentralised Distribution Systems under Demand Uncertainty and their Computational Methods
🗓️ Year: 2024 | 📚 International Journal of Operational Research |

🎓 WIP: Machine Learning Models for Predicting Student Performance in IoT-Enhanced Education
🗓️ Year: 2024/2025 | 📚 Conference Paper |

📈 WIP: Study on a Data-Driven Adaptive Learning Support System Design for Individualized Optimal Learning
🗓️ Year: 2024/2025 | 📚 Conference Paper |