Yaroslav D. Sergeyev

5.8k total citations
133 papers, 3.2k citations indexed

About

Yaroslav D. Sergeyev is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Mathematical Physics. According to data from OpenAlex, Yaroslav D. Sergeyev has authored 133 papers receiving a total of 3.2k indexed citations (citations by other indexed papers that have themselves been cited), including 78 papers in Computational Theory and Mathematics, 63 papers in Numerical Analysis and 47 papers in Mathematical Physics. Recurrent topics in Yaroslav D. Sergeyev's work include Advanced Optimization Algorithms Research (53 papers), Mathematical and Theoretical Analysis (46 papers) and Numerical Methods and Algorithms (39 papers). Yaroslav D. Sergeyev is often cited by papers focused on Advanced Optimization Algorithms Research (53 papers), Mathematical and Theoretical Analysis (46 papers) and Numerical Methods and Algorithms (39 papers). Yaroslav D. Sergeyev collaborates with scholars based in Italy, Russia and Japan. Yaroslav D. Sergeyev's co-authors include Dmitri E. Kvasov, Roman G. Strongin, Daniela Lera, Marat S. Mukhametzhanov, Vladimir Grishagin, Alfredo Garro, Remigijus Paulavičius, Julius Žilinskas, Marco Cococcioni and M. Pappalardo and has published in prestigious journals such as Scientific Reports, Automatica and European Journal of Operational Research.

In The Last Decade

Yaroslav D. Sergeyev

128 papers receiving 3.1k citations

Peers

Yaroslav D. Sergeyev
Victor Klee United States
I. J. Schoenberg United States
E. W. Cheney United States
R. Baker Kearfott United States
Richard Vinter United Kingdom
Stephen M. Robinson United States
George J. Minty United States
Hans Sagan United States
Victor Klee United States
Yaroslav D. Sergeyev
Citations per year, relative to Yaroslav D. Sergeyev Yaroslav D. Sergeyev (= 1×) peers Victor Klee

Countries citing papers authored by Yaroslav D. Sergeyev

Since Specialization
Citations

This map shows the geographic impact of Yaroslav D. Sergeyev'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 Yaroslav D. Sergeyev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yaroslav D. Sergeyev more than expected).

Fields of papers citing papers by Yaroslav D. Sergeyev

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yaroslav D. Sergeyev. 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 Yaroslav D. Sergeyev. The network helps show where Yaroslav D. Sergeyev may publish in the future.

Co-authorship network of co-authors of Yaroslav D. Sergeyev

This figure shows the co-authorship network connecting the top 25 collaborators of Yaroslav D. Sergeyev. A scholar is included among the top collaborators of Yaroslav D. Sergeyev 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 Yaroslav D. Sergeyev. Yaroslav D. Sergeyev 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.
Lera, Daniela, et al.. (2024). Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots. Journal of Global Optimization. 89(2). 415–434. 1 indexed citations
2.
Sergeyev, Yaroslav D., et al.. (2022). Numerical methods using two different approximations of space-filling curves for black-box global optimization. Journal of Global Optimization. 88(3). 707–722. 4 indexed citations
3.
Sergeyev, Yaroslav D.. (2022). Lower and Upper Estimates of the Quantity of Algebraic Numbers. Mediterranean Journal of Mathematics. 20(1). 2 indexed citations
4.
Posypkin, Mikhail & Yaroslav D. Sergeyev. (2022). Efficient smooth minorants for global optimization of univariate functions with the first derivative satisfying the interval Lipschitz condition. Journal of Global Optimization. 1 indexed citations
5.
Falcone, Alberto, Alfredo Garro, Marat S. Mukhametzhanov, & Yaroslav D. Sergeyev. (2022). Advantages of the usage of the Infinity Computer for reducing the Zeno behavior in hybrid system models. Soft Computing. 27(12). 8189–8208. 1 indexed citations
6.
Falcone, Alberto, Alfredo Garro, Marat S. Mukhametzhanov, & Yaroslav D. Sergeyev. (2022). Simulation of hybrid systems under Zeno behavior using numerical infinitesimals. Communications in Nonlinear Science and Numerical Simulation. 111. 106443–106443. 6 indexed citations
8.
Sergeyev, Yaroslav D., Dmitri E. Kvasov, & Marat S. Mukhametzhanov. (2021). A Generator of Multiextremal Test Classes With Known Solutions for Black-Box-Constrained Global Optimization. IEEE Transactions on Evolutionary Computation. 26(6). 1261–1270. 5 indexed citations
9.
Cococcioni, Marco, et al.. (2020). Solving the Lexicographic Multi-Objective Mixed-Integer Linear Programming Problem using branch-and-bound and grossone methodology. Communications in Nonlinear Science and Numerical Simulation. 84. 105177–105177. 32 indexed citations
10.
Falcone, Alberto, Alfredo Garro, Marat S. Mukhametzhanov, & Yaroslav D. Sergeyev. (2020). Representation of grossone-based arithmetic in simulink for scientific computing. Soft Computing. 24(23). 17525–17539. 12 indexed citations
11.
Leone, Renato De, Giovanni Fasano, Massimo Roma, & Yaroslav D. Sergeyev. (2020). Iterative Grossone-Based Computation of Negative Curvature Directions in Large-Scale Optimization. Journal of Optimization Theory and Applications. 186(2). 554–589. 12 indexed citations
12.
Paulavičius, Remigijus, Yaroslav D. Sergeyev, Dmitri E. Kvasov, & Julius Žilinskas. (2019). Globally-biased BIRECT algorithm with local accelerators for expensive global optimization. Expert Systems with Applications. 144. 113052–113052. 40 indexed citations
13.
Sergeyev, Yaroslav D., Dmitri E. Kvasov, & Marat S. Mukhametzhanov. (2018). On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget. Scientific Reports. 8(1). 453–453. 144 indexed citations
14.
Cococcioni, Marco, M. Pappalardo, & Yaroslav D. Sergeyev. (2017). Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm. Applied Mathematics and Computation. 318. 298–311. 53 indexed citations
15.
Amodio, Pierluigi, Felice Iavernaro, Francesca Mazzia, Marat S. Mukhametzhanov, & Yaroslav D. Sergeyev. (2016). A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic. Mathematics and Computers in Simulation. 141. 24–39. 45 indexed citations
16.
Sergeyev, Yaroslav D., Marat S. Mukhametzhanov, Francesca Mazzia, Felice Iavernaro, & Pierluigi Amodio. (2016). Numerical Methods for Solving Initial Value Problems on the Infinity Computer.. International journal of unconventional computing. 12. 3–23. 29 indexed citations
17.
Lera, Daniela & Yaroslav D. Sergeyev. (2016). Space-filling curves and multiple estimates of Hölder constants in derivative-free global optimization. AIP conference proceedings. 1738. 400008–400008. 1 indexed citations
18.
Sergeyev, Yaroslav D.. (2013). Solving ordinary differential equations by working with infinitesimals numerically on the Infinity Computer. PhilPapers (PhilPapers Foundation). 34 indexed citations
19.
Sergeyev, Yaroslav D.. (2006). Mathematical foundations of the infinity computer. Studia Iuridica Lublinensia (Uniwersytet Marii Curie-Skłodowskiej w Lublinie). 4(1). 20–33. 7 indexed citations
20.
Strongin, Roman G. & Yaroslav D. Sergeyev. (2000). Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications). Springer eBooks. 61 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