V. A. Ustimenko

892 total citations
13 papers, 478 citations indexed

About

V. A. Ustimenko is a scholar working on Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering and Artificial Intelligence. According to data from OpenAlex, V. A. Ustimenko has authored 13 papers receiving a total of 478 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Discrete Mathematics and Combinatorics, 8 papers in Electrical and Electronic Engineering and 6 papers in Artificial Intelligence. Recurrent topics in V. A. Ustimenko's work include Finite Group Theory Research (10 papers), graph theory and CDMA systems (8 papers) and Coding theory and cryptography (6 papers). V. A. Ustimenko is often cited by papers focused on Finite Group Theory Research (10 papers), graph theory and CDMA systems (8 papers) and Coding theory and cryptography (6 papers). V. A. Ustimenko collaborates with scholars based in United States, Ukraine and Poland. V. A. Ustimenko's co-authors include Felix Lazebnik, Andrew J. Woldar, Ákos Seress, Zoltán Füredi, Tony Shaska and Youry Khmelevsky and has published in prestigious journals such as Bulletin of the American Mathematical Society, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

V. A. Ustimenko

13 papers receiving 430 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
V. A. Ustimenko United States	10	254	233	215	200	149	13	478
Gábor Simonyi Hungary	12	213 0.8×	66 0.3×	94 0.4×	294 1.5×	111 0.7×	40	423
Levon H. Khachatrian Germany	10	372 1.5×	100 0.4×	185 0.9×	303 1.5×	154 1.0×	22	523
Aart Blokhuis Netherlands	14	462 1.8×	443 1.9×	389 1.8×	122 0.6×	96 0.6×	55	656
Geňa Hahn Canada	12	189 0.7×	52 0.2×	104 0.5×	324 1.6×	109 0.7×	26	425
L. Pyber Hungary	13	366 1.4×	100 0.4×	147 0.7×	267 1.3×	145 1.0×	27	450
Geoffrey Exoo United States	12	267 1.1×	93 0.4×	191 0.9×	424 2.1×	238 1.6×	61	609
Philippe Delsarte Belgium	8	165 0.6×	315 1.4×	270 1.3×	85 0.4×	43 0.3×	16	444
T. D. Parsons United States	13	344 1.4×	97 0.4×	190 0.9×	305 1.5×	208 1.4×	32	500
Simeon Ball Spain	16	404 1.6×	576 2.5×	427 2.0×	130 0.7×	69 0.5×	54	732
Y. Roditty Israel	10	203 0.8×	50 0.2×	115 0.5×	446 2.2×	84 0.6×	45	528

Countries citing papers authored by V. A. Ustimenko

Since Specialization

Citations

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

Fields of papers citing papers by V. A. Ustimenko

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of V. A. Ustimenko

This figure shows the co-authorship network connecting the top 25 collaborators of V. A. Ustimenko. A scholar is included among the top collaborators of V. A. Ustimenko 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 V. A. Ustimenko. V. A. Ustimenko is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

13 of 13 papers shown

Ustimenko, V. A.. (2009). ALGEBRAIC GROUPS AND SMALL WORLD GRAPHS OF HIGH GIRTH. 3(1). 6 indexed citations

Shaska, Tony & V. A. Ustimenko. (2008). ON SOME APPLICATIONS OF GRAPHS TO CRYPTOGRAPHY AND TURBOCODING. 2(3). 6 indexed citations

Ustimenko, V. A.. (2007). On Graph-Based Cryptography and Symbolic Computations. Bulgarian Digital Mathematics Library (BulDML) at IMI-BAS (Institute of Mathematics and Informatics). 1(2). 131–156. 31 indexed citations

Ustimenko, V. A. & Youry Khmelevsky. (2002). Walks on graphs as symmetric or asymmetric tools to encrypt data. 20(1). 34–44. 3 indexed citations

Ustimenko, V. A.. (2002). Graphs with Special Arcs and Cryptography. Acta Applicandae Mathematicae. 74(2). 117–153. 33 indexed citations

Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1999). Polarities and 2k-cycle-free graphs. Discrete Mathematics. 197-198. 503–513. 11 indexed citations

Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1997). New upper bounds on the order of cages.. The Electronic Journal of Combinatorics. 4. 31 indexed citations

Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1996). A characterization of the components of the graphs D(k,q). Discrete Mathematics. 157(1-3). 271–283. 34 indexed citations

Füredi, Zoltán, Felix Lazebnik, Ákos Seress, V. A. Ustimenko, & Andrew J. Woldar. (1995). Graphs of Prescribed Girth and Bi-Degree. Journal of Combinatorial Theory Series B. 64(2). 228–239. 25 indexed citations

10.

Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1995). A new series of dense graphs of high girth. Bulletin of the American Mathematical Society. 32(1). 73–79. 140 indexed citations

11.

Lazebnik, Felix & V. A. Ustimenko. (1995). Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Applied Mathematics. 60(1-3). 275–284. 98 indexed citations

12.

Lazebnik, Felix, V. A. Ustimenko, & Andrew J. Woldar. (1994). Properties of Certain Families of 2k-Cycle-Free Graphs. Journal of Combinatorial Theory Series B. 60(2). 293–298. 16 indexed citations

13.

Lazebnik, Felix & V. A. Ustimenko. (1993). New Examples of Graphs without Small Cycles and of Large Size. European Journal of Combinatorics. 14(5). 445–460. 44 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