Alexander Ageev

1.1k total citations
24 papers, 464 citations indexed

About

Alexander Ageev is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Electrical and Electronic Engineering. According to data from OpenAlex, Alexander Ageev has authored 24 papers receiving a total of 464 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 12 papers in Industrial and Manufacturing Engineering and 6 papers in Electrical and Electronic Engineering. Recurrent topics in Alexander Ageev's work include Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (9 papers) and Optimization and Packing Problems (7 papers). Alexander Ageev is often cited by papers focused on Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (9 papers) and Optimization and Packing Problems (7 papers). Alexander Ageev collaborates with scholars based in Russia, United States and Denmark. Alexander Ageev's co-authors include Maxim Sviridenko, Jiawei Zhang, Yinyu Ye, Refael Hassin, A. V. Kel’manov, È. Kh. Gimadi, A. V. Pyatkin, Alexander Kononov, Zoltán Szigeti and Alexandr Kostochka and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Alexander Ageev

24 papers receiving 433 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alexander Ageev Russia 10 225 209 128 94 88 24 464
Thomas Rothvoß United States 15 301 1.3× 445 2.1× 111 0.9× 43 0.5× 68 0.8× 40 769
Ravishankar Krishnaswamy United States 13 220 1.0× 80 0.4× 109 0.9× 53 0.6× 83 0.9× 39 375
Justin Ward United Kingdom 12 151 0.7× 194 0.9× 22 0.2× 23 0.2× 142 1.6× 26 366
Jérôme Monnot France 15 177 0.8× 353 1.7× 195 1.5× 11 0.1× 85 1.0× 70 608
Bodo Manthey Germany 10 86 0.4× 113 0.5× 72 0.6× 15 0.2× 136 1.5× 50 346
Illya V. Hicks United States 10 167 0.7× 214 1.0× 49 0.4× 13 0.1× 117 1.3× 44 481
Wansoo T. Rhee United States 13 131 0.6× 84 0.4× 240 1.9× 15 0.2× 69 0.8× 66 503
Jacobo Valdes United States 8 183 0.8× 224 1.1× 93 0.7× 8 0.1× 100 1.1× 9 513
Dror Rawitz Israel 12 347 1.5× 233 1.1× 118 0.9× 7 0.1× 56 0.6× 71 541
Vladimir G. Deı̌neko United Kingdom 11 103 0.5× 104 0.5× 256 2.0× 8 0.1× 55 0.6× 45 463

Countries citing papers authored by Alexander Ageev

Since Specialization
Citations

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

Fields of papers citing papers by Alexander Ageev

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alexander Ageev

This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Ageev. A scholar is included among the top collaborators of Alexander Ageev 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 Alexander Ageev. Alexander Ageev 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.
Ageev, Alexander, A. V. Kel’manov, & A. V. Pyatkin. (2014). NP-hardness of the Euclidean Max-Cut problem. Doklady Mathematics. 89(3). 343–345. 7 indexed citations
2.
Ageev, Alexander, A. V. Kel’manov, & A. V. Pyatkin. (2014). Complexity of the weighted max-cut in Euclidean space. Journal of Applied and Industrial Mathematics. 8(4). 453–457. 3 indexed citations
3.
Ageev, Alexander. (2008). Metric location problems with nonshortest service routes. Journal of Applied and Industrial Mathematics. 2(3). 311–316. 1 indexed citations
4.
Ageev, Alexander. (2008). A 3/2-Approximation for the proportionate two-machine flow shop scheduling with minimum delays. Journal of Applied and Industrial Mathematics. 2(4). 447–454. 2 indexed citations
5.
Ageev, Alexander, et al.. (2007). A 3/4-approximation algorithm for finding two disjoint Hamiltonian cycles of maximum weight. Journal of Applied and Industrial Mathematics. 1(2). 142–147. 12 indexed citations
6.
Ageev, Alexander, et al.. (2007). Computational complexity of the graph approximation problem. Journal of Applied and Industrial Mathematics. 1(1). 1–8. 9 indexed citations
7.
Ageev, Alexander, et al.. (2006). Open block scheduling in optical communication networks. Theoretical Computer Science. 361(2-3). 257–274. 1 indexed citations
8.
Ageev, Alexander, et al.. (2006). Approximation algorithms for UET scheduling problems with exact delays. Operations Research Letters. 35(4). 533–540. 26 indexed citations
9.
Ageev, Alexander & Maxim Sviridenko. (2004). Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. Journal of Combinatorial Optimization. 8(3). 307–328. 199 indexed citations
10.
Ageev, Alexander, Yinyu Ye, & Jiawei Zhang. (2004). Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. SIAM Journal on Discrete Mathematics. 18(1). 207–217. 52 indexed citations
11.
Ageev, Alexander. (2002). Improved approximation algorithms for multilevel facility location problems. Operations Research Letters. 30(5). 327–332. 26 indexed citations
12.
Ageev, Alexander. (2001). Complexity of finding a join of maximum weight. Discrete Applied Mathematics. 114(1-3). 3–7. 1 indexed citations
13.
Ageev, Alexander & Alexandr Kostochka. (2000). Vertex Set Partitions Preserving Conservativeness. Journal of Combinatorial Theory Series B. 80(2). 202–217. 1 indexed citations
14.
Ageev, Alexander & Maxim Sviridenko. (1999). An 0.828-approximation algorithm for the uncapacitated facility location problem. Discrete Applied Mathematics. 93(2-3). 149–156. 57 indexed citations
15.
Ageev, Alexander. (1999). Every circle graph of girth at least 5 is 3-colourable. Discrete Mathematics. 195(1-3). 229–233. 6 indexed citations
16.
Ageev, Alexander & Maxim Sviridenko. (1999). An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. BRICS Report Series. 6(49). 4 indexed citations
17.
Ageev, Alexander, Alexandr Kostochka, & Zoltán Szigeti. (1997). A characterization of Seymour graphs. Journal of Graph Theory. 24(4). 357–364. 5 indexed citations
18.
Ageev, Alexander. (1996). A triangle-free circle graph with chromatic number 5. Discrete Mathematics. 152(1-3). 295–298. 11 indexed citations
19.
Ageev, Alexander. (1992). A Criterion of Polynomial-Time Solvability for the Network Location Problem.. 237–245. 2 indexed citations
20.
Ageev, Alexander, et al.. (1990). Polynomially Solvable Cases of the Simple Plant Location Problem. 1–6. 4 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