V. E. Alekseev
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 15
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 5
-
- Interconnection Networks and Systems 3
V. E. Alekseev
21 papers receiving 283 citations
Peers
Comparison fields: 5 of 34
- Discrete Mathematics and Combinatorics 97
- Computational Theory and Mathematics 242
- Geometry and Topology 54
- Computer Graphics and Computer-Aided Design 16
- Computer Networks and Communications 78
Countries citing papers authored by V. E. Alekseev
This map shows the geographic impact of V. E. Alekseev'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. E. Alekseev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V. E. Alekseev more than expected).
Fields of papers citing papers by V. E. Alekseev
This network shows the impact of papers produced by V. E. Alekseev. 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. E. Alekseev. The network helps show where V. E. Alekseev may publish in the future.
Co-authors
The 2 scholars most cited alongside V. E. Alekseev, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 24 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 58 | |
| 2 | 2007 | 52 | |
| 3 | 2003 | 49 | |
| 4 | 1993 | 24 | |
| 5 | 2004 | 23 | |
| 6 | 1969 | 17 | |
| 7 | 2004 | 16 | |
| 8 | 2009 | 12 | |
| 9 | 2011 | 8 | |
| 10 | 2004 | 7 | |
| 11 | 2003 | 6 | |
| 12 | 2003 | 5 | |
| 13 | 2015 | 4 | |
| 14 | 2007 | 3 | |
| 15 | 2001 | 3 | |
| 16 | 2007 | 3 | |
| 17 | 1974 | 2 | |
| 18 | 2016 | 2 | |
| 19 | 1967 | 1 | |
| 20 | 2008 | 1 |
About V. E. Alekseev
V. E. Alekseev is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Geometry and Topology and Electrical and Electronic Engineering, having authored 24 papers that have together received 297 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (15 papers), Graph Labeling and Dimension Problems (8 papers), graph theory and CDMA systems (5 papers), Complexity and Algorithms in Graphs (5 papers), Limits and Structures in Graph Theory (5 papers), Graph theory and applications (5 papers), Interconnection Networks and Systems (3 papers) and Coding theory and cryptography (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (97 citations), Computational Theory and Mathematics (242 citations), Geometry and Topology (54 citations), Computer Graphics and Computer-Aided Design (16 citations) and Computer Networks and Communications (78 citations). V. E. Alekseev has collaborated with scholars based in Russia, United States and Netherlands. Frequent co-authors include Vadim Lozin and D. S. Malyshev. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Theoretical Computer Science, Discrete Mathematics & Theoretical Computer Science and Journal of Applied and Industrial Mathematics.
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.