V. A. Ustimenko

898 citations
13 papers · 481 · h-index 10

Impact in

Papers in

V. A. Ustimenko

13 papers receiving 434 citations

Peers

V. A. Ustimenko
Comparison fields: 5 of 29
  • Discrete Mathematics and Combinatorics 254
  • Geometry and Topology 148
  • Computational Theory and Mathematics 202
  • Artificial Intelligence 234
  • Computer Networks and Communications 88
Replace Gábor Simonyi with:
Gábor Simonyi Hungary
Geňa Hahn Canada
Levon H. Khachatrian Germany
Aart Blokhuis Netherlands
L. Pyber Hungary
Geoffrey Exoo United States
Y. Roditty Israel
Ilia Ponomarenko Russia
T. D. Parsons United States
Simeon Ball Spain
V. A. Ustimenko relative to Gábor Simonyi Hungary Gábor Simonyi's profile →
Citations per field
00.5×3.5×
Gábor Simonyi · 1×
Citations per year

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-authors

The 5 scholars most cited alongside V. A. Ustimenko, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with V. A. Ustimenko Line = papers co-authored together V. A. Ustimenko links everyone, so they are left out of the graph.

All Works

13 of 13 papers shown
#Work
1 1995142
2 1995100
3 199344
4 199634
5 200233
6 200731
7
New upper bounds on the order of cages.
199730
8 199525
9 199416
10 199911
11 20096
12 20086
13 20023

About V. A. Ustimenko

V. A. Ustimenko is a scholar working on Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Artificial Intelligence, Geometry and Topology and Computational Theory and Mathematics, having authored 13 papers that have together received 481 indexed citations. Recurring topics across this work include Finite Group Theory Research (10 papers), graph theory and CDMA systems (8 papers), Coding theory and cryptography (6 papers), Limits and Structures in Graph Theory (5 papers), Graph theory and applications (3 papers), Advanced Graph Theory Research (3 papers), Commutative Algebra and Its Applications (1 paper) and Error Correcting Code Techniques (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (254 citations), Geometry and Topology (148 citations), Computational Theory and Mathematics (202 citations), Artificial Intelligence (234 citations) and Computer Networks and Communications (88 citations). V. A. Ustimenko has collaborated with scholars based in United States, Ukraine and Poland. Frequent co-authors include Felix Lazebnik, Andrew J. Woldar, Zoltán Füredi, Ákos Seress and Youry Khmelevsky. Their work appears in journals such as Journal of Combinatorial Theory Series B, Discrete Mathematics, Discrete Applied Mathematics, European Journal of Combinatorics and The Electronic Journal of Combinatorics.

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