Adam Viktorin

804 total citations
61 papers, 395 citations indexed

About

Adam Viktorin is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Control and Systems Engineering. According to data from OpenAlex, Adam Viktorin has authored 61 papers receiving a total of 395 indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 12 papers in Control and Systems Engineering. Recurrent topics in Adam Viktorin's work include Metaheuristic Optimization Algorithms Research (45 papers), Evolutionary Algorithms and Applications (32 papers) and Advanced Multi-Objective Optimization Algorithms (15 papers). Adam Viktorin is often cited by papers focused on Metaheuristic Optimization Algorithms Research (45 papers), Evolutionary Algorithms and Applications (32 papers) and Advanced Multi-Objective Optimization Algorithms (15 papers). Adam Viktorin collaborates with scholars based in Czechia, Slovenia and Poland. Adam Viktorin's co-authors include Roman Šenkeřík, Michal Pluháček, Tomáš Kadavý, Aleš Zamuda, Ivan Zelinka, Vlastimír Nevrlý, Radovan Šomplák, Asit Kumar Das, Antonio D. Masegosa and Swagatam Das and has published in prestigious journals such as SHILAP Revista de lepidopterología, Expert Systems with Applications and Energy.

In The Last Decade

Adam Viktorin

49 papers receiving 385 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Adam Viktorin Czechia 10 286 160 38 28 24 61 395
R. Jensi India 4 220 0.8× 85 0.5× 49 1.3× 35 1.3× 43 1.8× 5 331
Luis Miguel Antonio Mexico 8 331 1.2× 297 1.9× 44 1.2× 24 0.9× 28 1.2× 14 439
Yintong Li China 11 330 1.2× 149 0.9× 34 0.9× 43 1.5× 36 1.5× 19 426
Meng Zhou China 9 52 0.2× 35 0.2× 90 2.4× 23 0.8× 23 1.0× 62 266
Raffaele Mascella Italy 8 206 0.7× 100 0.6× 44 1.2× 36 1.3× 42 1.8× 18 303
Siddhartha Bhattacharyya United States 9 93 0.3× 36 0.2× 24 0.6× 41 1.5× 40 1.7× 48 267
Luka Mernik United States 5 221 0.8× 122 0.8× 33 0.9× 27 1.0× 53 2.2× 7 371
Reda Boukezzoula France 14 240 0.8× 50 0.3× 168 4.4× 20 0.7× 8 0.3× 39 452
Abid Hussain Pakistan 7 138 0.5× 65 0.4× 23 0.6× 19 0.7× 20 0.8× 25 265
Shakhnaz Akhmedova Russia 9 351 1.2× 227 1.4× 39 1.0× 18 0.6× 30 1.3× 40 423

Countries citing papers authored by Adam Viktorin

Since Specialization
Citations

This map shows the geographic impact of Adam Viktorin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Adam Viktorin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Adam Viktorin more than expected).

Fields of papers citing papers by Adam Viktorin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Adam Viktorin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Adam Viktorin. The network helps show where Adam Viktorin may publish in the future.

Co-authorship network of co-authors of Adam Viktorin

This figure shows the co-authorship network connecting the top 25 collaborators of Adam Viktorin. A scholar is included among the top collaborators of Adam Viktorin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Adam Viktorin. Adam Viktorin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Eftimov, Tome, et al.. (2025). Comprehensive benchmarking of knowledge graph embeddings methods for Android malware detection. Expert Systems with Applications. 288. 127888–127888.
2.
Pluháček, Michal, et al.. (2024). Using LLM for Automatic Evolvement of Metaheuristics from Swarm Algorithm SOMA. Proceedings of the Genetic and Evolutionary Computation Conference Companion. 2018–2022. 1 indexed citations
3.
Pluháček, Michal, et al.. (2024). A Critical Examination of Large Language Model Capabilities in Iteratively Refining Differential Evolution Algorithm. Proceedings of the Genetic and Evolutionary Computation Conference Companion. 1855–1862. 1 indexed citations
4.
Viktorin, Adam, et al.. (2024). DISH Solving the GNBG-generated Test Suite. Proceedings of the Genetic and Evolutionary Computation Conference Companion. 19–20.
5.
Viktorin, Adam, et al.. (2023). Hierarchical clustering-based algorithms for optimal waste collection point locations in large-scale problems: A framework development and case study. Computers & Industrial Engineering. 178. 109142–109142. 15 indexed citations
6.
Pluháček, Michal, et al.. (2023). Leveraging Large Language Models for the Generation of Novel Metaheuristic Optimization Algorithms. 1812–1820. 22 indexed citations
7.
Kadavý, Tomáš, et al.. (2023). Impact of Boundary Control Methods on Bound-constrained Optimization Benchmarking. 25–26. 1 indexed citations
9.
Šenkeřík, Roman, Aleksander Byrski, Tomáš Kadavý, et al.. (2023). Efficient Time-Delay System Optimization with Auto-Configured Metaheuristics. 1084–1089.
10.
Kadavý, Tomáš, et al.. (2022). Impact of Boundary Control Methods on Bound-Constrained Optimization Benchmarking. IEEE Transactions on Evolutionary Computation. 26(6). 1271–1280. 5 indexed citations
11.
Pluháček, Michal, et al.. (2021). Relation of Neighborhood Size and Diversity Loss Rate in Particle Swarm Optimization With Ring Topology. SHILAP Revista de lepidopterología. 27(2). 74–79. 5 indexed citations
12.
Kadavý, Tomáš, Roman Šenkeřík, Michal Pluháček, & Adam Viktorin. (2020). Orthogonal Learning Firefly Algorithm. Logic Journal of IGPL. 29(2). 167–179. 2 indexed citations
13.
Viktorin, Adam, Roman Šenkeřík, Michal Pluháček, Tomáš Kadavý, & Aleš Zamuda. (2019). DISH Algorithm Solving the CEC 2019 100-Digit Challenge. 1–6. 8 indexed citations
14.
Šenkeřík, Roman, Tomáš Kadavý, Adam Viktorin, & Michal Pluháček. (2019). Ensemble of Strategies and Perturbation Parameter Based SOMA for Constrained Technological Design Optimization Problem. 1. 2872–2877. 1 indexed citations
15.
Viktorin, Adam, Roman Šenkeřík, Michal Pluháček, Tomáš Kadavý, & Aleš Zamuda. (2018). Distance based parameter adaptation for Success-History based Differential Evolution. Swarm and Evolutionary Computation. 50. 100462–100462. 112 indexed citations
16.
Pluháček, Michal, Roman Šenkeřík, Adam Viktorin, & Tomáš Kadavý. (2017). Exploring the shortest path in PSO communication network. 1–6. 3 indexed citations
17.
Pluháček, Michal, Roman Šenkeřík, & Adam Viktorin. (2017). On the impact of cognitive factor in PSO – Testing on selected functions from CEC 15 benchmark. AIP conference proceedings. 1863. 70039–70039.
18.
Kadavý, Tomáš, Michal Pluháček, Adam Viktorin, & Roman Šenkeřík. (2017). Firework Algorithm Dynamics Simulated And Analyzed With The Aid Of Complex Network. 313–318. 1 indexed citations
19.
Viktorin, Adam, Michal Pluháček, Zuzana Komínková Oplatková, & Roman Šenkeřík. (2016). Analytical Programming With Extended Individuals. 237–244.
20.
Pluháček, Michal, Tomáš Kadavý, Roman Šenkeřík, Adam Viktorin, & Ivan Zelinka. (2016). Comparing selected PSO modifications on CEC 15 benchmark set. 2. 1–6. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026